Book ChapterDOI
An efficient IND-CCA2 secure variant of the niederreiter encryption scheme in the standard model
K. Preetha Mathew,Sachin Vasant,Sridhar Venkatesan,C. Pandu Rangan +3 more
- pp 166-179
Reads0
Chats0
TLDR
This scheme is built on the Niederreiter encryption scheme and can be considered as the first practical code-based encryption scheme that is IND-CCA2 secure in the standard model.Abstract:
In this paper, we propose an IND-CCA2 secure code based encryption scheme in the standard model, built on the Niederreiter encryption scheme. The security of the scheme is based on the hardness of the Syndrome Decoding problem and the Goppa Code Distinguishability problem. The system is developed according to the construction similar to IND-CCA2 secure encryption scheme by Peikert and Waters using the lossy trapdoor functions. Compared to the existing IND-CCA2 secure variants due to Dowsley et.al. and Freeman et. al. (using the κ repetition paradigm initiated by Rosen and Segev), our scheme is more efficient as it avoids κ repetitions. This can be considered as the first practical code-based encryption scheme that is IND-CCA2 secure in the standard model.read more
Citations
More filters
Posted Content
An Efficient CCA2-Secure Variant of the McEliece Cryptosystem in the Standard Model
TL;DR: In this paper, the authors proposed an efficient chosen-ciphertext secure (CCA2-secure) variant of the McEliece public-key encryption (PKE) scheme in the standard model.
Posted Content
An Efficient CCA2-Secure Variant of the McEliece Cryptosystem in the Standard Model
TL;DR: In this article, the authors proposed an efficient CCA2-secure variant of the McEliece PKE scheme in the standard model, which can be applied to any one-way trapdoor function (OW-TDF).
Book ChapterDOI
Code-Based Public-Key Encryption
TL;DR: A short survey of public-key encryption schemes based on hardness of general decoding, including the McEliece PKE, which is believed to be resistant even against attacks using quantum computers, which makes them candidates for the so-called post-quantum cryptography.
Book ChapterDOI
Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
TL;DR: The proposed constructions are the first of its kind under coding-based assumption in the standard model that do not use the \(\kappa \)-repetition paradigm initiated by Rosen and Segev at Theory of Cryptography Conference (TCC), 2009.
Posted Content
Provably Secure Group Signature Schemes from Code-Based Assumptions.
TL;DR: A new verifiable encryption protocol for the randomized McEliece encryption and a novel approach to design formal security reductions from the Syndrome Decoding problem are introduced.
References
More filters
Journal ArticleDOI
New Directions in Cryptography
TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
Journal ArticleDOI
A method for obtaining digital signatures and public-key cryptosystems
TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
Journal ArticleDOI
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
TL;DR: In this paper, the authors considered factoring integers and finding discrete logarithms on a quantum computer and gave an efficient randomized algorithm for these two problems, which takes a number of steps polynomial in the input size of the integer to be factored.
Journal ArticleDOI
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
TL;DR: In this paper, the authors considered factoring integers and finding discrete logarithms, two problems that are generally thought to be hard on classical computers and that have been used as the basis of several proposed cryptosystems.