A proxy re-encryption is a type of public key encryption where a proxy is given the ability to transform ciphertext for one user into ciphertext for another user, without having access to either the plaintext or the decryption keys.

Proxy re-encryption schemes, since their introduction in 1998 by Blaze et al. [3], are often proposed with specific security notions. We propose here to recall the most commonly used security notions and to propose standard security models for security analysis of proxy re-encryption scheme.

In this article, we consider the goals of confidentiality and non-malleability, each in the context of a parametric family of attack models. For each of the resulting pairs of definitions, we prove either an implication or a separation from the other security definitions.

proxy re-encryption, security models, public keys encryption, access delegation, cryptography.

Received: September 1, 2023;  Accepted: October 27, 2023; Published: December 15, 2023

How to cite this article: Mamadou Makhtar LO, Demba SOW and Mohamed Ben MAAOUIA, Development on security models for proxy re-encryption schemes, JP Journal of Algebra, Number Theory and Applications 63(1) (2024), 1-21. http://dx.doi.org/10.17654/0972555524001

This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License

References:
[1] Giuseppe Ateniese, Kevin Fu, Matthew Green and Susan Hohenberger, Improved proxy re-encryption schemes with applications to secure distributed storage, ACM Transactions on Information and System Security (TISSEC) 9(1) (2006), 1-30.
[2] Mihir Bellare, Anand Desai, David Pointcheval and Phillip Rogaway, Plaintext awareness, non-malleability, and chosen ciphertext security: implications and separations, Crypto 98 (1998), 26-45.
[3] Matt Blaze, Gerrit Bleumer and Martin Strauss, Divertible protocols and atomic proxy cryptography, Kaisa Nyberg, ed., Advances in Cryptology — EUROCRYPT’98, Springer, Berlin, Heidelberg, 1998, pp. 127 144.
[4] Sébastien Canard, Julien Devigne and Fabien Laguillaumie, Improving the security of an efficient unidirectional proxy re-encryption scheme, Journal of Internet Services and Information Security (2011), 140-160.
[5] Ran Canetti, Universally composable security: a new paradigm for cryptographic protocols, Proceedings 42nd IEEE Symposium on Foundations of Computer Science, IEEE, 2001, pp. 136-145.
[6] Ran Canetti and Susan Hohenberger, Chosen-ciphertext secure proxy re-encryption, Proceedings of the 14th ACM Conference on Computer and Communications Security, 2007, pp. 185-194.
[7] Ran Canetti, Hugo Krawczyk and Jesper B. Nielsen, Relaxing chosen-ciphertext security, Advances in Cryptology-CRYPTO 2003: 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003, Proceedings 23, Springer, 2003, pp. 565-582.
[8] Danny Dolev, Cynthia Dwork and Moni Naor, Non-malleable cryptography, Proceedings of the Twenty-third Annual ACM Symposium on Theory of Computing, 1991, pp. 542-552.
[9] T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Transactions on Information Theory 31(4) (1985), 469-472.
[10] Chunpeng Ge, Willy Susilo, Liming Fang, Jiandong Wang and Yunqing Shi, A CCA-secure key-policy attribute-based proxy re-encryption in the adaptive corruption model for dropbox data sharing system, Designs, Codes and Cryptography 86(11) (2018), 2587-2603.
[11] Oded Goldreich, Shafi Goldwasser and Silvio Micali, How to construct random functions, Journal of the ACM (JACM) 33(4) (1986), 792-807.
[12] Johan Håstad, Russell Impagliazzo, Leonid A. Levin and Michael Luby, A pseudorandom generator from any one-way function, SIAM Journal on Computing 28(4) (1999), 1364-1396.
[13] Russell Impagliazzo and Michael Luby, One-way functions are essential for complexity based cryptography, 30th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, 1989, pp. 230-235.
[14] Anca-Andreea Ivan and Yevgeniy Dodis, Proxy cryptography revisited, NDSS, 2003.
[15] Wei Luo and Wenping Ma, A secure revocable identity-based proxy re-encryption scheme for cloud storage, International Conference on Cloud Computing and Security, Springer, 2018, pp. 519-530.
[16] Ahsan Manzoor, Madhsanka Liyanage, An Braeke, Salil S. Kanhere and Mika Ylianttila, Blockchain based proxy re-encryption scheme for secure IoT data sharing, 2019 IEEE International Conference on Blockchain and Cryptocurrency (ICBC), IEEE, 2019, pp. 99-103.
[17] David Nunez, Isaac Agudo and Javier Lopez, A parametric family of attack models for proxy re-encryption, 2015 IEEE 28th Computer Security Foundations Symposium, 2015, pp. 290-301.
[18] Yuriy Polyakov, Kurt Rohloff, Gyana Sahu and Vinod Vaikuntanathan, Fast proxy re-encryption for publish/subscribe systems, ACM Transactions on Privacy and Security (TOPS) 20(4) (2017), 1-31.
[19] Goldwasser Shafi and Micali Silvio, Probabilistic encryption, Journal of Computer and System Sciences 28(2) (1984), 270-299.
[20] V. Vijayakumar, M. K. Priyan, Gandhi Ushadevi, R. Varatharajan, Gunasekaran Manogaran and Prathamesh Vijay Tarare, E-health cloud security using timing enabled proxy re-encryption, Mobile Networks and Applications 24(3) (2019), 1034-1045.
[21] Peng Xu, Tengfei Jiao, Qianhong Wu, Wei Wang and Hai Jin, Conditional identity-based broadcast proxy re-encryption and its application to cloud email, IEEE Transactions on Computers 65(1) (2015), 66-79.