Post-Quantum Zero-Knowledge Proofs for Accumulators with Applications to Ring Signatures from Symmetric-Key Primitives

  title={Post-Quantum Zero-Knowledge Proofs for Accumulators with Applications to Ring Signatures from Symmetric-Key Primitives},
  author={David Derler and Sebastian Ramacher and Daniel Slamanig},
  booktitle={IACR Cryptology ePrint Archive},
In this paper we address the construction of privacy-friendly cryptographic primitives for the post-quantum era and in particular accumulators with zero-knowledge membership proofs and ring signatures. This is an important topic as it helps to protect the privacy of users in online authentication or emerging technologies such as cryptocurrencies. Recently, we have seen first such constructions, mostly based on assumptions related to codes and lattices. We, however, ask whether it is possible to… 

Post-Quantum Group Signatures from Symmetric Primitives Dan

The study of group signature schemes built only from symmetric primitives, such as hash functions and PRFs, widely regarded as the safest primitives for post-quantum security are initiated.

New Code-Based Privacy-Preserving Cryptographic Constructions

This paper focuses on the subfield of privacy-preserving cryptographic constructions, which is still rather underdeveloped, e.g., important building blocks such as zero-knowledge range proofs and set membership proofs, and even proofs of knowledge of a hash preimage, have not been known under code-based assumptions.

Towards Practical Lattice-Based One-Time Linkable Ring Signatures

Ring signatures have recently gained attention due to their applicability in the construction of practical anonymous cryptocurrencies, where they are used to secure transactions while hiding the identity of the actual spender.

Committing to quantum resistance: a slow defence for Bitcoin against a fast quantum computing attack

This paper considers the threats a quantum-capable adversary could impose on Bitcoin, which currently uses the Elliptic Curve Digital Signature Algorithm (ECDSA) to sign transactions, and proposes a simple but slow commit–delay–reveal protocol, which allows users to securely move their funds from old (non-quantum-resistant) outputs to those adhering to a Quantum-resistant digital signature scheme.

Traceable ring signatures: general framework and post-quantum security

This work proposes a general framework of TRS, using a non-interactive zero-knowledge proof of knowledge, a hash family, and a pseudorandom function with some additional properties, and gives two concrete efficient TRS schemes from lattices and symmetric-key primitives respectively, which are proven to be secure in the quantum random oracle model.

Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures

This work uses the "MPC-in-the-head" paradigm with MPC protocols in the preprocessing model to construct a signature scheme based only on symmetric-key primitives (and hence with "post-quantum" security); the resulting scheme has shorter signatures than the scheme built using ZKB++ (and comparable signing/verification time), and is even competitive with hash-based signature schemes.

Towards Practical and Round-Optimal Lattice-Based Threshold and Blind Signatures

This work improves the state of art lattice-based construction by Hauck et al as follows and improves the round complexity from three to two and reduces the amount of noise flooding from 2 down to √ QS, where QS is the bound on the number of signatures and λ is the security parameter.

Post-Quantum EPID Group Signatures from Symmetric Primitives

  • D. Boneh
  • Computer Science, Mathematics
  • 2018
The study of group signature schemes built only from symmetric primitives, such as hash functions and PRFs, widely regarded as the safest primitives for post-quantum security are initiated.

Efficient Construction of Nominative Signature Secure under Symmetric Key Primitives and Standard Assumptions on Lattice

This work provides a new construction for nominative signature from standard assumptions on lattice that achieves security under unforgeability, invisibility, impersonation and non-repudiation in existing model and exhibits non-transferability.

New code-based cryptographic accumulator and fully dynamic group signature

The proposed code-based cryptographic accumulator is based on the hardness of the Syndrome Decoding problem and satisfies the collision freeness and indistinguishability requirements, and an implementation of the scheme is given, to the best of the knowledge, the first direct implementation of a post-quantum cryptographic accumulators.



Post-Quantum Zero-Knowledge and Signatures from 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, believed to be quantum-secure, and (b) have

Digital Signatures from Symmetric-Key Primitives

One of the schemes is yielding the first practical instantiation of a design paradigm due to Bellare and Goldwasser without relying on structured hardness assumptions, and the whole design spectrum is explored to obtain optimal parameter choices for different settings.

MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity

We explore cryptographic primitives with low multiplicative complexity. This is motivated by recent progress in practical applications of secure multi-party computation (MPC), fully homomorphic

RingRainbow - An Efficient Multivariate Ring Signature Scheme

This paper proposes a simple and efficient technique to extend arbitrary multivariate signature schemes to ring signature schemes and illustrates it using the example of Rainbow, providing perfect anonymity for the signer, as well as shorter ring signatures than all previously proposed post-quantum ring signatures schemes.

On the Minimal Assumptions of Group Signature Schemes

This work shows that the construction of secure group signature schemes based solely on the existence of one-way functions is unlikely, in contrast to what is known for standard signature schemes, which can be constructed from any one- way function.

Ligero: Lightweight Sublinear Arguments Without a Trusted Setup

A simple zero-knowledge argument protocol for NP whose communication complexity is proportional to the square-root of the verification circuit size, which is attractive not only for very large verification circuits but also for moderately large circuits that arise in applications.

A New Efficient Threshold Ring Signature Scheme Based on Coding Theory

This scheme is existentially unforgeable under a chosen message attack in the random oracle model assuming the hardness of the minimum distance problem, is unconditionally source hiding, has a very short public key and has an overall complexity in O(N).

Ring Signatures of Sub-linear Size Without Random Oracles

A variation of the ring signature scheme is offered, where the signer is guaranteed anonymity even if the common reference string is maliciously generated, and an additional feature of this scheme is that it has perfect anonymity.

Efficient Ring Signatures in the Standard Model

A ring signature scheme allows one party to sign messages on behalf of an arbitrary set of users, called the ring. The anonymity of the scheme guarantees that the signature does not reveal which

Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model

We present a construction for non-interactive zero-knowledge proofs of knowledge in the random oracle model from general sigma-protocols. Our construction is secure against quantum adversaries. Prior