Reducing elliptic curve logarithms to logarithms in a finite field
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Relations Among Notions of Security for Public-Key Encryption Schemes
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Key-Insulated Public Key Cryptosystems
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Toward Hierarchical Identity-Based Encryption
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Hierarchical ID-Based Cryptography
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Applications of Multiple Trust Authorities in Pairing Based Cryptosystems
InfraSec '02 Proceedings of the International Conference on Infrastructure Security
Strong Key-Insulated Signature Schemes
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
The HP time vault service: exploiting IBE for timed release of confidential information
WWW '03 Proceedings of the 12th international conference on World Wide Web
Weakly Secret Bit Commitment: Applications to Lotteries and Fair Exchange
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
Time-lock Puzzles and Timed-release Crypto
Time-lock Puzzles and Timed-release Crypto
Encapsulated Key Escrow
Scalable, Server-Passive, User-Anonymous Timed Release Cryptography
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Chosen-Ciphertext Security from Identity-Based Encryption
SIAM Journal on Computing
Security proofs for signature schemes
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Conditional oblivious transfer and timed-release encryption
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Using hash functions as a hedge against chosen ciphertext attack
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Universally convertible directed signatures
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Chosen-ciphertext security of multiple encryption
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Efficient identity-based encryption without random oracles
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Hierarchical identity based encryption with constant size ciphertext
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Efficient and non-interactive timed-release encryption
ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
Timed-release and key-insulated public key encryption
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
Anonymous hierarchical identity-based encryption (without random oracles)
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
A Generic Construction of Timed-Release Encryption with Pre-open Capability
IWSEC '09 Proceedings of the 4th International Workshop on Security: Advances in Information and Computer Security
ProvSec'10 Proceedings of the 4th international conference on Provable security
Efficient generic constructions of timed-release encryption with pre-open capability
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Generic construction of strongly secure timed-release public-key encryption
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
ISC'11 Proceedings of the 14th international conference on Information security
Timed encryption with application to deniable key exchange
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Effort-release public-key encryption from cryptographic puzzles
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Strong security notions for timed-release public-key encryption revisited
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
Information-Theoretic timed-release security: key-agreement, encryption, and authentication codes
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
Time-Specific encryption from forward-secure encryption
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
| Hi-index | 0.00 |
A timed-release cryptosystem allows a sender to encrypt a message so that only the intended recipient can read it only after a specified time. We formalize the concept of a secure timed-release public-key cryptosystem and show that, if a third party is relied upon to guarantee decryption after the specified date, this concept is equivalent to identity-based encryption; this explains the observation that all known constructions use identity-based encryption to achieve timed-release security. We then give several provably-secure constructions of timed-release encryption: a generic scheme based on any identity-based encryption scheme, and two more efficient schemes based on the existence of cryptographically admissible bilinear mappings. The first of these is essentially as efficient as the Boneh-Franklin Identity-Based encryption scheme, and is provably secure and authenticated in the random oracle model; the final scheme is not authenticated but is provably secure in the standard model (i.e., without random oracles).