Filters








64 Hits in 3.4 sec

An Efficient CCA2-Secure Variant of the McEliece Cryptosystem in the Standard Model [article]

Roohallah Rastaghi
2013 arXiv   pre-print
Recently, a few chosen-ciphertext secure (CCA2-secure) variants of the McEliece public-key encryption (PKE) scheme in the standard model were introduced.  ...  Thus, the proposed schemes are not sufficiently efficient to be used in practice. In this work, we propose an efficient CCA2-secure variant of the McEliece PKE scheme in the standard model.  ...  We also thanks to anyone who read the article and give an alternative proof for the theorem (1).  ... 
arXiv:1302.0347v4 fatcat:xob7a65jmbauplgws5mzjxaede

New Approach for CCA2-Secure Post-Quantum Cryptosystem Using Knapsack Problem [article]

Roohallah Rastaghi
2014 arXiv   pre-print
In this manuscript, for the first time, we propose a new approach for constructing post-quantum cryptosystems secure against adaptive chosen ciphertext attack (CCA2-secure) in the standard model using  ...  Chosen-ciphertext security, which guarantees confidentiality of encrypted messages even in the presence of a decryption oracle, has become the defacto notion of security for public-key encryption under  ...  The first CCA2-secure variant of McEliece scheme in the random oracle model is the conversions of Kobara and Imai [26] .  ... 
arXiv:1211.6984v5 fatcat:f6nucc7pfrblbetoso7h6awf2e

A CCA2 Secure Variant of the McEliece Cryptosystem [article]

Nico Döttling, Rafael Dowsley, Jörn Müller-Quade, Anderson C. A. Nascimento
2012 arXiv   pre-print
In this work, we show the first construction of a McEliece based public-key cryptosystem secure against chosen ciphertext attacks in the standard model.  ...  In spite of all the recent results in coding theory based cryptosystems, to the date, there are no constructions secure against chosen ciphertext attacks in the standard model - the de facto security notion  ...  Obtaining a CCA2 secure cryptosystem (even an inefficient one) based on the McEliece assumptions in the standard model has been an open problem in this area for quite a while.  ... 
arXiv:1205.5224v3 fatcat:asb4xmwomfbcnnbmgeg44mly5e

A CCA2 Secure Variant of the McEliece Cryptosystem

Nico Dottling, Rafael Dowsley, Jörn Muller-Quade, Anderson C. A. Nascimento
2012 IEEE Transactions on Information Theory  
In this work, we show the first construction of a McEliece based public-key cryptosystem secure against chosen ciphertext attacks in the standard model.  ...  In spite of all the recent results in coding theory based cryptosystems, to the date, there are no constructions secure against chosen ciphertext attacks in the standard model -the de facto security notion  ...  CPA secure variants were presented in [22] for the random oracle model and in [31] , [32] for the standard model.  ... 
doi:10.1109/tit.2012.2203582 fatcat:mdkjhoo4abho3fakfxxub6uzxy

A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model [chapter]

Rafael Dowsley, Jörn Müller-Quade, Anderson C. A. Nascimento
2009 Lecture Notes in Computer Science  
In this work, we show the first construction of a McEliece based public-key cryptosystem secure against chosen ciphertext attacks in the standard model.  ...  In spite of all the recent results in coding theory based cryptosystems, to the date, there are no constructions secure against chosen ciphertext attacks in the standard model -the de facto security notion  ...  Obtaining a CCA2 secure cryptosystem (even an inefficient one) based on the McEliece assumptions in the standard model has been an open problem in this area for quite a while.  ... 
doi:10.1007/978-3-642-00862-7_16 fatcat:qgeupsrjorexrhxvlorq5wkxpm

Efficient Implementation of a CCA2-Secure Variant of McEliece Using Generalized Srivastava Codes [chapter]

Pierre-Louis Cayrel, Gerhard Hoffmann, Edoardo Persichetti
2012 Lecture Notes in Computer Science  
In contrast with all other CCA2-secure code-based cryptosystems that work in the random oracle model, our conversion does not require a constant weight encoding function.  ...  In this paper we present efficient implementations of McEliece variants using quasi-dyadic codes.  ...  Acknowledgments We would like to thank Steven Galbraith for many fruitful discussions and his constant support throughout the development of the paper.  ... 
doi:10.1007/978-3-642-30057-8_9 fatcat:7cqur257q5d4hgm7klzw634wyi

Overview of the Mceliece Cryptosystem and its Security

Marek Repka, Pavol Zajac
2014 Tatra Mountains Mathematical Publications  
In this paper we survey the current state of the implementation issues and security of MECS, and its variants.  ...  McEliece cryptosystem (MECS) is one of the oldest public key cryptosystems, and the oldest PKC that is conjectured to be post-quantum secure.  ...  There are also theoretical proposals for CCA2-secure code-based cryptosystem in a standard model [18] , [47] .  ... 
doi:10.2478/tmmp-2014-0025 fatcat:jfxogohji5g7nduip5dhrgn62m

Key Reduction of McEliece's Cryptosystem Using List Decoding [article]

Morgan Barbier, Barreto S. L. M. Paulo
2011 arXiv   pre-print
In light of a new study on list decoding algorithms for binary Goppa codes, we explain how to increase the security level for given public keysizes.  ...  Using the state-of-the-art list decoding algorithm instead of unique decoding, we exhibit a keysize gain of about 4% for the standard McEliece cryptosystem and up to 21% for the adjusted dyadic variant  ...  to Nicolas Sendrier who kindly let us build on his software.  ... 
arXiv:1102.2566v2 fatcat:fytfc5y4ffgrdabqq3ua7e7i64

Key reduction of McEliece's cryptosystem using list decoding

Morgan Barbier, Paulo S. L. M. Barreto
2011 2011 IEEE International Symposium on Information Theory Proceedings  
In light of a new study on list decoding algorithms for binary Goppa codes, we explain how to increase the security level for given public keysizes.  ...  Using the state-of-the-art list decoding algorithm instead of unique decoding, we exhibit a keysize gain of about 4% for the standard McEliece cryptosystem and up to 21% for the adjusted dyadic variant  ...  to Nicolas Sendrier who kindly let us build on his software.  ... 
doi:10.1109/isit.2011.6034058 dblp:conf/isit/BarbierB11 fatcat:hruobvzk6reixguubzah2thmry

A code-based hybrid signcryption scheme [article]

Jean Belo Klamti, M. Anwar Hasan
2021 arXiv   pre-print
We give security analyses of both our schemes in the standard model and prove that they are secure against IND-CCA2 (indistinguishability under adaptive chosen ciphertext attack) and SUF-CMA (strong existential  ...  The proposed scheme uses an equivalent subcode as a public code for the receiver, making the NP-completeness of the equivalent subcode problem be one of our main security assumptions.  ...  However, it is important to note that in the standard model a signcryption tag-KEM is secure if it is both IND-CCA2 and SUF-CMA secure.  ... 
arXiv:2112.07130v1 fatcat:mxx3zwiax5hgticy4llun2pepa

PKC-PC: A Variant of the McEliece Public Key Cryptosystem based on Polar Codes [article]

Reza Hooshmand, Masoumeh Koochak Shooshtari, Mohammad Reza Aref
2017 arXiv   pre-print
This paper studies a variant of the McEliece public key cryptosystem based on polar codes, called "PKC-PC".  ...  Moreover, it is indicated that the security of the PKC-PC is reduced to solve NP-complete problems.  ...  CONCLUSION This paper introduced a variant of the McEliece public key cryptosystem based on polar codes, called as PKC-PC.  ... 
arXiv:1712.07672v1 fatcat:tbwh5oagvze3bixmk4rdl2qdey

QC-MDPC: A Timing Attack and a CCA2 KEM [chapter]

Edward Eaton, Matthieu Lequesne, Alex Parent, Nicolas Sendrier
2018 Lecture Notes in Computer Science  
In 2013, Misoczki, Tillich, Sendrier and Barreto proposed a variant of the McEliece cryptosystem based on quasi-cyclic moderatedensity parity-check (QC-MDPC) codes.  ...  We formally prove the IND-CCA2 security of ParQ, in a model that considers decoding failures. This KEM offers smaller key sizes and is suitable for purposes where the public key is used statically.  ...  We provided a proof of the CCA2 security of the KEM in the random oracle model.  ... 
doi:10.1007/978-3-319-79063-3_3 fatcat:q4u3pjeydnemraa562j2522bqm

A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors [chapter]

Qian Guo, Thomas Johansson, Paul Stankovski
2016 Lecture Notes in Computer Science  
Algorithms for secure encryption in a post-quantum world are currently receiving a lot of attention in the research community, including several larger projects and a standardization effort from NIST.  ...  It successfully recovers the secret key in minutes. A slightly modified version of the attack can be applied on proposed versions of the QC-MDPC scheme that provides IND-CCA security.  ...  In terms of a security model definition, the attack is called a reaction attack. In previous work, resend and reaction attacks on McEliece PKC have appeared [14] .  ... 
doi:10.1007/978-3-662-53887-6_29 fatcat:gzqqfbjwyfgpngl7x7ky7inwzi

polarRLCE: A New Code-Based Cryptosystem Using Polar Codes

Jingang Liu, Yongge Wang, Zongxiang Yi, Zhiqiang Lin
2019 Security and Communication Networks  
In this work, we propose the first efficient secure scheme based on polar codes (i.e., polarRLCE) which is inspired by the RLCE scheme, a candidate for the NIST postquantum cryptography standardization  ...  In addition, we also present a KEM version of the polarRLCE scheme that can attain a negligible decryption failure rate within the corresponding security parameters.  ...  Vlad Dragoi for insightful discussions. is work was supported in part by the National Natural Science Foundation of China (Grant no. 61702124), Qatar Foundation (Grant no.  ... 
doi:10.1155/2019/3086975 fatcat:gozlugvfjvfqpajxj4kdggqqgy

Post-quantum cryptography

Daniel J. Bernstein, Tanja Lange
2017 Nature  
The sender can introduce correspondingly more errors. Unique decoding is ensured by CCA2-secure variants.  ...  Post-quantum cryptography deals with the design of such systems; cryptanalysis of such systems; the analysis of suitable parameters depending on different threat models; design of protocols using the secure  ... 
doi:10.1038/nature23461 pmid:28905891 fatcat:5yvzd7yifjgubasjtzfzdvpsoy
« Previous Showing results 1 — 15 out of 64 results