Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Optimal efficiency of optimistic contract signing
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st 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
Short Signatures from the Weil Pairing
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Simple and fast optimistic protocols for fair electronic exchange
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Time-lock Puzzles and Timed-release Crypto
Time-lock Puzzles and Timed-release Crypto
Verifiable encryption of digital signatures and applications
ACM Transactions on Information and System Security (TISSEC)
Conditional oblivious transfer and timed-release encryption
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Optimistic fair exchange of digital signatures
IEEE Journal on Selected Areas in Communications
General Certificateless Encryption and Timed-Release Encryption
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Timed-Release Encryption Revisited
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
Anonymous Fingerprinting for Predelivery of Contents
Information Security and Cryptology --- ICISC 2008
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
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Timed-ephemerizer: make assured data appear and disappear
EuroPKI'09 Proceedings of the 6th European conference on Public key infrastructures, services and applications
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
Efficient and non-interactive timed-release encryption
ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
A timed-release key management scheme for backward recovery
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
Strong security notions for timed-release public-key encryption revisited
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
Improved anonymous timed-release encryption
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Revisiting the security model for timed-release encryption with pre-open capability
ISC'07 Proceedings of the 10th international conference on Information Security
Token-controlled public key encryption in the standard model
ISC'07 Proceedings of the 10th international conference on Information 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 |
We propose timed-release encryption with pre-open capability. In this model, the sender chooses a release time to open the message and a release key to pre-open, and encrypts the message using them. The receiver can decrypt the message only after the release time. When the sender wants the message to be opened before the release time, he may publish the release key. Then, the receiver can decrypt the message from his private key and the release key before the release time. However, an adversary cannot extract any information at any time even with the release key. We formalize the security model and provide an efficient construction secure under the BDH assumption in the random oracle model. In addition, we discuss the application of our schemes to efficient fair exchange systems such as a certified e-mail system.