{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:57:31Z","timestamp":1772283451287,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540243014","type":"print"},{"value":"9783540305989","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30598-9_10","type":"book-chapter","created":{"date-parts":[[2011,1,12]],"date-time":"2011-01-12T10:44:35Z","timestamp":1294829075000},"page":"134-148","source":"Crossref","is-referenced-by-count":99,"title":["Efficient Blind Signatures Without Random Oracles"],"prefix":"10.1007","author":[{"given":"Jan","family":"Camenisch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"Koprowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bodgan","family":"Warinschi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-540-24676-3_11","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M. Bellare","year":"2004","unstructured":"Bellare, M., Boldyreva, A., Palacio, A.: An un-instantiable random-oracle-model scheme for a hybrid-encryption problem. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 171\u2013188. Springer, Heidelberg (2004)"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: ACM CCS, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"10_CR3","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 n is the product of two safe primes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, p. 107. Springer, Heidelberg (1999)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/BFb0052252","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"J. Camenisch","year":"1997","unstructured":"Camenisch, J., Stadler, M.: Efficient group signature schemes for large groups. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 410\u2013424. Springer, Heidelberg (1997)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. In: Proceedings of the 13th Annual ACM STOC, pp. 209\u2013218 (1998)","DOI":"10.1145\/276698.276741"},{"key":"10_CR6","first-page":"199","volume-title":"Advances in Cryptology \u2014 Proceedings of CRYPTO 1982","author":"D. Chaum","year":"1983","unstructured":"Chaum, D.: Blind signatures for untraceable payments. In: Advances in Cryptology \u2014 Proceedings of CRYPTO 1982, pp. 199\u2013203. Plenum Press, New York (1983)"},{"key":"10_CR7","first-page":"153","volume-title":"Advances in Cryptology \u2014 CRYPTO 1983","author":"D. Chaum","year":"1984","unstructured":"Chaum, D.: Blind signature systems. In: Advances in Cryptology \u2014 CRYPTO 1983, p. 153. Plenum Press, New York (1984)"},{"key":"10_CR8","unstructured":"Cramer, R.: Modular Design of Secure yet Practical Cryptographic Protocol. PhD thesis, University of Amsterdam (1997)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-45539-6_30","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"I. Damg\u00e5rd","year":"2000","unstructured":"Damg\u00e5rd, I.: Efficient concurrent zero-knowledge in the auxiliary string model. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, p. 418. Springer, Heidelberg (2000)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-36178-2_8","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"I. Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I., Fujisaki, E.: A statistically-hiding integer commitment scheme based on groups with hidden order. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 125\u2013142. Springer, Heidelberg (2002)"},{"key":"10_CR11","first-page":"813","volume":"53","author":"N. Bruijn de","year":"1950","unstructured":"de Bruijn, N.: On the number of positive integers \u2264\u2009x and free of prime factors >\u2009y. Nederl. Akad. Wetensch. Proceedings\u00a053, 813\u2013821 (1950)","journal-title":"Nederl. Akad. Wetensch. Proceedings"},{"key":"10_CR12","unstructured":"Dickman, K.: On the frequency of numbers containing prime factors of a certain relative magnitude. Arkiv f\u00f6r Matematik, Astronomi och Fysik\u00a022A(10) (1930)"},{"key":"10_CR13","first-page":"409","volume-title":"Proceedings of the 30th Annual STOC","author":"C. Dwork","year":"1998","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. In: Proceedings of the 30th Annual STOC, Dallas, TX, pp. 409\u2013418. ACM Press, New York (1998)"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solution to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/3-540-36288-6_9","volume-title":"Public Key Cryptography - PKC 2003","author":"M. Fischlin","year":"2002","unstructured":"Fischlin, M.: The Cramer-Shoup Strong-RSA signature scheme revisited. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 116\u2013129. Springer, Heidelberg (2002)"},{"key":"10_CR16","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. Fujiski","year":"1997","unstructured":"Fujiski, 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":"10_CR17","unstructured":"Goldwasser, S., Tauman, Y.: On the (in)security of the Fiat-Shamir transform. In: Proceedings of Foundations of Computer Science (2003)"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0022-314X(86)90013-2","volume":"22","author":"A. Hildebrand","year":"1986","unstructured":"Hildebrand, A.: On the number of positive integers \u2264\u2009x and free of prime factors >\u2009y. Journal of Number Theory\u00a022, 289\u2013307 (1986)","journal-title":"Journal of Number Theory"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/BFb0052233","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"A. Juels","year":"1997","unstructured":"Juels, A., Luby, M., Ostrovsky, R.: Security of blind digital signatures. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 150\u2013164. Springer, Heidelberg (1997)"},{"issue":"3","key":"10_CR20","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0304-3975(76)90050-5","volume":"3","author":"D.E. Knuth","year":"1976","unstructured":"Knuth, D.E., Pardo, L.T.: Analysis of a simple factorization algorithm. Theoretical Computer Science\u00a03(3), 321\u2013348 (1976)","journal-title":"Theoretical Computer Science"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"MacKenzie, P., Reiter, M.K.: Two-party generation of DSA signatures. International Journal of Information Security\u00a02(3) (2004)","DOI":"10.1007\/s10207-004-0041-0"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-45708-9_8","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J.B. Nielsen","year":"2002","unstructured":"Nielsen, J.B.: Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, p. 111. Springer, Heidelberg (2002)"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystem based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - ASIACRYPT \u201996","author":"D. Pointcheval","year":"1996","unstructured":"Pointcheval, D., Stern, J.: Provably secure blind signature schemes. In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol.\u00a01163, Springer, Heidelberg (1996)"},{"key":"10_CR25","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/266420.266440","volume-title":"ACM CCS","author":"D. Pointcheval","year":"1997","unstructured":"Pointcheval, D., Stern, J.: New blind signatures equivalent to factorization. In: ACM CCS, pp. 92\u201399. ACM Press, New York (1997)"},{"issue":"3","key":"10_CR26","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s001450010003","volume":"13","author":"D. Pointcheval","year":"2000","unstructured":"Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. Journal of Cryptology\u00a013(3), 361\u2013396 (2000)","journal-title":"Journal of Cryptology"}],"container-title":["Lecture Notes in Computer Science","Security in Communication Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30598-9_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:25:55Z","timestamp":1605741955000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30598-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540243014","9783540305989"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30598-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}