Efficient blind signatures without random oracles

Lecture Notes in Computer Science

Volumn 3352, Issue , 2005, Pages 134-148

  Camenisch, Jan ^a   Koprowski, Maciej ^b   Warinschi, Bodgan ^c  

^a IBM RESEARCH ZURICH   (Switzerland)

^b Intel Technology Poland   (Poland)

^c University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; DECISION MAKING; MATHEMATICAL MODELS; NETWORK PROTOCOLS; STANDARDS;

BLIND SIGNATURE SCHEME; CRAMER-SHOUP-FISCHILIN SIGNATURE SCHEME; MULTI-PARTY COMMUNICATION;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 23944509128     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30598-9_10     Document Type: Conference Paper

References (26)

1. M. Bellare, A. Boldyreva, and A. Palacio. An un-instantiable random-oracle-model scheme for a hybrid-encryption problem. In EUROCRYPT 2004, LNCS, 2004.
2. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In ACM CCS, pp. 62-73, 1993.
3. J. Camenisch and M. Michels. Proving in zero-knowledge that a number n is the product of two safe primes. In EUROCRYPT '99, vol. 1592 of LNCS.
4. J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In CRYPTO '97, vol. 1296 of LNCS. Springer Verlag, 1997.
5. R. Canetti, O. Goldreich, and S. Halevi. The random oracle methodology, revisited. In Proceedings of the 13th Annual ACM STOC, pp. 209-218, 1998.
6. D. Chaum. Blind signatures for untraceable payments. In Advances in Cryptology - Proceedings of CRYPTO '82, pp. 199-203. Plenum Press, 1983.
7. D. Chaum. Blind signature systems. In Advances in Cryptology -CRYPTO '83, p. 153. Plenum Press, 1984.
8. R. Cramer. Modular Design of Secure yet Practical Cryptographic Protocol. PhD thesis, University of Amsterdam, 1997.
9. I. Damgård. Efficient concurrent zero-knowledge in the auxiliary string model. In EUROCRYPT 2000, vol. 1807 of LNCS. Springer Verlag, 2000.
10. I. Damgård and E. Fujisaki. A statistically-hiding integer commitment scheme based on groups with hidden order. In ASIACRYPT 2002, vol. 2501 of LNCS.
11. N. de Bruijn. On the number of positive integers ≤ x and free of prime factors > y. Nederl. Akad. Wetensch. Proceedings, 53:813-821, 1950.
12. K. Dickman. On the frequency of numbers containing prime factors of a certain relative magnitude. Arkiv for Matematik, Astronomi och Fysik, 22A(10), 1930.
13. C. Dwork, M. Naor, and A. Sahai. Concurrent zero-knowledge. In Proceedings of the 30th Annual STOC, pp. 409-418, Dallas, TX, USA, May 1998. ACM Press.
14. A. Fiat and A. Shamir. How to prove yourself: Practical solution to identification and signature problems. In CRYPTO '86, vol. 263 of LNCS. Springer Verlag, 1987.
15. M. Fischlin. The Cramer-Shoup Strong-RSA signature scheme revisited. In PKC 2003, vol. 2567 of LNCS, pp. 116-129. Springer-Verlag, 2003.
16. E. Fujiski and T. Okamoto. Statistical zero-knowledge protocols to prove modular polynomial relations. In CRYPTO '97, vol. 1294 of LNCS, pp. 16-30, 1997.
17. S. Goldwasser and Y. Tauman. On the (in)security of the Fiat-Shamir transform. In Proceedings of Foundations of Computer Science, 2003.
18. A. Hildebrand. On the number of positive integers ≤ x and free of prime factors > y. Journal of Number Theory, 22:289-307, 1986.
19. A. Juels, M. Luby, and R. Ostrovsky. Security of blind digital signatures. In Proceedings of Crypto'97, vol. 1294 of LNCS, pp. 150-164. Springer-Verlag, 1997.
20. D. E. Knuth and L. T. Pardo. Analysis of a simple factorization algorithm. Theoretical Computer Science, 3(3):321-348, Dec. 1976.
21. P. MacKenzie and M. K. Reiter. Two-party generation of DSA signatures. International Journal of Information Security, 2(3), 2004.
22. J. B. Nielsen. Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case. In CRYPTO 2002, vol. 2442 of LNCS.
23. P. Paillier. Public-key cryptosystem based on composite degree residuosity classes. In Proceedings of EUROCRYPT'99, vol. 1592 of LNCS, pp. 223-238, 1999.
24. D. Pointcheval and J. Stern. Provably secure blind signature schemes. In Advances in Cryptology - ASIACRYPT '96. LNCS, Springer-Verlag, 1996.
25. D. Pointcheval and J. Stern. New blind signatures equivalent to factorization. In ACM CCS, pp. 92-99. ACM Press, 1997.
26. D. Pointcheval and J. Stern. Security arguments for digital signatures and blind signatures. Journal of Cryptology, 13(3):361-396, 2000.