Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions (original) (raw)

Abstract

We show a new protocol for blind signatures in which security is preserved even under arbitrarily-many concurrent executions. The protocol can be based on standard cryptographic assumptions and is the first to be proven secure in a concurrent setting (under any assumptions) without random oracles or a trusted setup assumption such as a common reference string. Along the way, we also introduce new definitions of security for blind signature schemes.

Loading...

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.

References (32)

  1. M. Abe. A Secure Three-Move Blind Signature Scheme for Polynomially-Many Signatures. Eurocrypt 2001.
  2. M. Abdalla, C. Namprempre, and G. Neven. On the (Im)possibility of Blind Mes- sage Authentication Codes. CT-RSA 2006.
  3. B. Barak, R. Canetti, J.B. Nielsen, and R. Pass. Universally Composable Protocols with Relaxed Set-Up Assumptions. FOCS 2004.
  4. B. Barak and A. Sahai. How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation. FOCS 2005.
  5. M. Bellare, C. Namprempre, D. Pointcheval, and M. Semanko. The One-More- RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme. J. Cryptology 16(3): 185-215 (2003).
  6. M. Bellare and P. Rogaway. Random Oracles are Practical: A Paradigm for De- signing Efficient Protocols. ACM CCCS '93.
  7. M. Blum. How to Prove a Theorem so No One Else Can Claim It. Proceedings of the International Congress of Mathematicians, pp. 1444-1451, 1986.
  8. A. Boldyreva. Efficient Threshold Signatures, Multisignatures, and Blind Signa- tures Based on the Gap-Diffie-Hellman-Group Signature Scheme. PKC 2003.
  9. J. Camenisch, M. Koprowski, and B. Warinschi. Efficient Blind Signatures without Random Oracles. SCN 2004.
  10. R. Canetti, Y. Lindell, R. Ostrovsky, and A. Sahai. Universally Composable Two- Party and Multi-Party Secure Computation. STOC 2002.
  11. D. Chaum. Blind Signatures for Untraceable Payments. Crypto '82.
  12. I. Damgård. Payment Systems and Credential Mechanisms with Provable Security against Abuse by Individuals. Crypto '88.
  13. I. Damgård and J.B. Nielsen. Perfect Hiding and Perfect Binding Universally Com- posable Commitment Schemes with Constant Expansion Factor. Crypto 2002.
  14. C. Dwork and M. Naor. Zaps and Their Applications. FOCS 2000.
  15. U. Feige and A. Shamir. Zero-Knowledge Proofs of Knowledge in Two Rounds. Crypto '89.
  16. M. Fischlin. Round-Optimal Composable Blind Signatures in the Common Refer- ence String Model. Crypto 2006.
  17. O. Goldreich. Foundations of Cryptography, vol. 1: Basic Tools. Cambridge Uni- versity Press, 2001.
  18. S. Goldwasser, S. Micali, and R. Rivest. A Digital Signature Scheme Secure against Adaptive Chosen-Message Attacks. SIAM J. Computing 17(2): 281-308 (1988).
  19. A. Juels, M. Luby, and R. Ostrovsky. Security of Blind Digital Signatures. Crypto '97.
  20. Y. Kalai, Y. Lindell, and M. Prabhakaran. Concurrent General Composition of Secure Protocols in the Timing Model. STOC 2005.
  21. A. Kiayias and H.-S. Zhou. Two-Round Concurrent Blind Signatures without Ran- dom Oracles. SCN 2006.
  22. Y. Lindell. Parallel Coin-Tossing and Constant-Round Secure Two-Party Compu- tation. J. Cryptology 16(3): 143-184 (2003).
  23. Y. Lindell. Bounded-Concurrent Secure Two-Party Computation without Setup Assumptions. STOC 2003.
  24. Y. Lindell. Lower Bounds for Concurrent Self-Composition. TCC 2004.
  25. S. Micali, R. Pass, and A. Rosen. Input-Indistinguishable Computation. FOCS 2006.
  26. T. Okamoto. Efficient Blind and Partially Blind Signatures without Random Or- acles. TCC 2006.
  27. D. Pointcheval. Strengthened Security for Blind Signatures. Eurocrypt '98.
  28. D. Pointcheval and J. Stern. Provably Secure Blind Signature Schemes. Asi- acrypt '96.
  29. D. Pointcheval and J. Stern. Security Arguments for Digital Signatures and Blind Signatures. J. Cryptology 13(3): 361-396 (2000).
  30. M. Prabhakaran, A. Rosen, and A. Sahai. Concurrent Zero Knowledge with Log- arithmic Round-Complexity. FOCS 2002.
  31. M. Prabhakaran and A. Sahai. New Notions of Security: Achieving Universal Com- posability without Trusted Setup. STOC 2004.
  32. A. Rosen. Concurrent Zero-Knowledge. Springer, 2006.