Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Practical Post-Quantum Signature Schemes from Isomorphism Problems of Trilinear Forms

    In this paper, we propose a practical signature scheme based on the alternating trilinear form equivalence problem. Our scheme is inspired by the Goldreich-Micali-Wigderson’s zero-knowledge protocol for graph ...

    Gang Tang, Dung Hoang Duong, Antoine Joux in Advances in Cryptology – EUROCRYPT 2022 (2022)

  2. No Access

    Chapter and Conference Paper

    Learning Domain Invariant Word Representations for Parsing Domain Adaptation

    We show that strong domain adaptation results for dependency parsing can be achieved using a conceptually simple method that learns domain-invariant word representations. Lacking labeled resources, dependency ...

    **uming Qiao, Yue Zhang, Tiejun Zhao in Natural Language Processing and Chinese Computing (2019)

  3. Chapter and Conference Paper

    General Linear Group Action on Tensors: A Candidate for Post-quantum Cryptography

    Starting from the one-way group action framework of Brassard and Yung (Crypto’90), we revisit building cryptography based on group actions. Several previous candidates for one-way group actions no longer stand...

    Zhengfeng Ji, Youming Qiao, Fang Song, Aaram Yun in Theory of Cryptography (2019)

  4. No Access

    Chapter and Conference Paper

    On the Complexity of Trial and Error for Constraint Satisfaction Problems

    In a recent work of Bei, Chen and Zhang (STOC 2013), a trial and error model of computing was introduced, and applied to some constraint satisfaction problems. In this model the input is hidden by an oracle wh...

    Gábor Ivanyos, Raghav Kulkarni, Youming Qiao in Automata, Languages, and Programming (2014)

  5. No Access

    Chapter and Conference Paper

    Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups

    We consider the problem of testing isomorphism of groups of order n given by Cayley tables. The trivial n logn bound on the time complexity for the general case has not been impro...

    László Babai, Paolo Codenotti, Youming Qiao in Automata, Languages, and Programming (2012)