Three approaches are currently used for devising identity-based encryption schemes. They respectively build on pairings, quadratic residues (QR), and lattices. Among them, the QR …
We develop exact formulas for the distribution of quadratic residues and non-residues in sets of the form a+ X={(a+ x) mod n∣ x∈ X}, where n is a prime or the product of two primes …
Abstract Identity Based Encryption (IBE) has been constructed from bilinear pairings, lattices and quadratic residuosity. The latter is an attractive basis for an IBE owing to the fact that it is …
W Gao, L Yang, D Zhang, X Liu - Cryptography, 2022 - mdpi.com
To prevent eavesdropping and tampering, network security protocols take advantage of asymmetric ciphers to establish session-specific shared keys with which further …
I Elashry, Y Mu, W Susilo - … Conference on Network and System Security, 2015 - Springer
Abstract In FOCS'07, Boneh, Gentry and Hamburg presented an identity-based encryption (IBE) system (BasicIBE) based on the quadratic residuosity (QR) assumption. A BasicIBE …
Y Hatri, A Otmani, K Guenda - International Journal of …, 2018 - Wiley Online Library
Authenticated key exchange protocols represent an important cryptographic mechanism that enables several parties to communicate securely over an open network. Elashry, Mu, and …
I Elashry, Y Mu, W Susilo - International Workshop on Information Security …, 2014 - Springer
Abstract Boneh, Gentry and Hamburg presented an encryption system known as BasicIBE without incorporating pairings. This system has short ciphertext size but this comes at the …
G Teseleanu, P Cotan - Cryptology ePrint Archive, 2023 - eprint.iacr.org
In the design of an identity-based encryption (IBE) scheme, the primary security assumptions center around quadratic residues, bilinear mappings, and lattices. Among these …
AG Schipor - … Security Solutions for Information Technology and …, 2019 - Springer
Abstract In 3, Jhanwar and Barua presented an improvement of the Boneh-Gentry-Hamburg (BGH) scheme. In addition to reducing the time complexity of the algorithm to find a solution …