Nov 25, 2016 · In this paper, we present a new post-quantum digital signature algorithm that derives its security entirely from assumptions about symmetric-key ...

We propose a new class of post-quantum digital signa- ture schemes that: (a) derive their security entirely from the security of symmetric-key primitives, ...

We propose a new class of post-quantum digital signature schemes that: (a) derive their security entirely from the security of symmetric-key primitives.

Jul 1, 2024 · In this paper we propose a new lightweight authentication protocol which is efficient, reliable and, properly instantiated, suitable for the post-quantum world.

A new post-quantum digital signature algorithm that derives its security entirely from assumptions about symmetric-key primitives, which are very well ...

Nov 2, 2017 · Efficient Σ-protocols for arithmetic circuits. • generalization, simplification, implementation of “MPC-in-the-head” [IKOS07].

After >30 years of ZK we have the first truly efficient protocols for generic statements. Many applications are enabled by efficient ZK for arbitrary circuits.

May 17, 2022 · In this paper we develop and systematically apply lifting strategies to such proof protocols in order to increase soundness and reduce proof size.

We discuss applications and optimization of such proof systems as building blocks for practical advanced cryptographic protocols such as ring signatures and ...

Mar 28, 2017 · Fish/ Picnic: Two new efficient post-quantum signature schemes in ROM and QROM. Applications beyond signatures: NIZK proof system for.