A CCA2 secure public key encryption scheme based on the mceliece assumptions in the standard model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5473, Issue , 2009, Pages 240-251

  Dowsley, Rafael ^a   Muller Quade J ^b   Nascimento, Anderson C A ^a  

^a UNIVERSITY OF BRASILIA   (Brazil)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CHOSEN CIPHERTEXT ATTACK; MCELIECE; PUBLIC-KEY ENCRYPTION SCHEME; THE STANDARD MODEL;

NETWORK SECURITY;

PUBLIC KEY CRYPTOGRAPHY;

EID: 67650102558     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00862-7_16     Document Type: Conference Paper

References (21)

1. Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.A.: On the Inherent Intractability of Certain Coding Problems. IEEE Trans. Inf. Theory 24, 384-386 (1978)
2. Bernstein, D.J., Lange, T., Peters, C.: Attacking and defending the McEliece cryptosystem, http://eprint.iacr.org/2008/318
3. Canetti, R., Halevi, S., Katz, J.: Chosen-ciphertext security from identity-based encryption. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 207-222. Springer, Heidelberg (2004)
4. Canteaut, A., Chabaud, F.: A new algorithm for finding minimum-weight words in a linear code: application to primitive narrow-sense BCH codes of length 511. IEEE Trans. Inf. Theory 44(1), 367-378 (1998) (Pubitemid 128737912)
5. Courtois, N.T., Finiasz, M., Sendrier, N.: How to achieve a mcEliece-based digital signature scheme. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 157-174. Springer, Heidelberg (2001)
6. Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 13-25. Springer, Heidelberg (1998) (Pubitemid 128118994)
7. Dolev, D., Dwork, C., Naor, M.: Non-malleable Cryptography. SIAM J. Comput. 30(2), 391-437 (2000)
8. Goldwasser, S., Micali, S.: Probabilistic Encryption. J. Comput. Syst. Sci. 28(2), 270-299 (1984)
9. Goldwasser, S., Vaikuntanathan, V.: Correlation-secure trapdoor functions from lattices (manuscript) (2008)
10. Hofheinz, D., Kiltz, E.: Secure hybrid encryption from weakened key encapsulation. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 553-571. Springer, Heidelberg (2007)
11. Katz, J., Shin, J.S.: Parallel and concurrent security of the HB and HB+ protocols. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 73-87. Springer, Heidelberg (2006)
12. Lindell, Y.: A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 241-254. Springer, Heidelberg (2003)
13. McEliece, R.J.: A Public-Key Cryptosystem Based on Algebraic Coding Theory. In: Deep Space Network progress Report (1978)
14. Naor, M., Yung, M.: Universal One-Way Hash Functions and their Cryptographic Applications. In: 21st STOC, pp. 33-43 (1989)
15. Nojima, R., Imai, H., Kobara, K., Morozov, K.: Semantic Security for the McEliece Cryptosystem without Random Oracles. In: Proceedings of InternationalWorkshop on Coding and Cryptography (WCC), INRIA, pp. 257-268 (2007); journal version in Designs. Codes and Cryptography 49(1-3), 289-305 (December 2008)
16. Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: STOC 2008. pp. 187-196 (2008)
17. Rackoff, C., Simon, D.R.: Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 433-444. Springer, Heidelberg (1992)
18. Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC, pp. 84-93 (2005) (Pubitemid 43098575)
19. Rosen, A., Segev, G.: Chosen-Ciphertext Security via Correlated Products (2008), http://eprint.iacr.org/2008/116
20. Sahai, A.: Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security. In: 40th FOCS, pp. 543-553 (1999) (Pubitemid 30539953)
21. Sendrier, N.: Finding the Permutation Between Equivalent Linear Codes: The Support Splitting Algorithm. IEEE Trans. Inf. Theory 46(4), 1193-1203 (2000) (Pubitemid 30902005)