Abstract
This paper is concerned with key escrow protocols for use in international communications environments, where communication domains do not necessarily trust one another. It is concerned particularly with systems where users place their trust collectively with groups of trusted third parties. We consider two different protocols, discuss and improve their efficiency and generalise the type of key splitting.
Supported by the European Commission under ACTS project AC095 (ASPeCT)
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Benaloh. Secret sharing homomorphisms: keeping shares of a secret secret. Adv. in Cryptology-CRYPTO'86, Lecture Notes in Cornput. Sci, 263 (1987) 251–260.
G. R. Blakley. Safeguarding cryptographic keys. Proceedings of AFIPS 1979 National Computer Conference, 48 (1979) 313–317.
E. F. Brickell. Some ideal secret sharing schemes. J. Combin. Math. Combin. Comput., 9 (1989) 105–113.
L. Chen, D. Gollmann and C.J. Mitchell. Key escrow in mutually mistrusting domains. Proceedings of 1996 Cambridge Workshop on Security Protocols, Lecture Notes in Comput. Sci., 1189 (1997) 139–153.
D.E. Denning and D.K. Branstad. A taxonomy for key escrow encryption systems. Communications of the ACM, 39(3) (1996) 34–40.
Y. G. Desmedt and Y. Frankel. Homomorphic zero-knowledge threshold schemes over any finite abelian group. SIAM J. Disc. Math., 4 (1994) 667–679.
W. Diffie and M. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, 22 (1976) 644–654.
M. van Dijk, On the information rate of perfect secret sharing schemes, Des. Codes Cryptogr., 6 (1995) 143–169.
Y. Frankel and Y. Desmedt. Classification of ideal homomorphic threshold schemes over finite Abelian groups. Adv. in Cryptology-EUROCRYPT'92, Lecture Notes in Comput. Sci., 658 (1992) 25–34.
I. Ingemarsson and G. J. Simmons. A protocol to set up shared secret schemes without the assistance of a mutually trusted party. Adv. in Cryptology-EUROCRYPT'90, Lecture Notes in Comput. Sci., 473 (1991) 266–282.
W.-A. Jackson, K.M. Martin and C.M. O'Keefe. Mutually Trusted Authority free Secret Sharing Schemes. J. Cryptology, to appear.
N. Jefferies, C. Mitchell and M. Walker. A proposed architecture for trusted third party services. Cryptography: Policy and Algorithms, Lecture Notes in Comput. Sci., 1029 (1996) 98–104.
N. Jefferies, C. Mitchell and M. Walker. Practical solutions to key escrow and regulatory aspects. Proceedings of Public Key Solutions '96, Zurich, September 1996.
S. Micali. Fair cryptosystems. MIT Technical Report, MIT/LCS/TR-579.c, (1994).
A. Shamir. How to share a secret. Comm. ACM, 22(11) (1979) 612–613.
G. J. Simmons, W.-A. Jackson, and K. Martin. The geometry of shared secret schemes. Bull. Inst. Combin. Appl., 1 (1991) 71–88.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martin, K.M. (1997). Increasing efficiency of International key escrow in mutually mistrusting domains. In: Darnell, M. (eds) Crytography and Coding. Cryptography and Coding 1997. Lecture Notes in Computer Science, vol 1355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024467
Download citation
DOI: https://doi.org/10.1007/BFb0024467
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63927-5
Online ISBN: 978-3-540-69668-1
eBook Packages: Springer Book Archive