{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:17:46Z","timestamp":1725491866229},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540741237"},{"type":"electronic","value":"9783540741244"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74124-4_25","type":"book-chapter","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T23:06:39Z","timestamp":1189638399000},"page":"375-387","source":"Crossref","is-referenced-by-count":7,"title":["A Subliminal-Free Variant of ECDSA"],"prefix":"10.1007","author":[{"given":"Jens-Matthias","family":"Bohli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mar\u00eda Isabel","family":"Gonz\u00e1lez Vasco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rainer","family":"Steinwandt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/3-540-48184-2_11","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"E.F. Brickell","year":"1988","unstructured":"Brickell, E.F., Chaum, D., Damg\u00e5rd, I.B., van de Graaf, J.: Gradual and verifiable release of a secret. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 156\u2013166. Springer, Heidelberg (1988)"},{"issue":"3","key":"25_CR2","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s001459900053","volume":"12","author":"M. Burmester","year":"1999","unstructured":"Burmester, M., Desmedt, Y., Itoh, T., Sakurai, K., Shizuya, H.: Divertible and Subliminal-Free Zero-Knowledge Proofs for Languages. Journal of Cryptology\u00a012(3), 197\u2013223 (1999)","journal-title":"Journal of Cryptology"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-45539-6_31","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"F. Boudot","year":"2000","unstructured":"Boudot, F.: Efficient Proofs that a Committed Number Lies in an Interval. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 431\u2013444. Springer, Heidelberg (2000)"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","first-page":"182","volume-title":"Information Security and Cryptology \u2013 ICISC 2004","author":"B. Jens-Matthias","year":"2005","unstructured":"Jens-Matthias, B., Steinwandt, R.: On Subliminal Channels in Deterministic Signature Schemes. In: Park, C., Chee, S. (eds.) ICISC 2004. LNCS, vol.\u00a03506, pp. 182\u2013194. Springer, Heidelberg (2005)"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/0220068","volume":"20","author":"M. Blum","year":"1991","unstructured":"Blum, M., De Santis, A., Micali, S., Persiano, G.: Noninteractive Zero-Knowledge. SIAM Journal on Computing\u00a020, 1084\u20131118 (1991)","journal-title":"SIAM Journal on Computing"},{"key":"25_CR6","unstructured":"Bundesamt f\u00fcr Sicherheit in der Informationstechnik. Digitale Sicherheitsmerkmale im elektronischen Reisepass (2005), At the time of writing available at \n                    \n                      http:\/\/www.bsi.de\/fachthem\/epass\/Sicherheitsmerkmale.pdf"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/3-540-48910-X_8","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"J. Camenisch","year":"1999","unstructured":"Camenisch, J., Michels, M.: Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 107\u2013122. Springer, Heidelberg (1999)"},{"issue":"2","key":"25_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"L. Carter","year":"1979","unstructured":"Carter, L., Wegman, M.N.: Universal Classes of Hash Functions. Journal of Computer and System Sciences\u00a018(2), 143\u2013154 (1979)","journal-title":"Journal of Computer and System Sciences"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/0-387-34799-2_29","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"Y. Desmedt","year":"1990","unstructured":"Desmedt, Y.: Abuses in Cryptography and How to Fight Them. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 375\u2013389. Springer, Heidelberg (1990)"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/3-540-45961-8_3","volume-title":"Advances in Cryptology - EUROCRYPT \u201988","author":"Y. Desmedt","year":"1988","unstructured":"Desmedt, Y.: Subliminal-Free Authentication and Signature (Extended Abstract). In: G\u00fcnther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol.\u00a0330, pp. 23\u201333. Springer, Heidelberg (1988)"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1109\/CSFW.1996.503702","volume-title":"Proceedings 9th IEEE Computer Security Foundations Workshop","author":"Y. Desmedt","year":"1996","unstructured":"Desmedt, Y.: Simmons\u2019 Protocol is Not Free of Subliminal Channels. In: Proceedings 9th IEEE Computer Security Foundations Workshop, pp. 170\u2013175. IEEE Computer Society Press, Los Alamitos, CA, USA (1996)"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/3-540-48184-2_3","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"Y. Desmedt","year":"1988","unstructured":"Desmedt, Y., Goutier, C., Bengio, S.: Special Uses and Abuses of the Fiat-Shamir Passport Protocol. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 21\u201339. Springer, Heidelberg (1988)"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"E. Fujisaki","year":"1997","unstructured":"Fujisaki, E., Okamoto, T.: Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 16\u201330. Springer, Heidelberg (1997)"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"S. Goldwasser","year":"1993","unstructured":"Goldwasser, S., Ostrovsky, R.: Invariant Signatures and Non-interactive Zero-Knowledge Proofs Are Equivalent. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, Springer, Heidelberg (1993)"},{"key":"25_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography, Volume II","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography, Volume II. Cambridge University Press, Cambridge (2004)"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/73007.73009","volume-title":"Proceedings of the twenty-first annual ACM symposium on Theory of computing","author":"R. Impagliazzo","year":"1989","unstructured":"Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions. In: Proceedings of the twenty-first annual ACM symposium on Theory of computing, pp. 12\u201324. ACM Press, New York, NY, USA (1989)"},{"key":"25_CR17","unstructured":"ISO\/IEC 15946-2: Information technology \u2013 Security techniques \u2013 Cryptographic techniques based on elliptic curves \u2013 Part 1: Digital Signatures (2002)"},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1109\/SFCS.1989.63486","volume-title":"30th Annual Symposium on Foundations of Computer Science","author":"R. Impagliazzo","year":"1989","unstructured":"Impagliazzo, R., Zuckerman, D.: How to recycle random bits. In: 30th Annual Symposium on Foundations of Computer Science, pp. 248\u2013253. IEEE, New York (1989)"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/3-540-45708-9_38","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"A. Lysyanskaya","year":"2002","unstructured":"Lysyanskaya, A.: Unique Signatures and Verifiable Random Functions from the DH-DDH Separation. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 597\u2013612. Springer, Heidelberg (2002)"},{"key":"25_CR20","first-page":"120","volume-title":"Proceedings of the 40th Annual Symposium on the Foundations of Computer Science","author":"S. Micali","year":"1999","unstructured":"Micali, S., Rabin, M., Vadhan, S.: Verifiable Random Functions. In: Proceedings of the 40th Annual Symposium on the Foundations of Computer Science, pp. 120\u2013130. IEEE, New York (1999)"},{"issue":"2","key":"25_CR21","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1145\/972639.972643","volume":"51","author":"M. Naor","year":"2004","unstructured":"Naor, M., Reingold, O.: Number-Theoretic Constructions of Efficient Pseudo-Random Functions. Journal of the ACM\u00a051(2), 231\u2013262 (2004)","journal-title":"Journal of the ACM"},{"key":"25_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"T.P. Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and Information-Theoretic Secure Verifiable Secret Sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 129\u2013140. Springer, Heidelberg (1992)"},{"key":"25_CR23","first-page":"51","volume-title":"Advances in Cryptology \u2013 CRYPTO 1983","author":"G.J. Simmons","year":"1984","unstructured":"Simmons, G.J.: The Prisoners\u2019 Problem and the Subliminal Channel. In: Advances in Cryptology \u2013 CRYPTO 1983, pp. 51\u201367. Plenum Press, New York and London (1984)"},{"key":"25_CR24","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1109\/CSFW.1993.246634","volume-title":"Proceedings of the Computer Security Foundations Workshop VI","author":"G.J. Simmons","year":"1993","unstructured":"Simmons, G.J.: An Introduction to the Mathematics of Trust in Security Protocols. In: Proceedings of the Computer Security Foundations Workshop VI, pp. 121\u2013127. IEEE Computer Society Press, Los Alamitos, CA, USA (1993)"},{"key":"25_CR25","series-title":"Lecture Notes in Computer Science","first-page":"218","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"J. Gustavus","year":"1994","unstructured":"Gustavus, J.: Subliminal Communication Is Easy Using the DSA. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 218\u2013232. Springer, Heidelberg (1994)"},{"key":"25_CR26","first-page":"3","volume":"42","author":"D.R. Stinson","year":"2002","unstructured":"Stinson, D.R.: Universal hash families and the leftover hash lemma, and applications to cryptography and computing. Journal of Combinatorial Mathematics and Combinatorial Computing\u00a042, 3\u201331 (2002)","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"25_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/3-540-36288-6_23","volume-title":"Public Key Cryptography - PKC 2003","author":"S. Vaudenay","year":"2002","unstructured":"Vaudenay, S.: The Security of DSA and ECDSA. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 309\u2013323. Springer, Heidelberg (2002)"},{"key":"25_CR28","volume-title":"Malicious Cryptography: Exposing Cryptovirology","author":"A. Young","year":"2004","unstructured":"Young, A., Yung, M.: Malicious Cryptography: Exposing Cryptovirology. Wiley Publishing, Chichester (2004)"}],"container-title":["Lecture Notes in Computer Science","Information Hiding"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74124-4_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:11:22Z","timestamp":1619503882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74124-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540741237","9783540741244"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74124-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}