Combining Encryption and Proof of Knowledge in the Random Oracle Model

Computer Journal

Volumn 47, Issue 1, 2004, Pages 58-70

  Abe, Masayuki ^a  

^a NTT CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE SYSTEMS; CRYPTOGRAPHY; KNOWLEDGE ENGINEERING; OPTIMAL SYSTEMS; PROBABILITY; SECURITY OF DATA;

ENCRYPTION SCHEMES; GENERIC CONSTRUCTION;

COMPUTER SCIENCE;

EID: 0346685895     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/47.1.58     Document Type: Article

References (30)

1. Bellare, M. and Rogaway, P. (1995) Optimal asymmetric encryption. In Alfrede De Santis (ed.), Advances in Cryptology - EUROCRYPT'94, volume 950 of Lecture Notes in Computer Science, pp. 92-111. Springer-Verlag, Berlin.
2. Fujisaki, E. and Okamoto, T. (1999) Secure integration of asymmetric and symmetric encryption schemes. In Wiener M. (ed.), Advances in Cryptology - CRYPTO'99, volume 1666 of Lecture Notes in Computer Science, pp. 537-554. Springer-Verlag.
3. Okamoto, T. and Pointcheval, D. (2001) REACT: rapid enhanced-security asymmetric cryptosystem transform. In RSA 2001, Lecture Notes in Computer Science. Springer-Verlag, Berlin.
4. Bellare, M. and Rogaway, P. (1993) Random oracles are practical: a paradigm for designing efficient protocols. In First ACM Conf. on Computer and Communication Security, pp. 62-73. Association for Computing Machinery.
5. Cramer, R. and Shoup, V. (1998) A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In Krawczyk, H. (ed.), Advances in Cryptology - CRYPTO'98, volume 1462 of Lecture Notes in Computer Science, pp. 13-25. Springer-Verlag, Berlin.
6. Cramer, R. and Shoup, V. (2002) Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In Knudsen, L. (ed.), Advances in Cryptology-EUROCRYPTO'02, volume 2332 of Lecture Notes in Computer Science, pp. 45-64. Springer-Verlag, Berlin.
7. Naor, M. and Yung, M. (1990) Public-key cryptosystems provably secure against chosen ciphertext attacks. In Proc. 22nd Annual ACM Symp. on the Theory of Computing, pp. 427-437.
8. Rackoff, C. and Simon, D. (1992) Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In Advances in Ctyptology-CRYPTO'91, volume 576 of Lecture Notes in Computer Science, pp. 433-444. SpringerVerlag, Berlin.
9. Sahai, A. (1999) Non-malleable non-interactive zero-knowledge and chosen-ciphertext security. In Proc. 40th IEEE Annual Symp. on Foundations of Computer Science, pp. 543-553.
10. Tsiounis, Y. and Yung, M. (1998) On the security of El Gamal based encryption. In Imai, H. and Zheng, Y. (ed.), First Inter. Workshop on Practice and Theory in Public Key Cryptography - PKC'98, volume 1431 of Lecture Notes in Computer Science, pp. 117-134. Springer-Verlag, Berlin.
11. Shoup, V. and Gennaro, R. (1998) Securing threshold cryptosystems against chosen ciphertext attack. In Nyberg, K. (ed.), Advances in Cryptology - EUROCRYPT'98, volume 1403 of Lecture Notes in Computer Science, pp. 1-16. Springer-Verlag, Berlin.
12. Schnorr, C. P. and Jakobsson, M. (2000) Security of signed elgamal encryption. In Okamoto, T. (ed.), Advances in Cryptology-ASIACRYPT 2000, volume 1976 of Lecture Notes in Computer Science, pp. 73-89. Springer-Verlag, Berlin.
13. Fouque, P. and Pointcheval, D. (2001) Threshold cryptosystems secure against chosen-ciphertext attacks. In Boyd, C. (ed.), Advances in Cryptology - Asiacrypt 2001, volume 2248 of Lecture Notes in Computer Science, pp. 351-368. Springer-Verlag, Berlin.
14. ElGamal, T. (1985) A public key cryptosystem and a signature scheme based on discrete logarithms. In Blakley, G. R. and Chaum, D. (eds), Advances in Cryptology - CRYPTO'84, volume 196 of Lecture Notes in Computer Science, pp. 10-18. Springer-Verlag, Berlin.
15. Schnorr, C. P. (1991) Efficient signature generation for smart cards. J. Cryptol., 4(3), 239-252.
16. Shoup, V. (1997) Lower bounds for discrete logarithms and related problems. In Fumy, W. (ed.), Advances in Cryptology - EUROCRYPT'97, volume 1233 of Lecture Notes in Computer Science, pp. 256-266. Springer-Verlag, Berlin.
17. Abe, M. (2002) Security of encryption + proof of knowledge in the random oracle model. In Preneel, B. (ed.), RSA Conf. 2002, volume 2271 of Lecture Notes in Computer Science, pp. 277-289. Springer-Verlag, Berlin.
18. Canetti, R., Goldreich, O. and Halevi, S. (1998) The random oracle methodology, revisited. In Proc. 30th Annual ACM Symp. on Theory of Computing, pp. 209-218.
19. Nielsen, J. B. (2002) Separating random oracle proofs from complexity theoretic proofs: the non-committing encryption case. In Yung, M. (ed.), Advances in Cryptology - CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pp. 111-126. Springer-Verlag, Berlin.
20. Goldwasser, S. and Micali, S. (1984) Probabilistic encryption. J. Comp. Sys. Sci., 28, 270-299.
21. Bellare, M., Desai, A., Pointcheval, D. and Rogaway, P. (1998) Relations among notions of security for public-key encryption schemes. In Krawczyk, H. (ed.), Advances in Cryptology-CRYPTO'98, volume 1462 of Lecture Notes in Computer Science, pp. 26-45. Springer-Verlag, Berlin.
22. Okamoto, T. and Pointcheval, D. (2001) The gap-problems: a new class of problems for the security of cryptographic schemes. In Kim, K. (ed.), PKC 2001, volume 1992 of Lecture Notes in Computer Science, pp. 104-118. Springer-Verlag, Berlin.
23. Bellare, M., Desai, A., Jokipii, E. and Rogaway, P. (1997) A concrete security treatment of symmetric encryption. In Proc. 38th IEEE Annual Symp. on Foundations of Computer Science, pp. 394-403. IEEE Computer Society.
24. Katz, J. and Yung, M. (2000) Complete characterization of security notions for probabilistic private-key encryption. In Proc. of the 22nd Annual ACM Symp. on the Theory of Computing, pp. 245-254.
25. Goldwasser, S., Micali, S. and Rivest, R. (1988) A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput, 17(2), 281-308.
26. Pointcheval, D. and Stem, J. (2000) Security arguments for digital signatures and blind signatures. J. Cryptol., 13(3), 339-360.
27. Paillier, P. (1999) Public-key cryptosystems based on composite degree residuosity classes. In Stern, J. (ed.), Advances in Cryptology - EUROCRYPT'99, volume 1592 of Lecture Notes in Computer Science, pp. 223-238. Springer-Verlag, Berlin.
28. Okamoto, T. and Uchiyama, S. (1998) A new public-key cryptosystem as secure as factoring. In Nyberg, K. (ed.), Advances in Cryptology-EUROCRYPT'98, volume 1403 of Lecture Notes in Computer Science, pp. 308-318. Springer-Verlag, Berlin.
29. Fujisaki, E. (2001) A simple approach to secretly sharing a factoring witness in publicly-verifiable manner (unpublished manuscript).
30. Hoshino, F., Abe, M. and Kobayashi, T. (2001) Lenient/strict batch verification in several groups. In Davida, G. I. and Frankel, Y. (eds), Information Security, volume 2200 of Lecture Notes in Computer Science, pp. 81-94. Springer-Verlag, Berlin.