A Note on the Post-Quantum Security of (Ring) Signatures

  title={A Note on the Post-Quantum Security of (Ring) Signatures},
  author={Rohit Chatterjee and Kai-Min Chung and Xiao Liang and Giulio Malavolta},
  booktitle={IACR Cryptol. ePrint Arch.},
This work revisits the security of classical signatures and ring signatures in a quantum world. For (ordinary) signatures, we focus on the arguably preferable security notion of blind-unforgeability recently proposed by Alagic et al. (Eurocrypt’20). We present two short signature schemes achieving this notion: one is in the quantum random oracle model, assuming quantum hardness of SIS; and the other is in the plain model, assuming quantum hardness of LWE with super-polynomial modulus. Prior to… 



Quantum-access security of the Winternitz one-time signature scheme

This work revisits, and fills a gap in, the quantum-access security analysis of the Lamport one-time signature scheme (OTS) in the quantum random oracle model (QROM) by Alagic et al. and develops a tool for the analysis of hash chains in the QROM based on the superposition oracle technique by Zhandry.

Compact Ring Signatures from Learning With Errors

The first compact ring signature scheme from the (plain) learning with errors (LWE) problem is presented, with a new construction of compact and statistically witness indistinguishable ZAP arguments for NP ∩ coNP, that is shown to be sound based on the plain LWE assumption.

Post-Quantum Multi-Party Computation

The main result is a construction of *constant-round* post-quantum multi-party computation, and a new straight-line non-black-box simulation technique against *parallel* verifiers that does not clone the adversary's state.

Adapting Lyubashevsky's Signature Schemes to the Ring Signature Setting

This paper transforms the scheme of ASIACRYPT 2009 into a ring signature scheme that provides strong properties of security under the random oracle model and provides a variant in which unforgeability is ensured against insider corruption attacks for arbitrary rings.

Indistinguishability Obfuscation of Null Quantum Circuits and Applications

It is shown how quantum null-iO enables a series of new cryptographic primitives that, prior to this work, were unknown to exist even making heuristic assumptions.

Quantum Attacks on Classical Proof Systems: The Hardness of Quantum Rewinding

It is shown that classically secure proofs and proofs of knowledge are insecure in the quantum setting, and the "pick-one trick" is developed, a general technique that allows an adversary to find one value satisfying a given predicate, but not two.

A Framework for Efficient Signatures, Ring Signatures and Identity Based Encryption in the Standard Model

This work shows a transformation taking a signature scheme with a very weak security guarantee and producing a fully secure signature scheme, and shows that ring trapdoor functions imply ring signatures under a weak definition, which enables the transformation to achieve full security.

Secure Identity-Based Encryption in the Quantum Random Oracle Model

This work gives the first proof of security for an identity-based encryption (IBE) scheme in the quantum random oracle model and argues that the aforementioned cryptosystems are secure against quantum adversaries.

On Tight Quantum Security of HMAC and NMAC in the Quantum Random Oracle Model

It is shown that the tight bound of the number of quantum queries to distinguish HMAC or NMAC from a random function is Θ(2) in the quantumrandom oracle model, where compression functions are modeled as quantum random oracles.

Semantic Security and Indistinguishability in the Quantum World

This work shows that stronger notions of indistinguishability are achievable, and provides a secure construction based on quantum-resistant pseudorandom permutations that can be used as a generic transformation for turning a large class of encryption schemes into quantum indistinguishable and hence quantum semantically secure ones.