Increasing efficiency of international key escrow in mutually mistrusting domains

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1355, Issue , 1997, Pages 221-232

  Martin, Keith M ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

COMMUNICATION DOMAIN; DIFFERENT PROTOCOLS; INTERNATIONAL COMMUNICATION; KEY ESCROW; TRUSTED THIRD PARTIES;

EFFICIENCY;

EID: 21944452447     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0024467     Document Type: Conference Paper

References (16)

1. J. Benaloil. Secret sharing homomorphisms: keeping shares of a secret secret. Adv. in Cryptology - CRYPTO’86, Lecture Notes in Comput. Sci, 263 (1987) 251-260.
2. G. R. Blakley. Safeguarding cryptographic keys. Proceedings of AFIPS 1979 National Computer Conference, 48 (1979) 313-317.
3. E. F. Brickell, Some ideal secret sharing schemes. J. Combin. Math. Combin. Comput, 9 (1989) 105-113.
4. 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.
5. D.E. Denning and D.K. Branstad. A taxonomy for key escrow encryption systems. Communications of the ACM, 39(3) (1996) 34-40.
6. Y. G. Desmedt and Y. Frankel. Homomorphic zero-knowledge threshold schemes over any finite abelian group. SIAM J. Disc. Math., 4 (1994) 667-679.
7. W. Diffie and M. Heilman. New directions in cryptography. IEEE Transactions on Information Theory, 22 (1976) 644-654.
8. M. van Dijk, On the information rate of perfect secret sharing schemes, Des. Codes Cryptogr., 6 (1995) 143-169.
9. 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.
10. 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 - EURO-CRYPT’90, Lecture Notes in Comput. Sci., 473 (1991) 266-282.
11. W.-A. Jackson, K.M. Martin and C.M. O’Keefe. Mutually Trusted Authority free Secret Sharing Schemes. J. Cryptology, to appear.
12. 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.
13. N. Jefferies, C. Mitchell and M. Walker. Practical solutions to key escrow and regulatory aspects. Proceedings of Public Key Solutions '96, Zurich, September 1996.
14. S. Micali. Fair cryptosystems. MIT Technical Report, MIT/LCS/TR-579.C, (1994).
15. A. Shamir. How to share a secret. Comm. ACM, 22(11) (1979) 612-613.
16. G. J. Simmons, W.-A. Jackson, and K. Martin. The geometry of shared secret schemes. Bull. Inst. Combin. Appl., 1 (1991) 71-88.