Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Secure Integration of Asymmetric and Symmetric Encryption Schemes
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Key-Privacy in Public-Key Encryption
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Proxy re-signatures: new definitions, algorithms, and applications
Proceedings of the 12th ACM conference on Computer and communications security
Towards a secure and interoperable DRM architecture
Proceedings of the ACM workshop on Digital rights management
Chosen-ciphertext secure proxy re-encryption
Proceedings of the 14th ACM conference on Computer and communications security
Conditional Privacy Using Re-encryption
NPC '08 Proceedings of the 2008 IFIP International Conference on Network and Parallel Computing
Securely obfuscating re-encryption
TCC'07 Proceedings of the 4th conference on Theory of cryptography
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
From proxy encryption primitives to a deployable secure-mailing-list solution
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
Multi-use and unidirectional identity-based proxy re-encryption schemes
Information Sciences: an International Journal
New identity-based proxy re-encryption schemes to prevent collusion attacks
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Hybrid proxy re-encryption scheme for attribute-based encryption
Inscrypt'09 Proceedings of the 5th international conference on Information security and cryptology
EuroPKI'10 Proceedings of the 7th European conference on Public key infrastructures, services and applications
Efficient bidirectional proxy re-encryption with direct chosen-ciphertext security
Computers & Mathematics with Applications
Achieving key privacy without losing CCA security in proxy re-encryption
Journal of Systems and Software
CCA proxy re-encryption without bilinear maps in the standard model
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Efficient unidirectional proxy re-encryption
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Security and Communication Networks
Privacy preserving protocol for service aggregation in cloud computing
Software—Practice & Experience
Efficient privacy preserving content based publish subscribe systems
Proceedings of the 17th ACM symposium on Access Control Models and Technologies
An efficient and secure data sharing framework using homomorphic encryption in the cloud
Proceedings of the 1st International Workshop on Cloud Intelligence
Anonymous ID-based proxy re-encryption
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Identity-based data storage in cloud computing
Future Generation Computer Systems
Proxy re-encryption in a stronger security model extended from CT-RSA2012
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
Proceedings of the ACM International Conference on Computing Frontiers
| Hi-index | 0.00 |
Proxy re-encryption (PRE) allows a proxy to convert a ciphertext encrypted under one key into an encryption of the same message under another key. The main idea is to place as little trust and reveal as little information to the proxy as necessary to allow it to perform its translations. At the very least, the proxy should not be able to learn the keys of the participants or the content of the messages it re-encrypts. However, in all prior PRE schemes, it is easy for the proxy to determine between which participants a re-encryption key can transform ciphertexts. This can be a problem in practice. For example, in a secure distributed file system, content owners may want to use the proxy to help re-encrypt sensitive information without revealing to the proxy the identity of the recipients. In this work, we propose key-private (or anonymous) re-encryption keys as an additional useful property of PRE schemes. We formulate a definition of what it means for a PRE scheme to be secure and key-private. Surprisingly, we show that this property is not captured by prior definitions or achieved by prior schemes, including even the secure obfuscation of PRE by Hohenberger et al. (TCC 2007). Finally, we propose the first key-private PRE construction and prove its CPA-security under a simple extension of Decisional Bilinear Diffie Hellman assumption and its key-privacy under the Decision Linear assumption in the standard model.