{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T01:40:11Z","timestamp":1737078011439,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540007166"},{"type":"electronic","value":"9783540365525"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36552-4_5","type":"book-chapter","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T23:22:37Z","timestamp":1181172157000},"page":"62-74","source":"Crossref","is-referenced-by-count":4,"title":["An Efficient Fail-Stop Signature Scheme Based on Factorization"],"prefix":"10.1007","author":[{"given":"Willy","family":"Susilo","sequence":"first","affiliation":[]},{"given":"Rei","family":"Safavi-Naini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,3,14]]},"reference":[{"key":"5_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1007\/3-540-69053-0_33","volume-title":"Advances in Cryptology-Eurocrypt\u2019 97","author":"N. Bari\u0107","year":"1997","unstructured":"N. Bari\u0107 and B. Pfitzmann. Collision-Free Accumulators and Fail-Stop Signature Schemes without Trees. Advances in Cryptology-Eurocrypt\u2019 97, Lecture Notes in Computer Science 1233, pages 480\u2013494, 1997. 68"},{"key":"5_CR2","first-page":"91","volume":"1","author":"D. Chaum","year":"1990","unstructured":"D. Chaum, E. van Heijst, and B. Pfitzmann. Cryptographically strong undeniable signatures, unconditionally secure for the signer. Interner Bericht, Fakult\u00e4t f\u00fcr Informatik, 1\/91, 1990. 68","journal-title":"Interner Bericht, Fakult\u00e4t f\u00fcr Informatik"},{"key":"5_CR3","first-page":"3","volume":"3","author":"A. Lenstra","year":"1999","unstructured":"A. Lenstra and E. Verheul. Selecting cryptographic key sizes. online: http:\/\/www.cryptosavvy.com\/ . Extended abstract appeared in Commercial Applications, Price Waterhouse Coopers, CCE Quarterly Journals, 3:3\u20139, 1999. 68, 72, 73","journal-title":"Selecting cryptographic key sizes"},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1137\/S009753979324557X","volume":"26","author":"T.P. Pedersen","year":"1997","unstructured":"T.P. Pedersen and B. Pfitzmann. Fail-stop signatures. SIAM Journal on Computing, 26\/2:291\u2013330, 1997. 62, 63, 64, 65, 66, 67, 70, 71, 72, 73","journal-title":"SIAM Journal on Computing"},{"key":"5_CR5","unstructured":"B. Pfitzmann. Fail-stop signatures without trees. Hildesheimer Informatik-Berichte, Institut f\u00fcr Informatik, 16\/94, 1994. 68"},{"key":"5_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0024619","volume-title":"Digital Signature Schemes-General Framework and Fail-Stop Signatures","author":"B. Pfitzmann","year":"1996","unstructured":"B. Pfitzmann. Digital Signature Schemes-General Framework and Fail-Stop Signatures. Lecture Notes in Computer Science 1100, Springer-Verlag, 1996. 63, 64, 72"},{"key":"5_CR7","first-page":"90","volume":"22","author":"B. Pfitzmann","year":"1990","unstructured":"B. Pfitzmann and M. Waidner. Formal aspects of fail-stop signatures. Interner Bericht, Fakult\u00e4t f\u00fcr Informatik, 22\/90, 1990. 63","journal-title":"Interner Bericht, Fakult\u00e4t f\u00fcr Informatik"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"R. Safavi-Naini and W. Susilo. A general construction for Fail-Stop Signature using Authentication Codes. Proceedings of Workshop on Cryptography and Combinatorial Number Theory (CCNT\u2019 99), Birkh\u00e4user, pages 343\u2013356, 2001. 62","DOI":"10.1007\/978-3-0348-8295-8_25"},{"key":"5_CR9","first-page":"879","volume":"17","author":"R. Safavi-Naini","year":"2001","unstructured":"R. Safavi-Naini, W. Susilo, and H. Wang. An efficient construction for fail-stop signatures for long messages. Journal of Information Science and Engineering (JISE)-Special Issue on Cryptology and Information Security, 17:879\u2013898, 2001. 62","journal-title":"Journal of Information Science and Engineering (JISE)-Special Issue on Cryptology and Information Security"},{"key":"5_CR10","volume-title":"Cryptography: Theory and Practice","author":"D. R. Stinson","year":"1995","unstructured":"D. R. Stinson. Cryptography: Theory and Practice. CRC Press, Boca Raton, New York, 1995. 67, 70"},{"issue":"5","key":"5_CR11","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1093\/comjnl\/43.5.430","volume":"43","author":"W. Susilo","year":"2000","unstructured":"W. Susilo, R. Safavi-Naini, M. Gysin, and J. Seberry. A New and Efficient Fail-Stop Signature schemes. The Computer Journal vol. 43 Issue 5, pages 430\u2013437, 2000. 62","journal-title":"The Computer Journal"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"W. Susilo, R. Safavi-Naini, and J. Pieprzyk. RSA-based Fail-Stop Signature schemes. International Workshop on Security (IWSEC\u2019 99), IEEE Computer Society Press, pages 161\u2013166, 1999. 62, 63, 66, 67, 72, 73","DOI":"10.1109\/ICPPW.1999.800056"},{"key":"5_CR13","unstructured":"E. van Heijst and T. Pedersen. How to make efficient fail-stop signatures. Advances in Cryptology-Eurocrypt\u2019 92, pages 337\u2013346, 1992. 62, 63, 68, 71, 73"},{"key":"5_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/3-540-48071-4_2","volume-title":"Advances in Cryptology-Crypto\u2019 92","author":"E. Heijst van","year":"1993","unstructured":"E. van Heijst, T. Pedersen, and B. Pfitzmann. New constructions of fail-stop signatures and lower bounds. Advances in Cryptology-Crypto\u2019 92, Lecture Notes in Computer Science 740, pages 15\u201330, 1993. 62, 63, 64, 66, 72, 73"},{"key":"5_CR15","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-Eurocrypt\u2019 89","author":"M. Waidner","year":"1990","unstructured":"M. Waidner and B. Pfitzmann. The dining cryptographers in the disco: Unconditional sender and recipient untraceability with computationally secure serviceability. Advances in Cryptology-Eurocrypt\u2019 89, Lecture Notes in Computer Science 434, 1990. 62"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2014 ICISC 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36552-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T01:09:48Z","timestamp":1737076188000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36552-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540007166","9783540365525"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-36552-4_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}