Abstract
We describe two simple, efficient and effective credential pseudonymous certificate systems, which also support anonymity without the need for a trusted third party. The second system provides cryptographic protection against the forgery and transfer of credentials. Both systems are based on a new paradigm, called self-blindable certificates. Such certificates can be constructed using the Weil pairing in supersingular elliptic curves.
Chapter PDF
Similar content being viewed by others
Keywords
- Discrete Logarithm
- Discrete Logarithm Problem
- Transformation Factor
- Digital Signature Scheme
- Weil Pairing
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
I.F. Blake, G. Seroussi, N.P. Smart, Elliptic Curves in Cryptography, Cambridge University Press, 1999.
D. Boneh, M. Franklin, Identity-Based Encryption from the Weil Pairing, Proceedings of Crypto 2001, LNCS 2139, Springer-Verlag 2001, 213–229.
D. Boneh, B. Lynn, H. Shacham Short Signatures from the Weil Pairing, these proceedings.
S. Brands, Untraceable Off-line Cash in Wallet with Observers, Proceedings of Crypto’ 93, LNCS 911, Springer-Verlag 1994, 302–318.
S. Brands, Rethinking Public Key Infrastructures and Digital Signatures; Building in Privacy, PhD Thesis, Eindhoven University of Technology, the Netherlands, 1999.
J. Camenisch, A. Lysyanskaya, An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation, Proceedings of Eurocrypt 2001, LNCS 2045, Springer-Verlag 2001, 93–118.
D. Chaum, Security Without Identification: Transaction Systems to Make Big Brother Obsolete, Communications of the ACM, 1985, 28(10), 1035–1044. See also Security Without Identification: Card Computers to Make Big Brother Obsolete, available from http://www.chaum.com.
D. Chaum, Zero-knowledge Undeniable Signatures, Proceedings of Eurocrypt’90, LNCS 473, Springer-Verlag 1991, 458–464.
D. Chaum, H. van Antwerpen, Undeniable Signatures, Proceedings of Crypto’89, LNCS 435, Springer-Verlag 1990, 212–216.
D. Chaum, J.-H. Evertse, A Secure and Privacy-protecting Protocol for Transmitting Personal Information between Organizations, Proceedings of Crypto’ 86, LNCS 263, Springer-Verlag 1987, 118–167.
D. Chaum, T.P. Pedersen, Wallet Databases with Observers, Proceedings of Crypto’92, LNCS 740, Springer-Verlag 1993, 89–105.
L. Chen, Access with Pseudonyms, In Cryptography: Policy and Algorithms, LNCS 1029,Springer-Verlag 1995, 232–243.
I. Damgård, Efficient Concurrent Zero-knowledge in the Auxiliary String Model, Proceedings of Eurocrypt 2000, LNCS 1807, Springer-Verlag 2000, 431–444.
T. ElGamal A Public Key Cryptosystem and Signature System Based on Discrete Logarithms, Proceedings of Crypto’ 84, LNCS 196, Springer-Verlag 1985, 10–18.
FIPS 186, Digital Signature Standard, Federal Information Processing Standards publication 186, U.S. Department of Commerce/NIST, 1994.
A. Joux, A One Round Protocol for Tripartite Diffie-Hellman, 4th International Symposium, Proceedings of ANTS, LNCS 1838, Springer-Verlag, 2000, 385–394.
A. Joux, K. Nguyen, Seperating Decision Diffie-Hellman from Diffie-Hellman in Cryptographic Groups, in preparation. Available from http://eprint.iacr.org.
A.K. Lenstra, E.R. Verheul, The XTR Public Key System, Proceedings of Crypto 2000, LNCS 1880, Springer-Verlag, 2000, 1–19; available from http://www.ecstr.com.
A. Lysyanskaya. R. Rivest, A. Sahai, S. Wolf, Pseudonym Systems, In Selected Areas in Cryptography, LNCS 1758, Springer-Verlag 1999.
A. Menezes, Elliptic Curve Public Key Cryptosystems, Kluwer Academic Publishers, Boston 1993.
A. Menezes, T. Okamoto, S.A. Vanstone Reducing Elliptic Curve Logarithms to a Finite Field, IEEE Trans. Info. Theory, 39, 1639–1646, 1993.
T. Okamoto, Provable Secure and Practical Identifications and Corresponding Signature Schemes, Proceedings of Crypto’92, LNCS 740, Springer-Verlag 1993, 31–53.
C.P. Schnorr, Efficient Identification and Signatures for Smart Cards, Proceedings of Crypto’89, LNCS 435, Springer-Verlag 1990, 239–252.
J. Silverman, The Arithmetic on Elliptic Curves, Springer-Verlag, New York, 1986.
E. Verheul, Evidence that XTR is More Secure than Supersingular Elliptic Curve Cryptosystems, Proceedings of Eurocrypt 2001, LNCS 2045, Springer-Verlag 2001, 195–210.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Verheul, E.R. (2001). Self-Blindable Credential Certificates from the Weil Pairing. In: Boyd, C. (eds) Advances in Cryptology — ASIACRYPT 2001. ASIACRYPT 2001. Lecture Notes in Computer Science, vol 2248. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45682-1_31
Download citation
DOI: https://doi.org/10.1007/3-540-45682-1_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42987-6
Online ISBN: 978-3-540-45682-7
eBook Packages: Springer Book Archive