Post-quantum Cryptography: Code-Based Signatures

Cayrel, Pierre-Louis; Meziani, Mohammed J.

doi:10.1007/978-3-642-13577-4_8

Cited by 14 publications

(11 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Yet we are unaware of any efficient ZK protocol that simultaneously deals with both code-based signature and encryption schemes in the above sense. Designing provably secure group signature schemes has been a long-standing open question in code-based cryptography, as was also discussed in [37].…”

mentioning

confidence: 99%

Provably Secure Group Signature Schemes From Code-Based Assumptions

Ezerman

Lee

Ling

et al. 2020

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

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.Index Terms-code-based group signature, zero-knowledge protocol, McEliece encryption, syndrome decoding. I. INTRODUCTION A. Background and MotivationGroup signature [1] is a fundamental cryptographic primitive with two intriguing features. The first one is anonymity. It allows users of a group to anonymously sign documents on behalf of the whole group. The second one is traceability. There exists a tracing authority that can tie a given signature to the signer's identity should the need arise. These two properties make group signatures highly useful in various

show abstract

mentioning

confidence: 99%

Provably Secure Group Signature Schemes From Code-Based Assumptions

Ezerman

Lee

Ling

et al. 2020

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

show abstract

“…In the CFS scheme, signatures are generated using various operations like hashing, syndrome generation, multiplication in field, error pattern analysis, and counter value measurements. In this scheme, attacks are also observed [2]. For example, generalized birthday attack.…”

Section: Code-based Signature Schemesmentioning

confidence: 94%

“…Because no polynomial-time methods exist for these three implausible issues, the security of these cryptosystems is highly reliant on them. However, if a real quantum computer is available, non-exponential time quantum algorithms for ECDLP, IFP [2], and DLP exist. Mostly all existing quantum computing-based attacks on public-key cryptosystems are covered in Quantum Attacks on Public-Key Cryptosystems, with a focus on quantum algorithms for ECDLP, IFP, and DLP.…”

Section: A Quantum Attacks On Ifp-based Cryptosystemsmentioning

confidence: 99%

See 1 more Smart Citation

Survey of Promising Technologies for Quantum Drones and Networks

Kumar¹,

Bhatia

Kaushik

et al. 2021

IEEE Access

View full text Add to dashboard Cite

Due to recent advancements in quantum drones, the Internet of Quantum Drones (IoQDs), and Drone-to-Satellite connectivity, several advantages have been anticipated for real-time applications. This work examines quantum computing issues, including quantum data processing, techniques, circuits, and algorithms important for quantum drones or their networks. Here, we discussed the current research trends on quantum computing, quantum-safe computing, or post-quantum cryptography important to quantum networks, followed by the numerous advantages, limitations, future advancements, and research issues connected with quantum technologies, drones, and their network. This work has also prepared a taxonomy of quantum-related areas depending upon the logic of their learning, followed by a review of each of these areas. We review the most recent work over quantum algorithms used in various-quantum-related areas and networks, the role of quantum satellites for drone-based networks and communications, how quantum artificial intelligence and quantum machine learning are important for quantum drones, networks and futuristic applications, quantum attacks, quantum genetic algorithms, and the importance of post-quantum and quantum-safe cryptography. The challenges and research directions in these domains are explored as well. Lastly, this work presents an overview of the current state of knowledge in various promising technologies that are recently found to be important for quantum drones and networks.

show abstract

“…Mainstream post-quantum cryptosystems can be categorized into several broad families: lattice-based systems [17,25] and learning with errors [26], code-based systems [2,7,24], hash-based signatures [6,11], and systems based on multivariate polynomials [3,34]. Isogeny-based cryptosystems represent an interesting alternative to the above because they are based on a (relatively) naturally occurring number-theoretic computational problem, namely, the problem of computing isogenies between elliptic curves.…”

Section: Related Workmentioning

confidence: 99%

Isogeny-Based Quantum-Resistant Undeniable Signatures

Jao

Soukharev

2014

Post-Quantum Cryptography

View full text Add to dashboard Cite

Abstract. We propose an undeniable signature scheme based on elliptic curve isogenies, and prove its security under certain reasonable number-theoretic computational assumptions for which no efficient quantum algorithms are known. Our proposal represents only the second known quantum-resistant undeniable signature scheme, and the first such scheme secure under a number-theoretic complexity assumption.

show abstract

Post-quantum Cryptography: Code-Based Signatures

Abstract: This survey provides a comparative overview of code-based signature schemes with respect to security and performance. Furthermore, we explicitly describe serveral code-based signature schemes with additional properties such as identity-based, threshold ring and blind signatures.

Cited by 14 publications

References 39 publications

Provably Secure Group Signature Schemes From Code-Based Assumptions

Provably Secure Group Signature Schemes From Code-Based Assumptions

Survey of Promising Technologies for Quantum Drones and Networks

Isogeny-Based Quantum-Resistant Undeniable Signatures

Contact Info

Product

Resources

About