The random oracle methodology, revisited (preliminary version)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Chosen-ciphertext secure proxy re-encryption
Proceedings of the 14th ACM conference on Computer and communications security
Identity-Based Proxy Re-encryption
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Public Key Encryption with Keyword Search Revisited
ICCSA '08 Proceeding sof the international conference on Computational Science and Its Applications, Part I
Chosen-Ciphertext Secure Proxy Re-encryption without Pairings
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
CCA-Secure Proxy Re-encryption without Pairings
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Conditional proxy re-encryption secure against chosen-ciphertext attack
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
CCA2 secure IBE: standard model efficiency through authenticated symmetric encryption
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
Unidirectional chosen-ciphertext secure proxy re-encryption
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
A verifiable random function with short proofs and keys
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Practical identity-based encryption without random oracles
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Identity-based proxy re-encryption without random oracles
ISC'07 Proceedings of the 10th international conference on Information Security
EuroPKI'10 Proceedings of the 7th European conference on Public key infrastructures, services and applications
Interactive conditional proxy re-encryption with fine grain policy
Journal of Systems and Software
Efficient bidirectional proxy re-encryption with direct chosen-ciphertext security
Computers & Mathematics with Applications
Further observation on proxy re-encryption with keyword search
Journal of Systems and Software
Hierarchical conditional proxy re-encryption
Computer Standards & Interfaces
Anonymous ID-based proxy re-encryption
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Chosen-ciphertext secure anonymous conditional proxy re-encryption with keyword search
Theoretical Computer Science
Proxy-invisible CCA-secure type-based proxy re-encryption without random oracles
Theoretical Computer Science
| Hi-index | 0.00 |
A proxy re-encryption scheme enables a proxy to re-encrypt a ciphertext under a delegator's public-key and designate it to a delegatee. Weng et al. introduced the notion of conditional proxy re-encryption (or C-PRE, for short), whereby only the ciphertext satisfying one condition set by the delegator can be transformed by the proxy and then decrypted by delegatee. Nonetheless, they left an open problem on how to construct CCA-secure C-PRE schemes with anonymity. In this paper, we first formalize the notion of anonymous condition CCA-secure PRE and present a respective security model. Then, we answer the question posed by Weng et al. affirmatively by presenting a new and efficient construction of anonymous conditional proxy re-encryption (C-PRE) scheme without requiring random oracle.