Identity-Based Encryption from the Weil Pairing
SIAM Journal on Computing
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
On the Security of Joint Signature and Encryption
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Time-lock Puzzles and Timed-release Crypto
Time-lock Puzzles and Timed-release Crypto
Scalable, Server-Passive, User-Anonymous Timed Release Cryptography
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Direct chosen ciphertext security from identity-based techniques
Proceedings of the 12th ACM conference on Computer and communications security
Proceedings of the 14th ACM conference on Computer and communications security
Provably Secure Timed-Release Public Key Encryption
ACM Transactions on Information and System Security (TISSEC)
Tag-KEM/DEM: A New Framework for Hybrid Encryption
Journal of Cryptology
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
Compact CCA-Secure Encryption for Messages of Arbitrary Length
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in 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
Efficient hybrid encryption from ID-based encryption
Designs, Codes and Cryptography
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Efficient identity-based encryption without random oracles
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Timed-release encryption with pre-open capability and its application to certified e-mail system
ISC'05 Proceedings of the 8th international conference on Information Security
Efficient and non-interactive timed-release encryption
ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
Practical identity-based encryption without random oracles
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Tag-KEM from set partial domain one-way permutations
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Revisiting the security model for timed-release encryption with pre-open capability
ISC'07 Proceedings of the 10th international conference on Information Security
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
Strong security notions for timed-release public-key encryption revisited
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
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 |
Timed-release encryption with pre-open capability (TRE-PC), introduced by Hwang et al. in 2005, is a cryptosystem with which a sender can make a ciphertext so that a receiver can decrypt it by using a timed-release key provided from a trusted time-server, or by using a special information called pre-open key provided from the sender before the release-time, and thus adds flexibility to ordinary TRE schemes in many practical situations. Recently, Nakai et al. proposed a generic construction of a TRE-PC scheme from a public-key encryption scheme, an identity-based encryption scheme (with some special property), and a signature scheme. Concrete TRE-PC schemes derived via their generic construction are, however, not so practical because of the used building block primitives. Motivated by this situation, in this paper we propose two new generic constructions of TRE-PC schemes. Both of our constructions follow the basic idea behind the generic construction by Nakai et al. but overcome its inefficiency without losing "generality" for the used building block primitives. Concrete TRE-PC schemes derived from our generic constructions are comparable to or more efficient than the currently known TRE-PC schemes in terms of ciphertext overhead size and computation costs.