{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T08:10:34Z","timestamp":1770538234889,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540679073","type":"print"},{"value":"9783540445982","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44598-6_15","type":"book-chapter","created":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T10:15:21Z","timestamp":1178014521000},"page":"236-254","source":"Crossref","is-referenced-by-count":207,"title":["Timed Commitments"],"prefix":"10.1007","author":[{"given":"Dan","family":"Boneh","sequence":"first","affiliation":[]},{"given":"Moni","family":"Naor","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,8,11]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"L. Adleman, and K. Kompella, \u201cUsing smoothness to achieve parallelism\u201d, proc. of STOC 1988, pp. 528\u2013538.","DOI":"10.1145\/62212.62264"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"N. Asokan, V. Shoup and M. Waidner, \u201cOptimistic fair exchange of digital signatures\u201d, in proc. Eurocrypt\u201998, pp. 591\u2013606, 1998.","DOI":"10.1007\/BFb0054156"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"G. Ateniese, \u201cEfficient protocols for verifiable encryption and fair exchange of digital signatures\u201d, in proc. of the 6th ACM CCS, 1999.","DOI":"10.1145\/319709.319728"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"M. Bellare and S. Goldwasser, \u201cVerifiable Partial Key Escrow\u201d, in proc. of ACM CCS, pp. 78\u201391, 1997.","DOI":"10.1145\/266420.266439"},{"key":"15_CR5","unstructured":"M. Bellare and S. Goldwasser, \u201cEncapsulated key escrow\u201d. MIT Laboratory for Computer Science Technical Report 688, April 1996."},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway, \u201cThe Exact Security of Digital Signatures-How to Sign with RSA and Rabin\u201d, EUROCRYPT 1996, pp. 399\u2013416","DOI":"10.1007\/3-540-68339-9_34"},{"issue":"1","key":"15_CR7","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/18.50372","volume":"36","author":"M. Ben-Or","year":"1990","unstructured":"M. Ben-Or, O. Goldreich, S. Micali and R. L. Rivest, \u201cA Fair Protocol for Signing Contracts\u201d, IEEE Transactions on Information Theory 36\/1 (1990) 40\u201346","journal-title":"IEEE Transactions on Information Theory"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"M. Blum, \u201cHow to Exchange (Secret) Keys\u201d, STOC 1983: 440\u2013447 and ACM TOCS 1(2): 175\u2013193 (1983)","DOI":"10.1145\/357360.357368"},{"issue":"2","key":"15_CR9","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L. Blum","year":"1986","unstructured":"L. Blum, M. Blum and M. Shub, A Simple Unpredictable Pseudo-Random Number Generator. SIAM J. Comput. 15(2): 364\u2013383 (1986).","journal-title":"SIAM J. Comput."},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"J. Y. Cai, R. J. Lipton, R. Sedgwick, A. C. Yao, \u201cTowards uncheatable benchmarks, Structures in Complexity\u201d, in proc. Structures in Complexity, pp. 2\u201311, 1993.","DOI":"10.1109\/SCT.1993.336546"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"J. Camenisch, M. Michels, \u201cProving in Zero-Knowledge that a Number Is the Product of Two Safe Primes\u201d, EUROCRYPT 1999, pp. 107\u2013122.","DOI":"10.1007\/3-540-48910-X_8"},{"key":"15_CR12","unstructured":"R. Canetti, O. Goldreich, S. Goldwasser and S. Micali. \u201cResettable Zero-Knowledge\u201d, ECCC Report TR99-042, Oct 27, 1999 and STOC 2000."},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"D. Chaum, and T. Pederson, \u201cWallet databases with observers\u201d, in Proceedings of Crypto\u2019 92, 1992, pp. 89\u2013105.","DOI":"10.1007\/3-540-48071-4_7"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"R. Cleve, \u201cLimits on the Security of Coin Flips when Half the Processors Are Faulty\u201d, in proc. STOC 1986, pp. 364\u2013369.","DOI":"10.1145\/12130.12168"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"R. Cleve, \u201cControlled gradual disclosure schemes for random bits and their applications\u201d, in proc. Crypto\u201989, 1990, pp. 573\u2013588.","DOI":"10.1007\/0-387-34805-0_50"},{"key":"15_CR16","unstructured":"R. Cleve, R. Impagliazzo, \u201cMartingales, collective coin flipping and discrete control processes\u201d, manuscript, 1993. Available: http:\/\/www.cpsc.ucalgary.ca\/cleve\/papers.html"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, \u201cConcurrent Zero-Knowledge in the auxilary string model\u201d, in proc. EUROCRYPT\u2019 2000.","DOI":"10.1007\/3-540-45539-6_30"},{"issue":"4","key":"15_CR18","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00191356","volume":"8","author":"I. Damg\u00e5rd","year":"1995","unstructured":"I. Damg\u00e5rd, \u201cPractical and Provably Secure Release of a Secret and Exchange of Signatures\u201d, J. of Cryptology 8(4): 201\u2013222 (1995)","journal-title":"J. of Cryptology"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"D. Dolev, C. Dwork and M. Naor, \u201cNon-malleable Cryptography\u201d, Preliminary version: Proc. 21st STOC, 1991. Full version: to appear, Siam J. on Computing. Available: http:\/\/www.wisdom.weizmann.ac.il\/naor","DOI":"10.1145\/103418.103474"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"C. Dwork and M. Naor, \u201cPricing via Processing-or-Combatting Junk Mail\u201d, Advances in Cryptology-CRYPTO\u201992, pp. 139\u2013147.","DOI":"10.1007\/3-540-48071-4_10"},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s001459900043","volume":"11","author":"C. Dwork","year":"1998","unstructured":"C. Dwork and M. Naor, \u201cAn Efficient Existentially Unforgeable Signature Scheme and Its Applications\u201d, J. of Cryptology 11, 1998, pp. 187\u2013208","journal-title":"J. of Cryptology"},{"key":"15_CR22","unstructured":"C. Dwork and M. Naor, \u201cZaps and their applications\u201d, manuscript."},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"C. Dwork, M. Naor and A. Sahai, \u201cConcurrent Zero-Knowledge\u201d, STOC, 1998.","DOI":"10.1145\/276698.276853"},{"issue":"6","key":"15_CR24","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"S. Even, O. Goldreich and A. Lempel, \u201cA Randomized Protocol for Signing Contracts\u201d, CACM 28(6): 637\u2013647 (1985).","journal-title":"CACM"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"A. Fiat and A. Shamir, \u201cHow to Prove Yourself: Practical Solutions to Identification and Signature Problems\u201d, CRYPTO\u201986, pp. 186\u2013194.","DOI":"10.1007\/3-540-47721-7_12"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"J. A. Garay, M. Jakobsson and P. D. MacKenzie: \u201cAbuse-Free Optimistic Contract Signing\u201d, CRYPTO 1999, pp. 449\u2013466.","DOI":"10.1007\/3-540-48405-1_29"},{"issue":"1","key":"15_CR27","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1137\/S0097539791220688","volume":"25","author":"O. Goldreich","year":"1996","unstructured":"O. Goldreich and H. Krawczyk. \u201cOn the Composition of Zero Knowledge Proof Systems\u201d, SIAM J. on Computing, Vol. 25, No. 1, pp. 169\u2013192, 1996.","journal-title":"SIAM J. on Computing"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"J. Kilian, E. Petrank and C. Rackoff, \u201cLower Bounds for Zero Knowledge on the Internet\u201d, FOCS 1998, pp. 484\u2013492.","DOI":"10.1109\/SFCS.1998.743499"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"M. Luby, S. Micali and C. Rackoff, \u201cHow to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin\u201d, FOCS 1983, pp. 11\u201321","DOI":"10.1109\/SFCS.1983.25"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"A. Menezes, P. van Oorschot and S. Vanstone, \u201cHandbook of Applied Cryptography\u201d CRC Press, 1996.","DOI":"10.1201\/9781439821916"},{"key":"15_CR31","doi-asserted-by":"crossref","unstructured":"M. Naor, B. Pinkas and R. Sumner, \u201cPrivacy Preserving Auctions and Mechanism Design\u201d, Proc. of the 1st ACM conference on E-Commerce, November 1999, pp. 129\u2013139.","DOI":"10.1145\/336992.337028"},{"key":"15_CR32","doi-asserted-by":"crossref","unstructured":"B. Pfitzmann, M. Waidner, \u201cOptimal Efficiency of Optimistic Contract Signing\u201d, PODC 1998: 113\u2013122","DOI":"10.1145\/277697.277717"},{"issue":"2","key":"15_CR33","first-page":"256","volume":"27","author":"M. O. Rabin","year":"1983","unstructured":"M. O. Rabin, \u201cTransaction Protection by Beacons\u201d, JCSS 27(2): 256\u2013267 (1983)","journal-title":"JCSS"},{"key":"15_CR34","doi-asserted-by":"crossref","unstructured":"R. Richardson and J. Kilian, \u201cOn the Concurrent Composition of Zero-Knowledge Proofs\u201d, EUROCRYPT\u2019 99, pp. 415\u2013431, 1999.","DOI":"10.1007\/3-540-48910-X_29"},{"key":"15_CR35","unstructured":"R. Rivest, A. Shamir and D. Wagner, \u201cTime lock puzzles and timed release cryptography\u201d, Technical report, MIT\/LCS\/TR-684"},{"key":"15_CR36","unstructured":"A. Rosen, \u201cA note on the round-complexity of concurrent zero-knowledge\u201d, these proceedings."},{"key":"15_CR37","doi-asserted-by":"crossref","unstructured":"V. Shmatikov and J. C. Mitchell, \u201cAnalysis of Abuse-Free Contract Signing\u201d, in proc. of 4th Annual Conference on Financial Cryptography, 2000.","DOI":"10.1007\/3-540-45472-1_13"},{"key":"15_CR38","unstructured":"J. P. Sorenson, \u201cA Sublinear-Time Parallel Algorithm for Integer Modular Exponentiation\u201d, manuscript."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44598-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T00:06:51Z","timestamp":1736986011000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44598-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679073","9783540445982"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/3-540-44598-6_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}