{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T22:28:30Z","timestamp":1784068110860,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540633846","type":"print"},{"value":"9783540695288","type":"electronic"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0052229","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T14:37:31Z","timestamp":1155825451000},"page":"90-104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":201,"title":["Deniable Encryption"],"prefix":"10.1007","author":[{"given":"Rein","family":"Canetti","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cynthia","family":"Dwork","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moni","family":"Naor","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,5,17]]},"reference":[{"key":"6_CR1","unstructured":"M. Ajtai, Generating Hard Instances of Lattice Problems, STOC'96"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"M. Ajtai, C. Dwork, A Public-Key Cryptosystem with Average-Case\/Worst-Case Equivalence, STOC'97; see also Electronic Colloquium on Computational Complexity TR96-065, http:\/\/www.eccc.unitrier.de\/eccc-local\/Lists\/TR-1996.html","DOI":"10.1145\/258533.258604"},{"key":"6_CR3","unstructured":"D. Beaver and S. Haber, Cryptographic Protocols Provably Secure Against Dynamic Adversaries, Eurocrypt, 1992."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"J. Benaloh and D. Tunistra, Receipt-Free Secret-Ballot Elections, 26th STOC, 1994, pp. 544\u2013552.","DOI":"10.1145\/195058.195407"},{"key":"6_CR5","unstructured":"R. Canetti and R. Gennaro, Incoercible multiparty computation, FOCS'96"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"R. Canetti, C. Dwork, M. Naor and R. Ostrovsky, Deniable Encryption, Theory of Cryptology Library, http:\/\/thoory.lcs.mit.edu\/ tcryptol, 1996.","DOI":"10.1007\/BFb0052229"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"R. Canetti, U. Feige, O. Goldreich and M. Naor, Adaptively secure computation, 28th STOC, 1996.","DOI":"10.1145\/237814.238015"},{"key":"6_CR8","unstructured":"D. Dolev, C. Dwork and M. Naor, Non-malleable cryptography, STOC'91"},{"key":"6_CR9","unstructured":"P. Feldman, Private Communication, 1986."},{"key":"6_CR10","unstructured":"A. Herzberg, Rump-Session presentation at CRYPTO 1991."},{"key":"6_CR11","unstructured":"R. Gennaro, unpublished manuscript."},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"O. Goldreich and L. Levin, A Hard-Core Predicate to any One-Way Function, 21st STOC, 1989, pp. 25\u201332.","DOI":"10.1145\/73007.73010"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"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\u2013187, 1986.","DOI":"10.1109\/SFCS.1986.47"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali and A. Wigderson, How to Play any Mental Game, 19th STOC, pp. 218\u2013229, 1987.","DOI":"10.1145\/28395.28420"},{"issue":"2","key":"6_CR15","first-page":"270","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser and S. Micali, Probabilistic encryption, JCSS, Vol. 28, No 2, April 1984, pp. 270\u2013299.","journal-title":"JCSS"},{"key":"6_CR16","unstructured":"P. Gutman, Secure Deletion of Data from Magnetic and Solid-State Memory, Sixth USENIX Security Symposium Proceedings, San Jose, California, July 22\u201325, 1996, pp. 77\u201389."},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"M. Naor and M. Yung \u201c Public key cryptosystems provably secure against chosen ciphertext attacks\u201d, Proc. 22nd ACM Annual Symposium on the Theory of Computing, 1990, pp. 427\u2013437.","DOI":"10.1145\/100216.100273"},{"key":"6_CR18","unstructured":"C. Rackoff and D. Simon, Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack, CRYPT0'91, (LNCS 576), 1991."},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"K. Sako and J. Kilian, Receipt-Free Mix-Type Voting Scheme, Eurocrypt 1995, pp. 393\u2013403.","DOI":"10.1007\/3-540-49264-X_32"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO '97"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052229","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T22:26:28Z","timestamp":1580336788000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0052229"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633846","9783540695288"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0052229","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"17 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}