{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T12:10:17Z","timestamp":1738325417354,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850922"},{"type":"electronic","value":"9783540850939"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85093-9_3","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T10:24:37Z","timestamp":1218536677000},"page":"14-28","source":"Crossref","is-referenced-by-count":5,"title":["Interactive Hashing: An Information Theoretic Tool (Invited Talk)"],"prefix":"10.1007","author":[{"given":"Claude","family":"Cr\u00e9peau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joe","family":"Kilian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Savvides","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","first-page":"168","volume-title":"27th Symp. of Found. of Computer Sci.","author":"G. Brassard","year":"1986","unstructured":"Brassard, G., Cr\u00e9peau, C., Robert, J.: Information theoretic reductions among disclosure problems. In: 27th Symp. of Found. of Computer Sci., pp. 168\u2013173. IEEE, Los Alamitos (1986)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Cachin, C., Cr\u00e9peau, C., Marcil, J.: Oblivious transfer with a memory-bounded receiver. In: Proc. 39th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 493\u2013502 (1998)","DOI":"10.1109\/SFCS.1998.743500"},{"key":"3_CR3","unstructured":"Cachin, C., Cr\u00e9peau, C., Marcil, J., Savvides, G.: Information-theoretic interactive hashing and oblivious transfer to a memory-bounded receiver. Journal of Cryptology (2009) (submitted for publication) (August 2007)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/11761679_13","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"C. Cr\u00e9peau","year":"2006","unstructured":"Cr\u00e9peau, C., Savvides, G.: Optimal reductions between oblivious transfers using interactive hashing. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 201\u2013221. Springer, Heidelberg (2006)"},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00145-006-0438-1","volume":"20","author":"Y.Z. Ding","year":"2007","unstructured":"Ding, Y.Z., Harnik, D., Rosen, A., Shaltiel, R.: Constant-round oblivious transfer in the bounded storage model. Journal of Cryptology\u00a020(2), 165\u2013202 (2007)","journal-title":"Journal of Cryptology"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-44647-8_9","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"Y.Z. Ding","year":"2001","unstructured":"Ding, Y.Z.: Oblivious transfer in the bounded storage model. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 155\u2013170. Springer, Heidelberg (2001)"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Communications of the ACM\u00a028, 637\u2013647 (1985)","journal-title":"Communications of the ACM"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Proc. 19th Annual ACM Symposium on Theory of Computing (STOC), pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"3_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of cryptography","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of cryptography, vol.\u00a0I & II. Cambridge University Press, Cambridge (2001\u20132004)"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/11426639_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"I. Haitner","year":"2005","unstructured":"Haitner, I., Horvitz, O., Katz, J., Koo, C., Morselli, R., Shaltiel, R.: Reducing complexity assumptions for statistically-hiding commitment. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 58\u201377. Springer, Heidelberg (2005)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Haitner, I., Reingold, O.: A new interactive hashing theorem, Computational Complexity. In: Twenty-Second Annual IEEE Conference on CCC 2007, June 2007, pp. 319\u2013332 (2007)","DOI":"10.1109\/CCC.2007.3"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: Proc. 20th Annual ACM Symposium on Theory of Computing (STOC), pp. 20\u201331 (1988)","DOI":"10.1145\/62212.62215"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Nguyen, M.-H., Ong, S.J., Vadhan, S.: Statistical zero-knowledge arguments for np from any one-way function, Foundations of Computer Science. In: 47th Annual IEEE Symposium on FOCS 2006, October 2006, pp. 3\u201314 (2006)","DOI":"10.1109\/FOCS.2006.71"},{"issue":"2","key":"3_CR14","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s001459900037","volume":"11","author":"M. Naor","year":"1998","unstructured":"Naor, M., Ostrovsky, R., Venkatesan, R., Yung, M.: Perfect zero-knowledge arguments for NP using any one-way permutation. Journal of Cryptology\u00a011(2), 87\u2013108 (1998)","journal-title":"Journal of Cryptology"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1145\/1132516.1132559","volume-title":"STOC 2006: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing","author":"M.-H. Nguyen","year":"2006","unstructured":"Nguyen, M.-H., Vadhan, S.: Zero knowledge with efficient provers. In: STOC 2006: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pp. 287\u2013295. ACM, New York (2006)"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","first-page":"439","volume-title":"STACS 92","author":"R. Ostrovsky","year":"1992","unstructured":"Ostrovsky, R., Venkatesan, R., Yung, M.: Secure commitment against a powerful adversary. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol.\u00a0577, pp. 439\u2013448. Springer, Heidelberg (1992)"},{"key":"#cr-split#-3_CR17.1","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Venkatesan, R., Yung, M.: Fair games against an all-powerful adversary. In: Advances in Computational Complexity Theory. AMS, 1993, Initially presented at DIMACS workshop, vol.??13 (1990);","DOI":"10.1007\/978-1-4613-9323-8_31"},{"key":"#cr-split#-3_CR17.2","unstructured":"Extended abstract in the proceedings of Sequences 1991, June 1991, Positano, Italy, pp.??155???169 (1991)"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/3-540-48285-7_23","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"R. Ostrovsky","year":"1994","unstructured":"Ostrovsky, R., Venkatesan, R., Yung, M.: Interactive hashing simplifies zero-knowledge protocol design. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 267\u2013273. Springer, Heidelberg (1994)"},{"key":"3_CR19","unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer, Tech. Report TR-81, Harvard (1981)"},{"key":"3_CR20","unstructured":"Savvides, G.: Interactive hashing and reductions between oblivious transfer variants, Ph.D. thesis, McGill University (2007)"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Wiesner, S.: Conjugate coding, Reprinted in SIGACT News, vol.\u00a015(1), original manuscript written ca.\u00a01970 (1983)","DOI":"10.1145\/1008908.1008920"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets. In: Proc. 27th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85093-9_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T11:51:16Z","timestamp":1738324276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85093-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850922","9783540850939"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85093-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}