Security of blind discrete log signatures against interactive attacks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2229, Issue , 2001, Pages 1-12

  Schnorr, Claus Peter ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION;

COMPLEXITY ASSUMPTIONS; ELLIPTIC CURVE; GROUP MODELING; INHOMOGENITIES; PARALLEL INTERACTIONS; RANDOM ORACLE; SCHNORR SIGNATURE; SYSTEM OF LINEAR EQUATIONS;

NETWORK SECURITY;

EID: 84957026429     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45600-7_1     Document Type: Conference Paper

References (22)

1. M. Abe: A Secure Three-move Blind Signature Scheme for Polynomially Many Signatures. Proc. Eurocrypt’01, LNCS 2045, pp. 136-151, 2001.
2. M. Abe and T. Okamoto: Provably Secure Partially Blind Signatures. Proc. Crypto’00, LNCS 1880, pp. 271-286, 2000.
3. D. Chaum and T.P. Pedersen Wallet Databases with Observers. Proc. Crypto’92, LNCS 740, pp. 89-105, 1992.
4. D. Boneh and R.J. Lipton: Algorithms for black-box fields and their application in cryptography. Proc. Crypto’96, LNCS 1109, pp. 283-297, 1996.
5. M. Bellare and P. Rogaway: Random Oracles are Practical: a Paradigms for Designing Efficient Protocols. Proc. 1st ACM Conference on Computer Communication Security, pp. 62-73, 1993.
6. R. Canetti, O. Goldreich and S. Halevi: The Random Oracle Methodology, Revisited. Proc. STOC’98, ACM Press, pp. 209-218, 1998.
7. M. Fischlin: A Note on Security Proofs in the Generic Model. Proc. Asiacrypt’00, LNCS 1976, Springer-Verlag, pp. 458-469, 2000.
8. U. Feige, A. Fiat and A. Shamir: Zero-knowledge proofs of identity. Journal of Cryptology, 1, pp. 77-94, 1988.
9. A. Fiat and A. Shamir: How to Prove Yourself: Practical Solutions of Identification and Signature Problems. Proc. Crypto’86, LNCS 263, pp. 186-194, 1987.
10. J. Håstad: Some Optimal Inapproximability Results. Proc. ACM Symposium on Theory of Computing 1997, ACM Press, pp. 1-10, 1997.
11. V.I. Nechaev: Complexity of a Determinate Algorithm for the Discrete Logarithm. Mathematical Notes 55, pp. 165-172, 1994.
12. T. Okamoto: Provably Secure Identification Schemes and Corresponding Signature Schemes. Proc. Crypto’92, LNCS 740, Springer-Verlag, pp. 31- 53, 1992.
13. D. Pointcheval: Strengthened Security for Blind Signatures. Proc. Euro-crypt’98 LNCS 1403, Springer Verlag, pp. 391-405, 1998.
14. D. Pointcheval: The Composite Discrete Logarithm and Secure Authentication. Proc. PKC’2000, LNCS 1751, Springer-Verlag, pp. 113-128, 2000.
15. D. Pointcheval and J. Stern: Security Proofs for Signature Schemes. Proc. Eurocrypt’96, LNCS 1070, Springer-Verlag, pp. 387-398, 1996.
16. D. Pointcheval and J. Stern: Provably Secure Blind Signature Schemes. Proc. Asiacrypt’96, LNCS 1163, Springer Verlag, pp. 387-393, 1996.
17. D. Pointcheval and J. Stern: Security Arguments for Digital Signatures and Blind Signatures. Journal of Ctyptology, 13, 3, pp. 361-396, 2000.
18. C.P. Schnorr: Efficient Signature Generation for Smart Cards. Journal of Cryptology 4, pp. 161-174, 1991.
19. C.P. Schnorr and M. Jakobsson: Security of Signed ElGamal Encryption. Proc. Asiacrypt’00, LNCS, Springer-Verlag, 2000.
20. C.P. Schnorr: Small Generic Hardcore Subsets for the Discrete Logarithm: Short Secret DL-Keys. Information and Processing Letters, 79, pp. 93-98, 2001.
21. C.P. Schnorr: Security of DL-Encryption and Signatures Against Generic Attacks, a Survey. Proc. of Public-Key Cryptography and Computational Number Theory Conference, Warsaw Sept. 2000, Eds. K. Alster, H.C. Williams, J. Urbanowicz. De Gruyter GMBH, July, 2001.
22. V. Shoup: Lower Bounds for Discrete Logarithms and Related Problems. Proc. Eurocrypt’97, LNCS 1233, Springer-Verlag, pp. 256-266, 1997.