{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T10:39:38Z","timestamp":1648723178652},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,1,4]],"date-time":"2013-01-04T00:00:00Z","timestamp":1357257600000},"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":["J Cryptol"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s00145-012-9139-0","type":"journal-article","created":{"date-parts":[[2013,1,3]],"date-time":"2013-01-03T08:56:00Z","timestamp":1357203360000},"page":"109-138","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A New Interactive Hashing Theorem"],"prefix":"10.1007","volume":"27","author":[{"given":"Iftach","family":"Haitner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omer","family":"Reingold","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,1,4]]},"reference":[{"issue":"2","key":"9139_CR1","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"G. Brassard, D. Chaum, C. Cr\u00e9peau, Minimum disclosure proofs of knowledge. J. Comput. Syst. Sci.\n                  37(2), 156\u2013189 (1988)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"9139_CR2","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"L.J. Carter","year":"1979","unstructured":"L.J. Carter, M.N. Wegman, Universal classes of Hash functions. J. Comput. Syst. Sci.\n                  18(2), 143\u2013154 (1979)","journal-title":"J. Comput. Syst. Sci."},{"key":"9139_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography: Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"O. Goldreich, Foundations of Cryptography: Basic Tools (Cambridge University Press, Cambridge, 2001)"},{"key":"9139_CR4","first-page":"447","volume":"27","author":"O. Goldreich","year":"1998","unstructured":"O. Goldreich, S. Goldwasser, N. Linial, Fault-tolerant computation in the full information model. SIAM J. Comput.\n                  27, 447\u2013457 (1998)","journal-title":"SIAM J. Comput."},{"key":"9139_CR5","first-page":"1","volume-title":"Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC)","author":"I. Haitner","year":"2007","unstructured":"I. Haitner, O. Reingold, Statistically hiding commitment from any one-way function, in Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC) (2007), pp.\u00a01\u201310"},{"key":"9139_CR6","first-page":"319","volume-title":"Proceedings of the 18th Annual IEEE Conference on Computational Complexity","author":"I. Haitner","year":"2007","unstructured":"I. Haitner, O. Reingold, A\u00a0new interactive hashing theorem, in Proceedings of the 18th Annual IEEE Conference on Computational Complexity (2007), pp.\u00a0319\u2013332"},{"key":"9139_CR7","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1109\/FOCS.2007.7","volume-title":"Proceedings of the 48th Annual Symposium on Foundations of Computer Science (FOCS)","author":"I. Haitner","year":"2007","unstructured":"I. Haitner, J.J. Hoch, O. Reingold, G. Segev, Finding collisions in interactive protocols\u2014a tight lower bound on the round complexity of statistically-hiding commitments, in Proceedings of the 48th Annual Symposium on Foundations of Computer Science (FOCS) (2007), pp.\u00a0669\u2013679"},{"issue":"3","key":"9139_CR8","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s00145-007-9012-8","volume":"22","author":"I. Haitner","year":"2009","unstructured":"I. Haitner, O. Horvitz, J. Katz, C. Koo, R. Morselli, R. Shaltiel, Reducing complexity assumptions for statistically hiding commitment. J. Cryptol.\n                  22(3), 283\u2013310 (2009)","journal-title":"J. Cryptol."},{"issue":"3","key":"9139_CR9","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1137\/080725404","volume":"39","author":"I. Haitner","year":"2009","unstructured":"I. Haitner, M. Nguyen, S.J. Ong, O. Reingold, S. Vadhan, Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function. SIAM J. Comput.\n                  39(3), 1153\u20131218 (2009). Preliminary versions in FOCS\u201906 and STOC\u201907","journal-title":"SIAM J. Comput."},{"key":"9139_CR10","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1145\/1536414.1536497","volume-title":"Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC)","author":"I. Haitner","year":"2009","unstructured":"I. Haitner, O. Reingold, S. Vadhan, H. Wee, Inaccessible entropy, in Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC) (2009), pp.\u00a0611\u2013620"},{"issue":"6","key":"9139_CR11","doi-asserted-by":"publisher","first-page":"1486","DOI":"10.1137\/080721820","volume":"40","author":"I. Haitner","year":"2011","unstructured":"I. Haitner, D. Harnik, O. Reingold, On the power of the randomized iterate. SIAM J. Comput.\n                  40(6), 1486\u20131528 (2011). Preliminary version in Crypto\u201906","journal-title":"SIAM J. Comput."},{"key":"9139_CR12","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"J. H\u00e5stad, R. Impagliazzo, L.A. Levin, M. Luby, A pseudorandom generator from any one-way function. SIAM J. Comput.\n                  28, 1364\u20131396 (1999). Preliminary versions in STOC\u201989 and STOC\u201990","journal-title":"SIAM J. Comput."},{"key":"9139_CR13","unstructured":"T. Koshiba, Y. Seri, Round-efficient one-way permutation based perfectly concealing bit commitment scheme. Technical Report TR06-093, ECCC (2006). \n                    http:\/\/eccc.hpi-web.de\/report\/2006\/093\/"},{"issue":"3","key":"9139_CR14","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s00145-002-0143-7","volume":"16","author":"Y. Lindell","year":"2003","unstructured":"Y. Lindell, Parallel coin-tossing and constant-round secure two-party computation. J. Cryptol.\n                  16(3), 143\u2013184 (2003)","journal-title":"J. Cryptol."},{"key":"9139_CR15","first-page":"33","volume-title":"Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC)","author":"M. Naor","year":"1989","unstructured":"M. Naor, M. Yung, Universal one-way Hash functions and their cryptographic applications, in Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC) (1989), pp.\u00a033\u201343"},{"issue":"2","key":"9139_CR16","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s001459900037","volume":"11","author":"M. Naor","year":"1998","unstructured":"M. Naor, R. Ostrovsky, R. Venkatesan, M. Yung, Perfect zero-knowledge arguments for NP using any one-way permutation. J. Cryptol.\n                  11(2), 87\u2013108 (1998). Preliminary version in CRYPTO\u201992","journal-title":"J. Cryptol."},{"key":"9139_CR17","first-page":"3","volume-title":"Proceedings of the 47th Annual Symposium on Foundations of Computer Science (FOCS)","author":"M. Nguyen","year":"2006","unstructured":"M. Nguyen, S.J. Ong, S. Vadhan, Statistical zero-knowledge arguments for NP from any one-way function, in Proceedings of the 47th Annual Symposium on Foundations of Computer Science (FOCS) (2006), pp.\u00a03\u201314"},{"key":"9139_CR18","first-page":"439","volume-title":"9th Annual Symposium on Theoretical Aspects of Computer Science","author":"R. Ostrovsky","year":"1992","unstructured":"R. Ostrovsky, R. Venkatesan, M. Yung, Secure commitment against all powerful adversary, in 9th Annual Symposium on Theoretical Aspects of Computer Science (1992), pp.\u00a0439\u2013448"},{"key":"9139_CR19","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1090\/dimacs\/013\/09","volume":"13","author":"R. Ostrovsky","year":"1993","unstructured":"R. Ostrovsky, R. Venkatesan, M. Yung, Fair games against an all-powerful adversary. AMS DIMACS Ser. Discrete Math. Theor. Comput. Sci.\n                  13, 155\u2013169 (1993). Preliminary version in SEQUENCES\u201991","journal-title":"AMS DIMACS Ser. Discrete Math. Theor. Comput. Sci."},{"key":"9139_CR20","first-page":"267","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u201993","author":"R. Ostrovsky","year":"1993","unstructured":"R. Ostrovsky, R. Venkatesan, M. Yung, Interactive hashing simplifies zero-knowledge protocol design, in Advances in Cryptology\u2014EUROCRYPT\u201993 (1993), pp.\u00a0267\u2013273"},{"key":"9139_CR21","first-page":"419","volume-title":"Theory of Cryptography, Fourth Theory of Cryptography Conference, TCC 2007","author":"H. Wee","year":"2007","unstructured":"H. Wee, One-way permutations, interactive hashing and statistically hiding commitments, in Theory of Cryptography, Fourth Theory of Cryptography Conference, TCC 2007 (2007), pp.\u00a0419\u2013433"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-012-9139-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-012-9139-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-012-9139-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-012-9139-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:10:02Z","timestamp":1586333402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-012-9139-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,4]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["9139"],"URL":"https:\/\/doi.org\/10.1007\/s00145-012-9139-0","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,4]]},"assertion":[{"value":"16 June 2008","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2013","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}