Abstract
In this paper, we study two basic protocols which are important in realizing TTP-based key escrow systems. A TTP-based key escrow system was studied in [3] under the scenario of multiple domains (e.g., countries), where a protocol based on verifiable secret sharing scheme was proposed to transfer a shared secret from one set of TTPs to another set of TTPs. However, the protocol only allows one step transfer, i.e., transfer a shared secret from set A to set B, but the same shared secret can not be further transferred from B to any other set. Our first protocol improves the protocol in [3] to allow multiple step transfers. The problem of subliminal channel in key escrow was studied in [10] and
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Anderson and M. Roe, “The GCHQ protocol and its problems”, manuscript, available at ftp://ftp.cl.cam.ac.Uk/users/rja14/euroclipper.ps.Z, 15 pages, 1996.
F. Bao, R. Deng. Y. Han and T. Ngair, “Proactive secret sharing revisited”, manuscript, 15 pages, 1996.
L. Chen, D. Gollmann and C. Mitchell, “Key Escrow in mutually mistrusting domains”, Proc. of 1996 Cambridge Workshop on Secure Protocols, LNCS, Springer-Verlag, 8 pages, 1996.
L. Chen and C. Mitchell, “Key Escrow in multiple domains”, manuscript, 10 pages, 1996.
D. Denning, “Description of Key Escrow Systemsℰd, manuscript, available at http://www.wsc.georgetown.edu/denning/crypto/application, 34 pages, 1996.
D. Denning and D. Branstad, “A taxonomy for key escrow encryption system”, Communications of the ACM, Vol. 39, No. 3, pp. 34–40, 1996.
P. Feldman, “A practical scheme for non-interactive verifiable secret sharing”, Proceedings of the 28th FOCS, pp. 427–437, 1987.
Y. Frankel and M. Yung, “Escrow encryption systems visited: attacks, analysis and designs”, LNCS 963, Advances in Cryptology-CRYPTO'95, Springer-Verlag, pp. 222–235, 1995.
N. Jefferies, C. Mitchell and M. Walker, “A proposed architecture for trusted third party services”, LNCS 1029, Cryptography: Policy and Algorithms Conference, Springer-Verlag, pp. 98–104, 1996.
J. Kilian and T. Leighton, “Fair cryptosystems revisited”, LNCS 963, Advances in Cryptology-CRYPTO'95, Springer-Verlag, pp. 208–221, 1995.
D. P. Maher, “Crypto backup and key escrow”, Communications of the ACM, Vol. 39, No. 3, pp. 48–53, 1996.
S. Micali, “Fair public-key cryptosystem”, Technical Report 579, MIT, 1993
S. Micali and R. Sidney, “A simple method for generating and sharing pseudorandom functions, with applications to Clipper-like key escrow systems”, LNCS 963, Advances in Cryptology-CRYPTO'95, Springer-Verlag, pp. 183–196, 1995.
C. Mitchell, “The Royal Holloway TTP-based key escrow scheme”, manuscript, available at ftp://ftp.dcs.rhbnc.ac.uk/pub/Chris.Mitchell/istr_a2.ps, 7 pages, 1996.
T. P. Pedersen, “Non-interactive and information-theoretic secure verifiable secret sharing”, Proceedings of Crypto'91, LNCS 547, pp. 363–372.
A. Shamir, “How to share a secret”, CACM, Vol. 22, No. 11, pp. 612–613, 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bao, F., Deng, R., Han, Y., Jeng, A. (1997). Design and analyses of two basic protocols for use in TTP-based Key escrow. In: Varadharajan, V., Pieprzyk, J., Mu, Y. (eds) Information Security and Privacy. ACISP 1997. Lecture Notes in Computer Science, vol 1270. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027933
Download citation
DOI: https://doi.org/10.1007/BFb0027933
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63232-0
Online ISBN: 978-3-540-69237-9
eBook Packages: Springer Book Archive