IND-CCA Secure Cryptography Based on a Variant of the LPN Problem
Authors:
- 1 January 2012
- book chapter
- Published by Springer Nature
- p. 485-503
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding2012
- Smaller Decoding Exponents: Ball-Collision Decoding2011
- A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model2009
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems2009
- McEliece Cryptosystem Implementation: Theory and Practice2008
- Chosen-Ciphertext Security from Identity-Based Encryption2004
- Practical Verifiable Encryption and Decryption of Discrete Logarithms2003
- Nonmalleable CryptographySIAM Journal on Computing, 2000
- A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511IEEE Transactions on Information Theory, 1998
- A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack1998