A provably secure group signature scheme from code-based assumptions

DOI10.1007/978-3-662-48797-6_12MaRDI QIDQ2811134zbMATHOpenAlexFDO

Authors Martianus Frederic Ezerman, Hyung Tae Lee, San Ling, Hoa Nguyen, Huaxiong Wang

Publication date 10 June 2016

Published in Advances in Cryptology -- ASIACRYPT 2015 (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1909.04472

Mathematics Subject Classification ID

Cryptography (94A60)

Abstract: We solve an open question in code-based cryptography by introducing two provably secure group signature schemes from code-based assumptions. Our basic scheme satisfies the CPA-anonymity and traceability requirements in the random oracle model, assuming the hardness of the McEliece problem, the Learning Parity with Noise problem, and a variant of the Syndrome Decoding problem. The construction produces smaller key and signature sizes than the previous group signature schemes from lattices, as long as the cardinality of the underlying group does not exceed $2^{24}$, which is roughly comparable to the current population of the Netherlands. We develop the basic scheme further to achieve the strongest anonymity notion, i.e., CCA-anonymity, with a small overhead in terms of efficiency. The feasibility of two proposed schemes is supported by implementation results. Our two schemes are the first in their respective classes of provably secure groups signature schemes. Additionally, the techniques introduced in this work might be of independent interest. These are a new verifiable encryption protocol for the randomized McEliece encryption and a novel approach to design formal security reductions from the Syndrome Decoding problem.

Recommendations

• A code-based group signature scheme
• A New Dynamic Code-Based Group Signature Scheme
• A practical group signature scheme based on rank metric
• A rank metric code-based group signature scheme
• A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory

Cited in

(24)

• A practical group signature scheme based on rank metric
• New code-based privacy-preserving cryptographic constructions
• A rank metric code-based group signature scheme
• A scalable post-quantum hash-based group signature
• A lattice-based group signature scheme with message-dependent opening
• Group encryption: full dynamicity, message filtering and code-based instantiation
• Group encryption: full dynamicity, message filtering and code-based instantiation
• A code-based signature scheme from the Lyubashevsky framework
• Code-Based Zero Knowledge PRF Arguments
• Efficient code-based fully dynamic group signature scheme
• Post-quantum secure fully-dynamic logarithmic-size deniable group signature in code-based setting
• Group signatures and more from isogenies and lattices: generic, simple, and efficient
• Group signatures and more from isogenies and lattices: generic, simple, and efficient
• Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
• Short code-based one-out-of-many proofs and applications
• Code-based signatures from new proofs of knowledge for the syndrome decoding problem
• Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
• Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
• New code-based cryptographic accumulator and fully dynamic group signature
• Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
• A code-based group signature scheme
• A New Dynamic Code-Based Group Signature Scheme
• Fully dynamic attribute-based signatures for circuits from codes
• Provably Secure Group Signature Schemes From Code-Based Assumptions

This page was built for publication: A provably secure group signature scheme from code-based assumptions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811134)