Abstract
With equitable key escrow the control of society over the individual and the control of the individual over society are shared fairly. In particular, the control is limited to specified time periods. We consider two applications: time controlled key escrow and time controlled auctions with closed bids. In the first the individual cannot be targeted outside the period authorized by the court. In the second the individual cannot withhold his closed bid beyond the bidding period. We propose two protocols, one for each application. We do not require the use of tamper-proof devices.
A part of this research has been supported by NSF Grant NCR-9508528.
Chapter PDF
Similar content being viewed by others
References
Adleman, L.M., McCurley K.S.: Open Problems in Number Theoretic Complexity. In: Johnson, D., Nishizeki, T., Nozaki, A., Wilf, H. (eds): Discrete Algorithms and Complexity, Proceedings of the Japan-US Joint Seminar (Perspective in Computing series, 15. Academic Press Inc., Orlando, Florida (1986) 263–286
Alon, N., Galil, Z., Yung, M.: Efficient dynamic-resharing “verifiable secret sharing” against mobile adversary. In: Spirakis, P.G. (ed.): Algorithms — ESA’ 95, Third Annual European Symposium, Proceedings (Lecture Notes in Computer Science 979). Springer-Verlag (1995) 523–537
Bellare, M., Goldwasser, S.: Verifiable partial key escrow. Proc. 4th ACM Conference on Computer and Communications Security (1997)
Beth, T.: Zur Sicherheit der Informationstechnik. Informatik-Spektrum, 13 (1990) 204–215
Blackburn, S.R., Burmester, M., Desmedt, Y., Wild, P.R.: Efficient multiplicative sharing schemes. In: Maurer, U. (ed.): Advances in Cryptology — Eurocrypt’ 96, Proceedings (Lecture Notes in Computer Science 1070). Springer-Verlag (1996) 107–118
Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo-random number generator. SIAM J. Comput. 15(2) (1986) 364–383
Boyd, C.: Digital multisignatures. In: Beker, H., Piper, F. (eds): Cryptography and coding. Clarendon Press (1989) 241–246
Chaum, D.: Security without identification: transaction systems to make Big Brother obsolete. Commun. ACM, 28(10) (1985) 1030–1044
Chaum, D.: Zero-knowledge undeniable signatures. In: Damgård, I. (ed): Advances in Cryptology, Proc. of Eurocrypt’ 90 (Lecture Notes in Computer Science 473). Springer-Verlag (1991) 458–464
Clipper. A proposed federal information processing standard for an escrowed encryption standard (EES). Federal Register, July 30, 1993.
Denning, D.E., Branstad, D.K.: A taxonomy of key escrow encryption systems. Communications of the ACM, 39(3), (1996) 24–40
Desmedt, Y., Di Crescenzo, G., Burmester, M.: Multiplicative non-abelian sharing schemes and their application to threshold cryptography. In: Pieprzyk, J., Safavi-Naini, R. (eds.): Advances in Cryptology-Asiacrypt’ 94, Proceedings (Lecture Notes in Computer Science 917). Springer-Verlag (1995) 21–32
De Santis, A., Desmedt, Y., Frankel, Y., Yung M.: How to Share a Function Securely. Proceedings of the twenty-sixth annual ACM Symp. Theory of Computing (STOC) (1994) 522–533
Desmedt, Y., Frankel, Y.: Threshold cryptosystems In: Brassard, G. (ed.): Advances in Cryptology-Crypto’ 89, Proceedings (Lecture Notes in Computer Science #435). Springer-Verlag (1990) 307–315
Desmedt, Y.G., Frankel, Y.: Homomorphic zero-knowledge threshold schemes over any finite abelian group. SIAM Journal on Discrete Mathematics 7(4) (1994) 667–679
Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inform. Theory, IT-22(6) (1976) 644–654
Frankel, Y.:. A practical protocol for large group oriented networks. In: Quisquater, J.-J., Vandewalle, J. (eds.): Advances in Cryptology-Eurocrypt’ 89, Proceedings (Lecture Notes in Computer Science #434) Springer-Verlag (1990) 56–61
Frankel, Y., Desmedt, Y.: Parallel reliable threshold multisignature. Tech. Report TR-92-04-02, Dept. of EE & CS, Univ. of Wisconsin-Milwaukee, April 1992. ftp://ftp.cs.uwm.edu/pub/tech reports/desmedt-rsa-threshold 92.ps.
Frankel, Y., Gemmell, P., MacKenzie, P.D., Yung, M.: Proactive RSA. In: Kaliski, B.S. (ed.): Advances in Cryptology-Crypto’ 97, Proceedings (Lecture Notes in Computer Science 1294). Springer-Verlag (1997) 440–454
Frankel, Y., Gemmell, P., Yung, M.: Witness-based cryptographic program checking and robust function sharing. Proceedings of the Twenty-Eighth Annual ACM Symp. on Theory of Computing (1996) 499–508
Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust and efficient sharing of RSA functions. In: Koblitz, N. (ed.): Advances in Cryptology-Crypto’ 96, Proceedings (Lecture Notes in Computer Science 1109). Springer-Verlag (1996) 157–172
Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive secret sharing. In: Coppersmith, D. (ed.): Advances in Cryptology-Crypto’ 95, Proceedings (Lecture Notes in Computer Science #963). Springer-Verlag (1995) 339–352
Kilian, J., Leighton, T.: Failsafe key escrow, revisited. In: Coppersmith, D. (ed.): Advances in Cryptology-Crypto’ 95, Proceedings (Lecture Notes in Computer Science #963). Springer-Verlag (1995) 208–221
Maurer, U.M., Wolf, Y.: Diffie-Hellman Oracles. In:. Kobliz, N. (ed.): Advances in Cryptology-Crypto’ 96, Proceedings (Lecture Notes in Computer Science 1109). Springer-Verlag (1996) 268–282
Micali, S.: Fair public-key cryptosystems. In: Brickell, E.F. (ed.): Advances in Cryptology-Crypto’ 92, Proceedings (Lecture Notes in Computer Science 740). Springer-Verlag (1993) 113–138
Ostrovsky, R., Yung, M.: How to Withstand Mobile Virus Attacks. Proceedings of the 10-th Annual ACM Symp. on Principles of Distributed Computing (1991) 51–60
Pedersen, T.P.: A threshold cryptosystem without a trusted party. In: Davies, D.W. (ed): Advances in Cryptology, Proc. of Eurocrypt’ 91 (Lecture Notes in Computer Science #547). Springer-Verlag (1991) 522–526
Rabin, T.: A simplified approach to threshold and proactive RSA. To appear in the Proceedings of Crypto’ 98.
Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and time-release Crypto. http://theory.lcs.mit.edu/~rivest/publications.html (to appear).
Simmons, G.J., June 22–24, 1994. Observation made at the Workshop on Key Escrow.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Burmester, M., Desmedt, Y., Seberry, J. (1998). Equitable Key Escrow with Limited Time Span (or, How to Enforce Time Expiration Cryptographically) Extended Abstract. In: Ohta, K., Pei, D. (eds) Advances in Cryptology — ASIACRYPT’98. ASIACRYPT 1998. Lecture Notes in Computer Science, vol 1514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49649-1_30
Download citation
DOI: https://doi.org/10.1007/3-540-49649-1_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65109-3
Online ISBN: 978-3-540-49649-6
eBook Packages: Springer Book Archive