Abstract
In this paper we present a new Auto-Recoverable Auto-Certifiable Cryptosystem that is based on an algebraic problem different from the original system (of Eurocrypt’98). Specifically, our new cryptosystem uses generalized ElGamal and RSA. It has the following new advantages: (1) the escrow authority’s key can be set-up much faster than in the original scheme; and (2) It can be used to implement the notion we introduce here of what we call “escrow hierarchy.”
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
D. Boneh, M. Franklin. Efficient Generation of Shared RSA Keys. In Advances in Cryptology—CRYPTO’ 97, 1997. Springer-Verlag.
A. De Santis, Y. Desmedt, Y. Frankel, M. Yung. How to Share a Function Securely. In ACM Symposium on the Theory of Computing, pages 522–533, 1994.
T. ElGamal. A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. In Advances in Cryptology—CRYPTO’ 84, pages 10–18, 1985. Springer-Verlag.
Y. Frankel, M. MacKenzie, M. Yung. Robust Efficient Distrubuted Generation of RSA Keys. In Symposium on Theory of Computing (STOC)’ 98. ACM Press.
A. Fiat, A. Shamir. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In Advances in Cryptology—CRYPTO’ 86, pages 186–194, 1987. Springer-Verlag.
J. Kilian and F.T. Leighton. Fair Cryptosystems Revisited. In Advances in Cryptology—CRYPTO’ 95, pages 208–221, 1995. Springer-Verlag.
S. Micali. Fair Public-Key Cryptosystems. In Advances in Cryptology— CRYPTO’92, pages 113–138, 1992. Springer-Verlag.
R. Rivest, A. Shamir, L. Adleman. A method for obtaining Digital Signatures and Public-Key Cryptosystems. In Communications of the ACM, volume 21, n. 2, pages 120–126, 1978.
E. Verheul, H. van Tilborg. Binding ElGamal: A Fraud-Detectable Alternative to Key-Escrow Proposals. In Advances in Cryptology—Eurocrypt’ 97, pages 119–133, 1997. Springer-Verlag.
A. Young, M. Yung. The Dark Side of Black-Box Cryptography. In Advances in Cryptology—CRYPTO’ 96, pages 89–103, Springer-Verlag.
A. Young, M. Yung. Kleptography: Using Cryptography against Cryptography. In Advances in Cryptology—Eurocrypt’ 97, pages 62–74. Springer-Verlag.
A. Young, M. Yung. The Prevalence of Kleptographic Attacks on Discrete-Log Based Cryptosystems. In Advances in Cryptology—CRYPTO’ 97, Springer-Verlag.
A. Young, M. Yung. Auto-Recoverable and Auto-Certifiable Cryptosystems. In Advances in Cryptology—Eurocrypt’ 98. Springer-Verlag.
A. Young, M. Young. Finding Length-3 Positive Cunningham Chains and their Cryptographic Significance. In Algorithmic Number Theory Symposium III, 1998. Springer-Verlag.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Young, A., Yung, M. (1999). Auto-Recoverable Cryptosystems with Faster Initialization and the Escrow Hierarchy. In: Public Key Cryptography. PKC 1999. Lecture Notes in Computer Science, vol 1560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49162-7_24
Download citation
DOI: https://doi.org/10.1007/3-540-49162-7_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65644-9
Online ISBN: 978-3-540-49162-0
eBook Packages: Springer Book Archive