{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T15:17:33Z","timestamp":1764688653803},"publisher-location":"New York, NY","reference-count":14,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9780387973173"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-387-34805-0_13","type":"book-chapter","created":{"date-parts":[[2007,11,9]],"date-time":"2007-11-09T02:05:53Z","timestamp":1194573953000},"page":"128-136","source":"Crossref","is-referenced-by-count":93,"title":["Bit Commitment Using Pseudo-Randomness"],"prefix":"10.1007","author":[{"given":"Moni","family":"Naor","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"M. Blum, Coin Flipping by Telephone, Proc. 24th IEEE Compcon, 1982, pp. 133\u2013137."},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum, S. Micali How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits, Siam J. on Computing, vol 13, 1984, pp 850\u2013864.","journal-title":"Siam J. on Computing"},{"key":"13_CR3","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, Journal of Computer and System Sciences 37 (1988), pp. 156\u2013189.","journal-title":"Journal of Computer and System Sciences"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"D. Chaum, I. Damg\u00e5rd and J. van de Graaf, Multiparty Computations Ensuring Secrecy of each Party\u2019s Input and Correctness of the Output, Proc. of Crypto 87.","DOI":"10.1007\/3-540-48184-2_7"},{"key":"13_CR5","unstructured":"A. Fiat and A. Shamir, How to prove yourself, Proc. of Crypto 86, pp. 641\u2013654."},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser and M. Micali, How to construct random functions, Journal of the ACM, vol 33, 1986, pp. 792\u2013807.","journal-title":"Journal of the ACM"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"O. Goldreich, M. Micali, A. Wigderson, Proofs that yield nothing but their validity and a methodology of cryptographic protocol design, Proc. 27th Symposium on Foundations of Computer Science, 1986, pp 174\u2013187.","DOI":"10.1109\/SFCS.1986.47"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"O. Goldreich, M. Micali, A. Wigderson, How to play any mental game, Proc. 19th Symposium on Theory of Computing, 1987, pp. 218\u2013229.","DOI":"10.1145\/28395.28420"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"I. Impagliazzo and M. Luby, One-way functions are essential to computational based cryptography, Proc. 21st Symposium on Theory of Computing, 1989.","DOI":"10.1109\/SFCS.1989.63483"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"I. Impagliazzo, L. Levin and M. Luby, Pseudo-random generation from one-way functions, Proc. 21st Symposium on Theory of Computing, 1989.","DOI":"10.1145\/73007.73009"},{"key":"13_CR11","unstructured":"R. Impagliazzo and M. Yung, Direct Zero-Knowledge Protocols, Crypto 87."},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1109\/TIT.1972.1054893","volume":"18","author":"J. Justesen","year":"1972","unstructured":"J. Justesen, A class of constructive asymptotically good algebraic codes, IEEE trans. on Information theory 18 (1972) 652\u2013656.","journal-title":"IEEE trans. on Information theory"},{"key":"13_CR13","unstructured":"J. Kilian, S. Micali and R. Ostrovsky, Simple non-interactive zero-knowledge proofs, Crypto 89."},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"A. C. Yao, Theory and Applications of Trapdoor Functions, Proc. 23rd Symposium on Foundations of Computer Science, 1982, pp 80\u201391.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-34805-0_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:28:03Z","timestamp":1619501283000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-34805-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387973173"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/0-387-34805-0_13","relation":{},"subject":[]}}