{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:43Z","timestamp":1760202643286},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642252822"},{"type":"electronic","value":"9783642252839"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25283-9_12","type":"book-chapter","created":{"date-parts":[[2011,11,17]],"date-time":"2011-11-17T11:31:18Z","timestamp":1321529478000},"page":"173-188","source":"Crossref","is-referenced-by-count":8,"title":["Two-Head Dragon Protocol: Preventing Cloning of Signature Keys"],"prefix":"10.1007","author":[{"given":"Przemys\u0142aw","family":"B\u0142a\u015bkiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Przemys\u0142aw","family":"Kubiak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miros\u0142aw","family":"Kuty\u0142owski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-69053-0_6","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"A. Young","year":"1997","unstructured":"Young, A., Yung, M.: Kleptography: Using cryptography against cryptography. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 62\u201374. Springer, Heidelberg (1997)"},{"key":"12_CR2","first-page":"281","volume-title":"IEEE Symposium on Security and Privacy","author":"S. Drimer","year":"2008","unstructured":"Drimer, S., Murdoch, S.J., Anderson, R.J.: Thinking inside the box: System-level failures of tamper proofing. In: IEEE Symposium on Security and Privacy, pp. 281\u2013295. IEEE Computer Society, Los Alamitos (2008)"},{"key":"12_CR3","first-page":"355","volume-title":"CCS 2003: Proc. 10th ACM Conference on Computer and Communications Security","author":"G. Itkis","year":"2003","unstructured":"Itkis, G.: Cryptographic tamper evidence. In: CCS 2003: Proc. 10th ACM Conference on Computer and Communications Security, pp. 355\u2013364. ACM, New York (2003)"},{"key":"12_CR4","series-title":"Informatik-Fachberichte","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/978-3-642-76562-9","volume-title":"VIS","author":"B. Pfitzmann","year":"1991","unstructured":"Pfitzmann, B., Waidner, M.: Fail-stop-signaturen und ihre anwendung. In: Pfitzmann, A., Raubold, E. (eds.) VIS. Informatik-Fachberichte, vol.\u00a0271, pp. 289\u2013301. Springer, Heidelberg (1991)"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/3-540-47555-9_30","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"E. Heyst van","year":"1993","unstructured":"van Heyst, E., Pedersen, T.P.: How to make efficient fail-stop signatures. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 366\u2013377. Springer, Heidelberg (1993)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/3-540-45708-9_32","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"G. Itkis","year":"2002","unstructured":"Itkis, G., Reyzin, L.: Sibir: Signer-base intrusion-resilient signatures. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 499\u2013514. Springer, Heidelberg (2002)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/10958513_8","volume-title":"Information Security","author":"J. Zhou","year":"2003","unstructured":"Zhou, J., Bao, F., Deng, R.H.: Validating digital signatures without tTP\u2019s time-stamping and certificate revocation. In: Boyd, C., Mao, W. (eds.) ISC 2003. LNCS, vol.\u00a02851, pp. 96\u2013110. Springer, Heidelberg (2003)"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-03549-4_12","volume-title":"Financial Cryptography and Data Security","author":"S. Xu","year":"2009","unstructured":"Xu, S., Yung, M.: Expecting the unexpected: Towards robust credential infrastructure. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol.\u00a05628, pp. 201\u2013221. Springer, Heidelberg (2009)"},{"key":"12_CR9","unstructured":"Boneh, D., Ding, X., Tsudik, G., Wong, C.M.: Instantenous revocation of security capabilities. In: USENIX Security Symposium (2001), \n                    \n                      http:\/\/www.usenix.org\/events\/sec01\/full_papers\/boneh\/boneh_html\/index.html"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/0-387-34799-2_25","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"D. Chaum","year":"1990","unstructured":"Chaum, D., Fiat, A., Naor, M.: Untraceable electronic cash. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 319\u2013327. Springer, Heidelberg (1990)"},{"key":"12_CR11","unstructured":"Brands, S.: An efficient off-line electronic cash system based on the representation problem. Technical report (1993)"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-48071-4_7","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"D. Chaum","year":"1993","unstructured":"Chaum, D., Pedersen, T.P.: Wallet databases with observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 89\u2013105. Springer, Heidelberg (1993)"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/11693383_9","volume-title":"Selected Areas in Cryptography","author":"A. Young","year":"2006","unstructured":"Young, A., Yung, M.: A space efficient backdoor in RSA and its applications. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 128\u2013143. Springer, Heidelberg (2006)"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-540-74124-4_24","volume-title":"Information Hiding","author":"A. Young","year":"2007","unstructured":"Young, A., Yung, M.: An elliptic curve backdoor algorithm for RSASSA. In: Camenisch, J., Collberg, C.S., Johnson, N.F., Sallee, P. (eds.) IH 2006. LNCS, vol.\u00a04437, pp. 355\u2013374. Springer, Heidelberg (2007)"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-540-78967-3_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"D.J. Bernstein","year":"2008","unstructured":"Bernstein, D.J.: Proving tight security for Rabin-Williams signatures. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 70\u201387. Springer, Heidelberg (2008)"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: ACM Conference on Computer and Communications Security, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"M. Bellare","year":"1996","unstructured":"Bellare, M., Rogaway, P.: The exact security of digital signatures - how to sign with RSA and Rabin. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 399\u2013416. Springer, Heidelberg (1996)"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-540-74462-7_25","volume-title":"Selected Areas in Cryptography","author":"M. Liskov","year":"2007","unstructured":"Liskov, M.: Constructing an ideal hash function from weak ideal compression functions. In: Biham, E., Youssef, A.M. (eds.) SAC 2006. LNCS, vol.\u00a04356, pp. 358\u2013375. Springer, Heidelberg (2007)"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-540-78524-8_21","volume-title":"Theory of Cryptography","author":"M. Fischlin","year":"2008","unstructured":"Fischlin, M., Lehmann, A.: Multi-property preserving combiners for hash functions. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 375\u2013392. Springer, Heidelberg (2008)"},{"key":"12_CR20","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols (1995), \n                    \n                      http:\/\/cseweb.ucsd.edu\/~mihir\/papers\/ro.pdf"}],"container-title":["Lecture Notes in Computer Science","Trusted Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25283-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T13:52:17Z","timestamp":1555595537000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25283-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642252822","9783642252839"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25283-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}