Abstract
Limiting escrow activity in time has been an important requirement for key escrow systems. Recently two protocols were proposed for limited time span key escrow and contract bidding. We investigate the proposed protocols, bring out certain issues that were neglected in the proposal and amend it in a manner that these issues will be dealt with. Our proposal does not require tamper proofness for security of the system and assumes minimal trust in the trustees of the system to achieve a more robust scheme. The importance of publicly verifiable proofs is highlighted in this paper.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. Asokan, Victor Shoup, and Michael Waidner. Optimistic fair exchange of digital signatures. In Advances in Cryptology-EUROCRYPT’98, pages 591–606, 1998.
M. Bellare and P. Rogaway. Optimal asymmetric encryption. In Advances of Cryptology-CRYPTO’94, pages 92–111, 1994.
Mihir Bellare and Shafi Goldwasser. Verifiable partial key escrow. In Proceedings of the Fourth Annual Conference on Computer and Communications Security, ACM, 1996.
Colin Boyd. Enforcing traceability in software. In Information and Communication Security-First International Conference, ICICS’97, pages 398–408. Springer, 1997.
Mike Burmester, Yvo Desmedt, and Jennifer Seberry. Equitable key escrow with limited time span. In Advances in Cryptology-ASIACRYPT’98, Lecture Notes in Computer Science, pages 380–391. Springer-Verlag, 1998.
Aymeric de Solages and Jacques Traoré. An efficient fair off-line electronic cash system with extensions to checks and wallets with observers. In Financial Cryptography’ 98, pages 1–15, 1998.
Jingmin He and Ed Dawson. A new key escrow cryptosystem. In Josef Pieprzyk and Jennifer Seberry, editors, Information Security and Privacy, ACISP’96, Lecture Notes in Computer Science, pages 105–114. Springer-Verlag, 1996.
D. E. Knuth. The Art of Computer Programming-Sorting and Searching, volume 3. Addison-Wesley, Massachusetts, 1973.
Arjen K. Lenstra, Peter Winkler, and Yacov Yacobi. A key escrow system with warrant bounds. In Advances in Cryptology-CRYPTO95, Lecture Notes in Computer Science, pages 197–207, 1995.
Wenbo Mao. Publicly verifiable partial key escrow. In Yongfei Han, Tatsuaki Okamoto, and Sihang Qing, editors, Information and Communications Security, Lecture Notes in Computer Science, pages 409–413. Springer-Verlag, 1997.
T. Pedersen. Non-interactive and information theoretic secure verifiable secret sharing. In J. Feigenbaum, editor, Advances in Cryptology-CRYPTO’91, Lecture Notes in Computer Science. Springer-Verlag, 1991.
Markus Stadler. Publicly verifiable secret sharing. In Ueli Maurer, editor, Advances in Cryptology-EUROCRYPT’96, Lecture Notes in Computer Science, pages 190–199. Springer-Verlag, 1996.
U.S. DEPARTMENT OF COMMERCE / National Institute of Standards and Technology. Federal Information Processing Standard 185—Escrowed Encryption Standard, February 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Viswanathan, K., Boyd, C., Dawson, E. (1999). Publicly Verifiable Key Escrow with Limited Time Span. In: Pieprzyk, J., Safavi-Naini, R., Seberry, J. (eds) Information Security and Privacy. ACISP 1999. Lecture Notes in Computer Science, vol 1587. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48970-3_4
Download citation
DOI: https://doi.org/10.1007/3-540-48970-3_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65756-9
Online ISBN: 978-3-540-48970-2
eBook Packages: Springer Book Archive