A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Efficient Identification and Signatures for Smart Cards
CRYPTO '89 Proceedings of the 9th 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
On Quorum Controlled Asymmetric Proxy Re-encryption
PKC '99 Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography
Improved proxy re-encryption schemes with applications to secure distributed storage
ACM Transactions on Information and System Security (TISSEC)
Identity-Based Proxy Re-encryption
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Type-Based Proxy Re-encryption and Its Construction
INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
Chosen-Ciphertext Secure Proxy Re-encryption without Pairings
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
Conditional Proxy Broadcast Re-Encryption
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Efficient Conditional Proxy Re-encryption with Chosen-Ciphertext Security
ISC '09 Proceedings of the 12th International Conference on Information Security
An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Proxy re-encryption with keyword search
Information Sciences: an International Journal
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
Certificateless public key encryption without pairing
ISC'05 Proceedings of the 8th international conference on Information Security
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
Direct chosen-ciphertext secure identity-based key encapsulation without random oracles
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Proxy re-encryption systems for identity-based encryption
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Identity-based proxy re-encryption without random oracles
ISC'07 Proceedings of the 10th international conference on Information Security
On the security of a bidirectional proxy re-encryption scheme from PKC 2010
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Efficient bidirectional proxy re-encryption with direct chosen-ciphertext security
Computers & Mathematics with Applications
Certificate-based proxy decryption systems with revocability in the standard model
Information Sciences: an International Journal
| Hi-index | 0.07 |
Proxy re-encryption (PRE) is a useful primitive that allows a semi-trusted proxy to transform a ciphertext encrypted under one key into an encryption of the same plaintext under another key. A PRE scheme is bidirectional if the proxy is able to transform ciphertexts in both directions. In ACM CCS'07, Canetti and Hohenberger presented a bidirectional PRE scheme with chosen-ciphertext security, which captures the indistinguishability of ciphertexts even if the adversary has access to the standard decryption oracle as well as a re-encryption oracle and a re-encryption key oracle. They also left an important open problem to come up with a chosen-ciphertext secure PRE scheme without pairings. To resolve this problem, we propose a bidirectional PRE scheme without pairings, and prove its chosen-ciphertext security under the computational Diffie-Hellman assumption in the random oracle model. Based on this scheme, we further present a non-transitive bidirectional PRE scheme, in which the proxy alone cannot re-delegate the decryption rights.