Efficient provable dual receiver hybrid and light weight public key schemes based on the discrete logarithm problem without pairings

Abstract

AbstractDual‐receiver proxy re‐encryption is a cryptographic technique that enables secure data sharing among multiple authorized users or entities. It has gained significant attention for its ability to manage access permissions, data confidentiality, and streamline communication channels. These schemes have been widely used in various applications, including healthcare systems, cloud computing, Internet of Things (IoT) systems, collaborative environments, and secure communication channels. This paper aims to propose two proxy re‐encryption schemes for dual receivers without pairings. The first is dual receiver lightweight proxy re‐encryption without pairings (DR‐LWPRE‐WP), which uses a public key scheme to reduce computational complexity. The second is dual receiver hybrid proxy re‐encryption without pairings (DR‐HPRE‐WP), which incorporates public key and symmetric key schemes. Both schemes offer protection against selected plaintext attacks based on the decisional Diffie‐Hellman principle. The DR‐LWPRE‐WP scheme reduces computation by approximately 53% compared to pairing‐based schemes, making it suitable for lightweight applications like the Internet of Things. The computational efficacy of these schemes offers significant benefits for resource‐constrained environments and practical implementations.