Collision-Resistant Hashing: Towards Making UOWHFs Practical
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Provably Secure Timed-Release Public Key Encryption
ACM Transactions on Information and System Security (TISSEC)
Efficient Public Key Encryption with Keyword Search Schemes from Pairings
Information Security and Cryptology
Off-Line Keyword Guessing Attacks on Recent Public Key Encryption with Keyword Search Schemes
ATC '08 Proceedings of the 5th international conference on Autonomic and Trusted Computing
Public Key Encryption with Keyword Search Revisited
ICCSA '08 Proceeding sof the international conference on Computational Science and Its Applications, Part I
Constructing PEKS schemes secure against keyword guessing attacks is possible?
Computer Communications
Improved searchable public key encryption with designated tester
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
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
A Secure Channel Free Public Key Encryption with Keyword Search Scheme without Random Oracle
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
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
Two-tier signatures, strongly unforgeable signatures, and Fiat-Shamir without random oracles
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Decryptable searchable encryption
ProvSec'07 Proceedings of the 1st international conference on Provable security
Public key encryption with keyword search based on K-resilient IBE
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Searching keywords with wildcards on encrypted data
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
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
Efficient and non-interactive timed-release encryption
ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
Chosen-Ciphertext security from tag-based encryption
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Revisiting the security model for timed-release encryption with pre-open capability
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 |
As well-known results, timed-release encryption (TRE) and public key encryption scheme with keyword search (PEKS) are very close to identity-based encryption (IBE), respectively. It seems natural that there is a close relationship between TRE and PEKS. However, no explicit bridge has been shown between TRE and PEKS so far. In this paper, we show that TRE can be generically constructed by PEKS with extended functionalities, called secure-channel free PEKS (SCF-PEKS) with adaptive security, and discuss the reason why PEKS and (nonadaptive) SCF-PEKS are not suitable for constructing TRE. In addition to this result, we also show that adaptive SCF-PEKS can be generically constructed by anonymous IBE only. That is, for constructing adaptive SCF-PEKS we do not have to require any additional cryptographic primitive compared to the Abdalla et al. PEKS construction (J. Cryptology 2008), even though adaptive SCF-PEKS requires additional functionalities. This result seems also independently interesting.