{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:39:02Z","timestamp":1750307942048,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T00:00:00Z","timestamp":1181520000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,6,11]]},"DOI":"10.1145\/1250790.1250792","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T16:07:37Z","timestamp":1189786057000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":36,"title":["Statistically-hiding commitment from any one-way function"],"prefix":"10.1145","author":[{"given":"Iftach","family":"Haitner","sequence":"first","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omer","family":"Reingold","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","author":"Boyar J.","year":"1990","unstructured":"J. Boyar , S. Kurtz , and M. Krentel . Discrete logarithm implementation of perfect zero-knowledge blobs. J. CRYPTOLOGY , 1990 . J. Boyar, S. Kurtz, and M. Krentel. Discrete logarithm implementation of perfect zero-knowledge blobs. J. CRYPTOLOGY, 1990.","journal-title":"Discrete logarithm implementation of perfect zero-knowledge blobs. J. CRYPTOLOGY"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90005-0"},{"key":"e_1_3_2_1_3_1","author":"Carter J.","year":"1979","unstructured":"J. Carter and M. Wegman . Universal classes of hash functions. J. CSS , 1979 . J. Carter and M. Wegman. Universal classes of hash functions. J. CSS, 1979.","journal-title":"Universal classes of hash functions. J. CSS"},{"key":"e_1_3_2_1_4_1","volume-title":"JCRYPTOLOGY","author":"Damgard I.","year":"1997","unstructured":"I. Damgard , M. Pedersen , and B. Pfitzmann . On the existence of statistically hiding bit commitment schemes and all fail-stop signatures . JCRYPTOLOGY , 1997 . I. Damgard, M. Pedersen, and B. Pfitzmann. On the existence of statistically hiding bit commitment schemes and all fail-stop signatures. JCRYPTOLOGY, 1997."},{"key":"e_1_3_2_1_5_1","volume-title":"Randomized methods in computation - lecture notes","author":"Goldreich O.","year":"2001","unstructured":"O. Goldreich . Randomized methods in computation - lecture notes . 2001 . O. Goldreich. Randomized methods in computation - lecture notes. 2001."},{"key":"e_1_3_2_1_6_1","volume-title":"JCRYPTOLOGY","author":"Goldreich O.","year":"1996","unstructured":"O. Goldreich and A. Kahan . How to construct constant-round zero-knowledge proof systems for all NP . JCRYPTOLOGY , 1996 . O. Goldreich and A. Kahan. How to construct constant-round zero-knowledge proof systems for all NP. JCRYPTOLOGY, 1996."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217017"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_4"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63483"},{"key":"e_1_3_2_1_12_1","volume-title":"JCRYPTOLOGY","author":"Lindell Y.","year":"2003","unstructured":"Y. Lindell . Parallel coin-tossing and constant-round secure two-party all computation . JCRYPTOLOGY , 2003 . Y. Lindell. Parallel coin-tossing and constant-round secure two-party all computation. JCRYPTOLOGY, 2003."},{"key":"e_1_3_2_1_13_1","volume-title":"CRYPTOLOGY","author":"Naor M.","year":"1991","unstructured":"M. Naor . Bit commitment using pseudorandomness. J . CRYPTOLOGY , 1991 . M. Naor. Bit commitment using pseudorandomness. J. CRYPTOLOGY, 1991."},{"key":"e_1_3_2_1_14_1","author":"Naor M.","year":"1998","unstructured":"M. Naor , R. Ostrovsky , R. Venkatesan , and M. Yung . Perfect zero-knowledge arguments for NP using any one-way all permutation. J. CRYPTOLOGY , 1998 . M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung. Perfect zero-knowledge arguments for NP using any one-way all permutation. J. CRYPTOLOGY, 1998.","journal-title":"J. CRYPTOLOGY"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73011"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.71"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132559"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100269"}],"event":{"name":"STOC07: Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"San Diego California USA","acronym":"STOC07"},"container-title":["Proceedings of the thirty-ninth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250790.1250792","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1250790.1250792","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:52:20Z","timestamp":1750258340000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250790.1250792"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,11]]},"references-count":17,"alternative-id":["10.1145\/1250790.1250792","10.1145\/1250790"],"URL":"https:\/\/doi.org\/10.1145\/1250790.1250792","relation":{},"subject":[],"published":{"date-parts":[[2007,6,11]]},"assertion":[{"value":"2007-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}