Abstract
We propose a new key recovery system with satisfying the following properties:
-
1.
The court-authorized eavesdropping by the investigator is limited both in tapping time and in tapped conversation.
-
2.
Trustees, who are cooperating with the investigator to eavesdrop a user's communication, cannot know whom the investigator is intercepting.
-
3.
No investigator can obtain illegally the secret key of users against which no legitimate court order has been issued.
Our system utilizes the blind decoding: a client has a message encrypted with a server's secret key and the client asks the server to decode the message without revealing what is the decoded plaintext nor learning the server's secret key. Our system also introduces two agencies besides the trustees. These are related to the mechanism of registering users and of distributing the user's escrowed keys, named “Key Producer,” and “Registration Center.“ Our system can be implemented by using only the discrete-log based cryptosystems (the Diffie-Hellman and the ElGamal).
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.J.Anderson and R.Needham, “Robustness principles for public key protocols,” Proc. CRYPTO'95, pp.236–247 (1996).
E. F. Brickell, D. E. Denning, S. T. Kent, D. P. Maher, W. Tuchman, “SKIPJACK Review Interim Report,” July 28 (1993).
E. F. Brickell, P. Gemmell, and D. Kravitz, “Trustee-based tracing extensions to anonymous cash and the making of anonymous change“ Proc. SODA'95. pp.457–466 (1995).
D. M. Balenson, C. M. Ellison, S. B. Lipner, S. T. Walker, “A New Approach to Software Key Escrow Encryption,” Trusted Information Systems, Inc., (1994). (also in [Hof95]).
T. Beth, H. J. Knobloch, M. Otten, G. J. Simmons, P. Wichmann, “Towards Acceptable Key Escrow Systems,” Proc. of The 2nd ACM Conf. on Computer and Communications Security, pp.51–58 (1994).
M. Blaze, “Protocol Failure in the Escrowed Encryption Standard,” In the Proceedings of The 2nd ACM Conference on Computer and Communications Security, November 1994,59–67. (also in [Hof95]) August 20, (1994).
D. Chaum, B. den Boer, E. van Heyst, S. Mjolsners, A. Steenbeek, “Efficient Offline Electronic Checks, Advances in Cryptology, Eurocrypt '89, LNCS 434, Springer Verlag, pp.294–301.
D. Chaum, “Blind Signatures for untraceable payments,” Advances in Cryptology Proceedings of Crypto '82, (1983).
D. Chaum and T. Pederson, “Wallet databases with observers,” Advances in Cryptology — CRYPTO'92, (1993) pp.89–105.
J. L. Camenisch, J.-M. Piveteau, M. A. Stadler, “Blind signatures Based on the Discrete Logarithm Problem,” Advances in Cryptology — EUROCRYPT '94, (1994).
D. Chaum, H. van Antwerpen, “Undeniable Signatures,” Advances in Cryptology-CRYPTO '89, (1989).
Diffie, W. and Hellman, M.E., “New Directions in Cryptography,” IEEE Trans. Inf. Theory, IT-22, 6, pp.644–654 (1976).
Diffie, W. presented in Proc. of E.I.S.S. Workshop on Escrowed-Key Cryptography Edi. by Beth and Otten (1994).
D. E. Denning, M. Smid, “Key Escrowing Today,” IEEE Communications Magazine, Vol.32, No.9 (Sept.1994), pp.58–68.
T. ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms,” IEEE Trans. on IT, 31, pp.469–472 (1985).
P.Feldman, “A practical scheme for non-interactive verifiable secret sharing,” Proc. IEEE FOCS97 pp.427–437.
Y.Frankel, and M.Yung, “Escrow Encryption Systems Visited: Attacks, Analysis, and Designs,” Advances in Cryptology-CRYPTO '95, (1995).
P. Horster, M. Michels, H. Peterson, “A new key escrow system with active investigator,” Technical Report, TR-95-4-F, University of Technology Chemnitz-Zwickau, April 18, (1995).
L. J. Hoffman ed, Building in Big Brothers: the cryptographic policy debate, Springer Verlag, (1995).
N. Koblitz, “Elliptic curve cryptosystems,” Math. Comp., vol.48, No.177, pp.203–209 (1987).
A.K.Lenstra, P.Winkler, Y.Yacobi, “A key escrow system with warrant bounds,” Advances in Cryptology-CRYPTO '95, (1995), pp.197–207.
M.Mambo, E.Okamoto, and K.Sakurai, “How to utilize the transformability of digital signatures for solving the oracle problem,” Advances in Cryptology-ASIACRTPT '96, (1996), pp.322–333.
S. Micali, “Fair public key cryptosystems,” Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, Mass.; MIT/ LCS/ TR-579.b; November (1993). (also in [Hof95])
V. S. Miller, “Use of elliptic curves in cryptography,” Proc. of CRYPTO'85, pp. 417–426 (1985).
T.P.Pedersen, “Distributed Provers with Applications to Undeniable Signatures,” Advances in Cryptology-EUROCRYPT'91, pp.221–242, (1991).
R. L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public key cryptosystems,” Comm. ACM, 21, pp.120–126 (1978).
Y. Sameshima, “A Key Escrow System of the RSA cryptosystem,” PreProceedings of 1997 Information Security Workshop, pp. 75–85 (1997).
A. Shamir, L. Rivest, and L. Adleman, “Mental Poker,” MIT/LCS, TM-125 (1979).
K.Sakurai, and Y.Yamane, “Blind decoding, blind undeniable signatures, and their applications to privacy protection,” Proc. 1st Information Hiding Workshop, Cambridge, U.K. Springer LNCS 1174 (1996), pp.257–264.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sakuraii, K., Yamane, Y., Miyazaki, S., Inoue, T. (1998). A key escrow system with protecting user's privacy by blind decoding. In: Okamoto, E., Davida, G., Mambo, M. (eds) Information Security. ISW 1997. Lecture Notes in Computer Science, vol 1396. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030417
Download citation
DOI: https://doi.org/10.1007/BFb0030417
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64382-1
Online ISBN: 978-3-540-69767-1
eBook Packages: Springer Book Archive