Abstract
We consider the problem of sending messages “into the future.” Previous constructions for this task were either based on heuristic assumptions or did not provide anonymity to the sender of the message. In the public-key setting, we present an efficient and secure timed-release encryption scheme using a “time server” which inputs the current time into the system. The server has to only interact with the receiver and never learns the sender’s identity. The scheme’s computational and communicational cost per request are only logarithmic in the time parameter. The construction of our scheme is based on a novel cryptographic primitive: a variant of oblivious transfer which we call conditional oblivious transfer. We define this primitive (which may be of independent interest) and show an efficient construction for an instance of this new primitive based on the quadratic residuosity assumption.
Chapter PDF
References
E. Bach and J. Shallit, Algorithmic Number Theory, MIT Press, 1996.
M. Bellare and S. Goldwasser, Encapsulated Key-Escrow, MIT Tech. Report 688, April 1996.
G. Brassard, C. Crépeau, and J.-M. Robert, Information Theoretic Reductions among Disclosure Problems, in Proc. of FOCS 86.
M. Ben-or, S. Goldwasser, and A. Wigderson, Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation, in Proc. of STOC 88.
M. Blum, A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge, SIAM Journal of Computing, vol. 20, no. 6, Dec 1991, pp. 1084–1118.
M. Blum, P. Feldman, and S. Micali, Non-Interactive Zero-Knowledge and Applications, in Proc. of STOC 88.
R. Cramer and V. Shoup, A Practical Cryptosystem Provably Secure under Chosen Ciphertext Attack, in Proc. of CRYPTO 98.
C. Crépeau, Equivalence between Two Flavors of Oblivious Transfer, in Proc. of CRYPTO 87.
C. Crépeau and J. Kilian, Achieving Oblivious Transfer Using Weakened Security Assumptions, in Proc. of FOCS 1988.
D. Chaum, C. Crepeau, and I. Damgard, Multiparty Unconditionally Secure Protocols, in Proc. of STOC 88.
A. De Santis, G. Di Crescenzo, and G. Persiano, The Knowledge Complexity of Quadratic Residuosity Languages, Theoretical Computer Science, vol. 132, (1994), pp. 291–317.
A. De Santis, G. Di Crescenzo, and G. Persiano, Zero-Knowledge Arguments and Public-Key Cryptography, Information and Computation, vol. 121, (1995), pp. 23–40.
A. De Santis and G. Persiano, Public Randomness in Public-Key Cryptography, in Proc. of EUROCRYPT 92.
D. Dolev, C. Dwork, and M. Naor, Non-Malleable Cryptography, in Proc. of STOC 91.
S. Even, O. Goldreich and A. Lempel, A Randomized Protocol for Signing Contracts, Communications of ACM, vol. 28, 1985, pp. 637–647.
O. Goldreich, Secure Multi-Party Computation, 1998. First draft available at http://theory.lcs.mit.edu/∼oded
O. Goldreich, S. Micali, and A. Wigderson, How to Play any Mental Game, in Proc. of STOC 87.
S. Goldwasser and S. Micali, Probabilistic Encryption, in Journal of Computer and System Sciences. vol. 28 (1984), n. 2, pp. 270–299.
J. Kilian, Basing Cryptography on Oblivious Transfer, in Proc. of STOC 88.
J. Kilian, S. Micali and R. Ostrovsky Minimum-Resource Zero-Knowledge Proofs, in Proc. of FOCS 89.
E. Kushilevitz, S. Micali, and R. Ostrovsky, Reducibility and Completeness in Multi-Party Private Computations, Proc. of FOCS 94 (full version joint with J. Kilian to appear in SICOMP).
T. May, Timed-Release Crypto, Manuscript.
R.C. Merkle, Secure Communications over insecure channels Communications of the ACM, 21:291–299, April 1978.
R. Ostrovsky and B. Patt-Shamir, Optimal and Efficient Clock Synchronization Under Drifting Clocks, in Proc. of PODC 99, to appear.
R. Ostrovsky, R. Venkatesan, and M. Yung, Fair Games Against an All-Powerful Adversary, in Proc. of SEQUENCES 91, Positano, Italy. Final version in AMS DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 13, pp. 155–169, 1993.
M. Rabin, How to Exchange Secrets by Oblivious Transfer, TR-81 Aiken Computation Laboratory, Harvard, 1981.
R. Rivest, A. Shamir, and D. Wagner, Time-Lock Puzzles and Timed-Release Crypto, manuscript at http://theory.lcs.mit.edu/ rivest.
A.C. Yao, Protocols for Secure Computations, in Proc. of FOCS 82.
A.C. Yao, How to Generate and Exchange Secrets, in Proc. of FOCS 86.
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
Di Crescenzo, G., Ostrovsky, R., Rajagopalan, S. (1999). Conditional Oblivious Transfer and Timed-Release Encryption. In: Stern, J. (eds) Advances in Cryptology — EUROCRYPT ’99. EUROCRYPT 1999. Lecture Notes in Computer Science, vol 1592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48910-X_6
Download citation
DOI: https://doi.org/10.1007/3-540-48910-X_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65889-4
Online ISBN: 978-3-540-48910-8
eBook Packages: Springer Book Archive