{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T22:21:28Z","timestamp":1744755688639},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540577669"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-48329-2_22","type":"book-chapter","created":{"date-parts":[[2007,8,5]],"date-time":"2007-08-05T21:25:55Z","timestamp":1186349155000},"page":"250-265","source":"Crossref","is-referenced-by-count":44,"title":["On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures"],"prefix":"10.1007","author":[{"given":"Ivan B.","family":"Damg\u00e5rd","sequence":"first","affiliation":[]},{"given":"Torben P.","family":"Pedersen","sequence":"additional","affiliation":[]},{"given":"Birgit","family":"Pfitzmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"C. H. Bennett, G. Brassard, C. Cr\u00e9peau, U. Maurer: Privacy Amplification Against Probabilistic Information. In preparation."},{"issue":"2","key":"22_CR2","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"C. H. Bennett","year":"1988","unstructured":"C. H. Bennett, G. Brassard, J.-M. Robert: Privacy Amplification by Public Discussion. SIAM Journal on Computing, vol 17, no. 2, 1988, pp. 210\u2013229.","journal-title":"SIAM Journal on Computing"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J. L. Carter","year":"1979","unstructured":"J. L. Carter, M. N. Wegman: Universal Classes of Hash Functions. Journal of Computer and System Sciences 18, 1979, pp. 143\u2013154.","journal-title":"Journal of Computer and System Sciences"},{"key":"22_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/0-387-34805-0_39","volume-title":"Proceedings of Crypto\u201989","author":"I. B. Damg\u00e5rd","year":"1990","unstructured":"I. B. Damg\u00e5rd: A Design Principle for Hash Functions. Proceedings of Crypto\u201989, LNCS 435, pp. 416\u2013427, 1990."},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"E. van Heyst, T. P. Pedersen: How to Make Efficient Fail-Stop Signatures. Presented at Eurocrypt\u201992, Balatonf\u00fcred, Hungary, 1992.","DOI":"10.1007\/3-540-47555-9_30"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"E. van Heyst, T. P. Pedersen, B. Pfitzmann: New Constructions of Fail-Stop Signatures and Lower Bounds. Presented at Crypto\u201992, Santa Barbara, 1992.","DOI":"10.1007\/3-540-48071-4_2"},{"key":"22_CR7","unstructured":"R. Rivest: The MD4 message-digest algorithm, Proc. of Crypto 90."},{"key":"22_CR8","first-page":"73","volume-title":"Secure Communications and Asymmetric Cryptosystems, AAAS Selected Symposium","author":"R. C. Merkle","year":"1982","unstructured":"R. C. Merkle: Protocols for Public Key Cryptosystems. In: Secure Communications and Asymmetric Cryptosystems, AAAS Selected Symposium 69, G. J. Simmons (ed.); Westview Press, Boulder 1982, pp. 73\u2013104."},{"key":"22_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/3-540-48184-2_32","volume-title":"Proceedings of Crypto\u201987","author":"R. C. Merkle","year":"1988","unstructured":"R. C. Merkle: A digital signature based on a conventional encryption function. Proceedings of Crypto\u201987, LNCS 293, Springer-Verlag, Berlin 1988, pp. 369\u2013378."},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"M. Naor, M. Yung: Universal One-Way Hash Functions and their Cryptographic Applications. Proceedings of 21st STOC, pp. 33\u201343, 1989.","DOI":"10.1145\/73007.73011"},{"key":"22_CR11","unstructured":"M. Naor, R. Ostrovsky, R. Venkatesan, M. Yung: Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions. Presented at Crypto\u201992, Santa Barbara, 1992."},{"key":"22_CR12","unstructured":"T. P. Pedersen, B. Pfitzmann: Fail-Stop Signatures. Manuscript, February 1993."},{"key":"22_CR13","unstructured":"B. Pfitzmann, M. Waidner: Formal Aspects of Fail-Stop Signatures. Internal report 22\/90, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe."},{"key":"22_CR14","unstructured":"B. Pfitzmann, M. Waidner: Fail-Stop Signatures and their Application. Securicom 91, Paris, pp. 145\u2013160."},{"key":"22_CR15","unstructured":"Specifications for a Secure Hash Standard, Federal Information Processing Standards Publication YY, 1992."},{"key":"22_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1007\/3-540-46885-4_69","volume-title":"Proceedings of Eurocrypt\u201989","author":"M. Waidner","year":"1990","unstructured":"M. Waidner, B. Pfitzmann: The Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with Computationally Secure Serviceability. Proceedings of Eurocrypt\u201989, LNCS 434, page 690, 1990."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 93"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48329-2_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:15:35Z","timestamp":1605629735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48329-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540577669"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-48329-2_22","relation":{},"subject":[]}}