Proof of plaintext knowledge for the Ajtai-Dwork cryptosystem

Lecture Notes in Computer Science

Volumn 3378, Issue , 2005, Pages 529-555

  Goldwasser, Shafi ^a,b   Kharchenko, Dmitriy ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Ajtai Dwork Cryptosystem; Lattices; Proof of Plaintext Knowledge; Verifiable Encryption; Worst Case Complexity Assumption

Indexed keywords

KNOWLEDGE ACQUISITION; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA; VECTORS;

CRYPTOSYSTEM; PLAINTEXT KNOWLEDGE; VERFIABLE ENCRYPTION; WORST CASE COMPLEXITY ASSUMPTION; ZERO-KNOWLEDGE CONSTRUCTION;

CRYPTOGRAPHY;

EID: 24144466362     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30576-7_29     Document Type: Conference Paper

References (26)

1. M. Ajtai and C. Dwork. A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence. ECCC, TR96-065, Dec. 1996.
2. N. Asokan, V. Shoup, M. Waidner. Optimistic Fair Exchange of Digital Signatures (Extended Abstract). EUROCRYPT 1998: 591-606
3. M. Bellare and M. Yung, Certifying Permutations: Noninteractive Zero-Knowledge Based on Any Trapdoor Permutation J. Cryptology 9(3): 149-166 (1996)
4. J. Camenisch and I. Damgard Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes. ASI-ACRYPT 2000: 331-345
5. J. Camenisch and V. Shoup. Practical Verifiable Encryption and Decryption of Discrete Logarithms. CRYPTO 2003: 126-144
6. R. Cramer, V. Shoup. A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack. (1998)
7. R. Cramer, V. Shoup. Universal Hash Proofs and a paradigm for adaptive chosen ciphertext secure public key encryption. Eurocrypt 2002.
8. D. Dolev, C. Dwork, M. Naor: Nonmalleable Cryptography. SIAM J. Comput. 30(2): 391-437 (2000)
9. W. Diffie, M. E. Hellman. New Directions in Cryptography. IEEE Transactions on Information Theory 1976.
10. T. ElGamal. A Public Key Cryptosystem and a signature scheme based on discrete logarithm. Proceedings of Crypto 84.
11. U. Feige, D. Lapidot, A. Shamir: Multiple Noninteractive Zero Knowledge Proofs Under General Assumptions. SIAM J. Comput. 29(1): 1-28 (1999)
12. U. Feige, A. Fiat, A. Shamir: Zero Knowledge Proofs of Identity. Journal of Cryptologyl(2):77-94 (1988).
13. Zvi Galil, Stuart Haber, Moti Yung. Symmetric Public-Key Encryption. CRYPTO 1985: 128-137
14. O. Goldreich, S. Goldwasser. On the Limits of Nonapproximability of Lattice Problems. JCSS 60(3): 540-563 (2000)
15. O. Goldreich, S. Goldwasser, and S. Halevi. Eliminating decryption errors in the Ajtai-Dwork Cryptosystem. In: Advances of Cryptology, Proc of Crypto'97 Lecture Notes in Computer Science, 1997.
16. O. Goldreich. Foundations of Cryptography: Basic Tools. Cambridge University Press, Cambridge, UK, 2001
17. O. Goldreich, S. Micali, and A. Wigderon. Proofs that Yield Nothing but their Validity or NP in Zero Knowledge. JACM 91.
18. S. Halevi and S. Micali. More on Proofs of Knowledge. LCS Document Number: MIT-LCS-TM-578
19. Chris Hall, Ian Goldberg, Bruce Schneier, Reaction Attacks Against Several Public-Key Cryptosystems. Proceedings of Information and Communication Security, ICICS'99
20. Jonathan Katz. Efficient and Non-Malleable Proofs of Plaintext Knowledge and Applications. Eurocrypt 2003.
21. D. Micciancio and S. Vadhan. Statistical zero-knowledge proofs with efficient provers: lattice problems and more. Advances in Cryptology - Crypto 2003. Santa Barbara, CA, USA, August 2003. LNCS 2729, Springer.
22. M. Naor, M. Yung, Public-key cryptosystems provably secure against chosen ciphertext attacks, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.427-437, May 13-17, 1990, Baltimore, Maryland, United States
23. P. Nguyen and J. Stern. Cryptanalysis of the Ajtai-Dwork cryptosystem. In Advances in Cryptology: Proceedings of Crypto '98, volume 1462 of Lecture Notes in Computer Science, pages 223-242. Springer-Verlag, 1998.
24. O. Regev, New Lattice Based Cryptographic Constructions, STOC 2003.
25. R. L. Rivest, A. Shamir, L. Adleman Public key cryptography, CACM 21, 120-126, 1978.
26. M. Stadler. Publicly Verifiable Secret Sharing. EUROCRYPT 1996: 190-199