{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T14:31:41Z","timestamp":1770906701108,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"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. Cryptology"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1007\/s001459900026","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:57:52Z","timestamp":1027580272000},"page":"163-194","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":44,"title":["On the existence of statistically hiding bit commitment schemes and fail-stop signatures"],"prefix":"10.1007","volume":"10","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":[{"issue":"6","key":"103163_CR1","doi-asserted-by":"publisher","first-page":"1915","DOI":"10.1109\/18.476316","volume":"41","author":"C. H. Bennett","year":"1995","unstructured":"[BBCM] C. H. Bennett, G. Brassard, C. Cr\u00e9peau, and U. Maurer. Generalized privacy amplification.IEEE Transactions on Information Theory,41(6) (1995), 1915\u20131923.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"103163_CR2","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"C. H. Bennett","year":"1988","unstructured":"[BBR] C. H. Bennett, G. Brassard, and J.-M. Robert. Privacy amplification by public discussion.SIAM Journal on Computing,17(2) (1988), 210\u2013229.","journal-title":"SIAM Journal on Computing"},{"key":"103163_CR3","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"[BCC] G. Brassard, D. Chaum, and C. Cr\u00e9peau. Minimum disclosure proofs of knowledge.Journal of Computer and System Sciences,37 (1988), 156\u2013189.","journal-title":"Journal of Computer and System Sciences"},{"key":"103163_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J. L. Carter","year":"1979","unstructured":"[CW] J. L. Carter and M. N. Wegman. Universal classes of hash functions.Journal of Computer and System Sciences,18 (1979), 143\u2013154.","journal-title":"Journal of Computer and System Sciences"},{"key":"103163_CR5","series-title":"LNCS","first-page":"203","volume-title":"Proceedings of Eurocrypt '87","author":"I. B. Damg\u00e5rd","year":"1988","unstructured":"[D1] I. B. Damg\u00e5rd. Collision free hash functions and public key signature schemes.Proceedings of Eurocrypt '87. LNCS, 304, Springer-Verlag, Berlin, pp. 203\u2013216, 1988."},{"key":"103163_CR6","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/0-387-34805-0_39","volume-title":"Proceedings of Crypto '89","author":"I. B. Damg\u00e5rd","year":"1990","unstructured":"[D2] I. B. Damg\u00e5rd. A design principle for hash functions.Proceedings of Crypto '89. LNCS, 435, Springer-Verlag, Berlin, pp. 416\u2013427, 1990."},{"key":"103163_CR7","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/3-540-60865-6_44","volume-title":"Proceedings of the 3rd Fast Software Encryption Workshop","author":"H. Dobbertin","year":"1996","unstructured":"[DBP] H. Dobbertin, A. Bosselaers, and B. Preneel. RIPEMD-160: A strengthened version of RIPEMD.Proceedings of the 3rd Fast Software Encryption Workshop. LNCS, 1039, Springer-Verlag, Berlin, pp. 71\u201382, 1996."},{"issue":"6","key":"103163_CR8","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"[DH] W. Diffie and M. E. Hellman. New directions in cryptography.IEEE Transactions on Information Theory,22(6) (1976), 644\u2013654.","journal-title":"IEEE Transactions on Information Theory"},{"key":"103163_CR9","unstructured":"[DPP] I. Damg\u00e5rd, T. P. Pedersen, and B. Pfitzmann. Statistical Secrecy and Multi-Bit Commitments. BRiCS Report Series RS-96-45. Submitted toIEEE Transactions on Information Theory. Available at http:\/\/www.brics.dk\/"},{"key":"103163_CR10","volume-title":"An Introduction to Probability Theory and its Applications","author":"W. Feller","year":"1971","unstructured":"[F] W. Feller.An Introduction to Probability Theory and its Applications, volume II (2nd edn.) Wiley, New York, 1971.","edition":"2nd edn."},{"key":"103163_CR11","volume-title":"Information Theory and Reliable Communication","author":"R. G. Gallager","year":"1968","unstructured":"[G] R. G. Gallager.Information Theory and Reliable Communication. Wiley, New York, 1968."},{"issue":"2","key":"103163_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"[GMR1] S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosenmessage attacks.SIAM Journal on Computing,17(2) (1988), 281\u2013308.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"103163_CR13","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"[GMR2] S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof-systems.SIAM Journal on Computing,18(1) (1989), 186\u2013208.","journal-title":"SIAM Journal on Computing"},{"key":"103163_CR14","series-title":"LNCS","first-page":"366","volume-title":"Proceedings of Eurocrypt '92","author":"E. Heyst van","year":"1993","unstructured":"[HP] E. van Heyst and T. P. Pedersen. How to make efficient fail-stop signatures.Proceedings of Eurocrypt '92. LNCS, 658, Springer-Verlag, Berlin, pp. 366\u2013377, 1993."},{"key":"103163_CR15","series-title":"LNCS","first-page":"15","volume-title":"Proceedings of Crypto '92","author":"E. Heijst van","year":"1993","unstructured":"[HPP] E. van Heijst, T. P. Pedersen, and B. Pfitzmann. New constructions of fail-stop signatures and lower bounds.Proceedings of Crypto '92. LNCS, 740, Springer-Verlag, Berlin, pp. 15\u201330, 1993."},{"key":"103163_CR16","unstructured":"[L] L. Lamport. Constructing digital signatures from a one-way function, SRI Intl. CSL-98, Oct. 1979."},{"key":"103163_CR17","series-title":"AAAS Selected Symposium","first-page":"73","volume-title":"Secure Communications and Asymmetric Cryptosystems","author":"R. C. Merkle","year":"1982","unstructured":"[M1] 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, CO, 1982, pp. 73\u2013104."},{"key":"103163_CR18","series-title":"LNCS","first-page":"369","volume-title":"Proceedings of Crypto '87","author":"R. C. Merkle","year":"1988","unstructured":"[M2] R. C. Merkle. A digital signature based on a conventional encryption function.Proceedings of Crypto '87. LNCS, 293, Springer-Verlag, Berlin, pp. 369\u2013378, 1988."},{"key":"103163_CR19","series-title":"LNCS","first-page":"196","volume-title":"Proceedings of Crypto '92","author":"M. Naor","year":"1993","unstructured":"[NOVY] M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung. Perfect zero-knowledge arguments forN P can be based on general complexity assumptions.Proceedings of Crypto '92. LNCS, 740, Springer-Verlag, Berlin, pp. 196\u2013214, 1993."},{"key":"103163_CR20","doi-asserted-by":"crossref","unstructured":"[NY] M. Naor and 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":"103163_CR21","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/168588.168597","volume-title":"1st ACM Conference on Computer and Communications Security, Fairfax","author":"B. Pfitzmann","year":"1993","unstructured":"[P1] B. Pfitzmann. Sorting out signature schemes.1st ACM Conference on Computer and Communications Security, Fairfax, ACM Press, New York, pp. 74\u201385, 1993."},{"key":"103163_CR22","series-title":"LNCS","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0024619","volume-title":"Digital Signature Schemes\u2014General Framework and Fail-Stop Signatures","author":"B. Pfitzmann","year":"1996","unstructured":"[P2] B. Pfitzmann:Digital Signature Schemes\u2014General Framework and Fail-Stop Signatures. LNCS, 1100, Springer-Verlag, Berlin, August 1996."},{"key":"103163_CR23","doi-asserted-by":"crossref","unstructured":"[PP] T. P. Pedersen and B. Pfitzmann. Fail-stop signatures. To appear inSIAM Journal of Computing, February 1997.","DOI":"10.1137\/S009753979324557X"},{"key":"103163_CR24","unstructured":"[PW1] B. Pfitzmann and M. Waidner. Formal Aspects of Fail-Stop Signatures. Internal Report 22\/90, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe, 1990."},{"key":"103163_CR25","unstructured":"[PW2] B. Pfitzmann and M. Waidner. Fail-stop signatures and their application. Securicom 91, Paris, pp. 145\u2013160."},{"key":"103163_CR26","doi-asserted-by":"crossref","unstructured":"[R] J. Rompel. One-way functions are necessary and sufficient for secure signatures.Proceedings of 22nd STOC, pp. 387\u2013394, 1990.","DOI":"10.1145\/100216.100269"},{"key":"103163_CR27","series-title":"LNCS","first-page":"690","volume-title":"Proceedings of Eurocrypt '89","author":"M. Waidner","year":"1990","unstructured":"[WP] M. Waidner and B. Pfitzmann. The dining cryptographers in the disco: unconditional sender and recipient untraceability with computationally secure serviceability.Proceedings of Eurocrypt '89, LNCS, 434, Springer-Verlag, Berlin, p. 690, 1990."},{"issue":"8","key":"103163_CR28","doi-asserted-by":"crossref","first-page":"1355","DOI":"10.1002\/j.1538-7305.1975.tb02040.x","volume":"54","author":"A. D. Wyner","year":"1975","unstructured":"[W] A. D. Wyner. The wire-tap channel.The Bell System Technical Journal,54(8) (1975), 1355\u20131387.","journal-title":"The Bell System Technical Journal"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s001459900026.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s001459900026\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s001459900026","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s001459900026.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:18:09Z","timestamp":1586333889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s001459900026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["103163"],"URL":"https:\/\/doi.org\/10.1007\/s001459900026","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,6]]},"assertion":[{"value":"19 April 1994","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 1996","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}