Chosen-Ciphertext Secure Unidirectional Proxy Re-Encryption Based on Asymmetric Pairings
Source abstract
Abstract
Proxy re-encryption (PRE) is a cryptographic primitive that extends public key encryption by allowing ciphertexts to be re-encrypted from one user to another without revealing information about the underlying plaintext. This makes it an essential privacy-enhancing technology, as only the intended recipient is able to decrypt sensitive personal information. Previous PRE schemes were commonly based on symmetric bilinear pairings. However, these have been found to be slower and less secure than the more modern asymmetric pairings. To address this, we propose two new PRE scheme variants, based on the unidirectional symmetric pairing-based scheme by Weng et al. and adapted to utilize asymmetric pairings. We employ a known automated black-box reduction technique to transform the base scheme to the asymmetric setting, identify its shortcomings, and subsequently present an alternative manual transformation that fixes these flaws. The adapted schemes retain the properties of the base scheme and are therefore CCA-secure in the adaptive corruption model without the use of random oracles, while being faster, practical, and more secure overall than the base scheme.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Cryptography and Data Security
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Secure Systems Engineering, Fraunhofer AISEC, 14199 Berlin, Germany
References (22)
Show source-provided references
1. Divertible Protocols and Atomic Proxy Cryptography
2. Improved proxy re-encryption schemes with applications to secure distributed storage10.1145/1127345.1127346 ↗
3. Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption
4. CCA-secure Unidirectional Proxy Re-Encryption in the Adaptive Corruption Model without Random Oracles10.1007/s11432-010-0047-3 ↗
5. Pairings for cryptographers10.1016/j.dam.2007.12.010 ↗
6. Fast Symmetric Pairing Revisited
7. High-Speed Software Implementation of the Optimal Ate Pairing over Barreto-Naehrig Curves
8. Faster Explicit Formulas for Computing Pairings over Ordinary Curves10.1007/978-3-642-20465-4_5 ↗
9. Still wrong use of pairings in cryptography
10. On cryptographic protocols employing asymmetric pairings—The role of Ψ revisited10.1016/j.dam.2011.04.021 ↗
11. CCA-Secure Proxy Re-encryption without Pairings
12. Efficient Unidirectional Proxy Re-Encryption10.1007/978-3-642-12678-9_19 ↗
13. A Provably-Secure Unidirectional Proxy Re-encryption Scheme Without Pairing in the Random Oracle Model
14. Collusion-resistant identity-based Proxy Re-encryption: Lattice-based constructions in Standard Model10.1016/j.tcs.2021.04.008 ↗
15. Lattice-Based HRA-secure Attribute-Based Proxy Re-Encryption in Standard Model
16. Fine-Grained Proxy Re-encryption: Definitions and Constructions from LWE10.1007/978-981-99-8736-8_7 ↗
17. Multi-hop Fine-Grained Proxy Re-encryption
18. Updating Key Size Estimations for Pairings10.1007/s00145-018-9280-5 ↗
19. Converting Cryptographic Schemes from Symmetric to Asymmetric Bilinear Groups10.1007/978-3-662-44371-2_14 ↗
20. Ray, I., Li, N., and Kruegel, C. (2015, January 12–16). Automating Fast and Secure Translations from Type-I to Type-III Pairing Schemes. Proceedings of the CCS 2015, Denver, CO, USA.
21. Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming10.1007/978-3-662-53015-3_14 ↗
22. Bowe, S. (2024, October 10). BLS12-381: New zk-SNARK Elliptic Curve Construction. Available online: https://electriccoin.co/blog/new-snark-curve/.