Deniable encryption

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

Volumn 1294, Issue , 1997, Pages 90-104

  Canetti, Ran ^a   Dwork, Cynthia ^b   Naor, Moni ^c   Ostrovsky, Rafall ^d  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c The Weizmann Institute   (United States)

^d TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

CIPHERTEXTS; DENIABLE ENCRYPTIONS; ENCRYPTED MESSAGES; ENCRYPTION SCHEMES; RANDOM CHOICE; SECRET KEY; SECURE MULTI-PARTY COMPUTATION;

CRYPTOGRAPHY;

EID: 84958626761     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0052229     Document Type: Conference Paper

References (19)

1. M. Ajtai, Generating Hard Instances of Lattice Problems, STOC'96
2. M. Ajtai, C. Dwork, A Public-Key Cryptosystem with Average-Case/Worst- Case Equivalence, ST00"97; see also Electronic Colloquium on Computational Complexity TR96-Ofi5, http://www.eccc.unitrier.de/eccc-local/Lists/TR-1996.html
3. D. Beaver and S. Haber, Cryptographic Protocols Provably Secure Against Dynamic Adversaries, Eurocrpt, 1992.
4. J. Benaloh and D. Tunistra, Receipt-Free Secret-BaUot Elections, 26th STOC, 1994, pp. 544-552.
5. R. Canetti and R. Gennaro, Incoercible multiparty computation, FOCS'gfi
6. R. Canetti, C. Dwork, M. Naor and R. Ostrovsky, Deniable Encryption, Theory of Cryptology L=brary, http://theory.los.mit.edu/tcrypol 1996.
7. R. Canetti, U. Feige, O. Goldreich and M. Naor, Adaptively secure computation, 28th STOC, 1996.
8. D. Dolev, C. Dwork and M. Naor, Non-malleable cryptography, STOC'91
9. P. Feldman, Private Communication, 1986.
10. A. Herzberg, Rump-Session presentation at CRYPTO 1991.
11. R. Gennaro, unpublished manuscript.
12. O. Goldreich and L. Levin, A Hard-Core Predicate to any One-Way Function, Ist STOC, 1989, pp. 25-32.
13. O. Goldreich, S. Micali and A. Wigderson, Proofs that Yield Nothing but the Validity of the Assertion, and a Methodology of Cryptographic Protocol Design, 27th FOCS, 174-187, 1986.
14. O. Goldreich, S. Micah and A. Wigderson, How to Play any Mental Game, 19th STO0, pp. 218-229, 1987.
15. S. Goldwasser and S. Micali, Probabilistic encryption, JOSS, Vol. 28, No 2, April 1984, pp. 270-299.
16. P. Gutman, Secure Deletion of Data from Magnetic and Solid-State Memory, Sixth USENIX Security Symposium Proceedings, San Jose, California, July 22-25, 1996, pp. 77-89.
17. M. Naor and M. Yung "Public key cryptosystems provably secure against chosen ciphertext attacks", Proc. 22nd ACM Annual Symposium on the Theory of Computing, 1990, pp. 427-437.
18. C. Rackoff and D. Simon, Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack, CRYPTO'91, (LNCS 57fi), 1991.
19. K. Sako and J. Kilian, Receipt-Free Mix-Type Voting Scheme, Eurocrypt 1995, pp. 393-403.