Abstract
Optimal mail certificates, introduced in[12], are efficient types of implicit certificates which offer many advantages over traditional (explicit) certificates. For example, an optimal mail certificate is small enough to fit on a two-dimensional digital postal mark together with a digital signature. This paper defines a general notion of security for implicit certificates, and proves that optimal mail certificates are secure under this definition.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. Arazi, “An identity-based DL/EC key agreement technique”, Presentation to IEEE P1363a, available from http://grouper.ieee.org/groups/1363/addendum.html
M. Bellare, “ Practice-oriented provable-security”, Proceedings of First International Workshop on Information Security (ISW’97), 1998.
M. Bellare and P. Rogaway, “Random oracles are practical: a paradigm for designing efficient protocols”, 1st ACM Conference on Computer and Communications Security, 1993 pp. 62–73.
D. Brown and D. Johnson, “Formal security proofs for a signature scheme with partial message recovery”, preprint, 2000.
D. Brown, “Implicitly Certifying Signatures Securely”, preprint, 2000.
R. Canetti, O. Goldreich, and S. Halevi, “The Random Oracle Methodology, Revisited (Preliminary Version)”, Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998, pp. 209–218.
M. Girault, “Self-certified public keys”, Advances in Cryptology — Eurocrypt’91, 1991, pp. 490–497.
C.G. Günther, “An identity-based key-exchange protocol”, Advances in Cryptology — Eurocrypt’89, 1989, pp. 29–37.
IEEE P1363a, “Standard Specifications for Public-Key Cryptography: Additional Techniques”, Working Draft, August 16, 2000.
A. Menezes, P. vanOorschot, and S. Vanstone, Handbook of Applied Cryptography, CRC Press, 1996.
K. Nyberg and R. Rueppel, “Message recovery for signature schemes based on the discrete logarithm problem”, Designs, Codes and Cryptography, 7 (1996), pp. 61–81.
L. Pintsov and S. Vanstone, “Postal Revenue Collection in the Digital Age”, Proceedings of Financial Cryptography 2000, to appear.
D. Pointcheval and J. Stern, “Security proofs for signature schemes”, Advances in Cryptology — Eurocrypt’96, 1996, pp. 387–398.
D. Pointcheval, J. Stern, “Security arguments proofs for Digital Signatures and Blind Signatures”, Journal of Cryptology, 2000, pp. 361–396.
M. Qu and S. Vanstone, “Implicit Certificate Schemes”, preprint, 1997.
C. Schnorr, “Efficient signature generation by smart cards”, Journal of Cryptology, 4 (1991), pp. 161–174.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brown, D.R.L., Gallant, R., Vanstone, S.A. (2002). Provably Secure Implicit Certificate Schemes. In: Syverson, P. (eds) Financial Cryptography. FC 2001. Lecture Notes in Computer Science, vol 2339. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46088-8_15
Download citation
DOI: https://doi.org/10.1007/3-540-46088-8_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44079-6
Online ISBN: 978-3-540-46088-6
eBook Packages: Springer Book Archive