Efficient cryptosystems from 2k-th power residue symbols
Visualitza/Obre
Cita com:
hdl:2117/103661
Tipus de documentArticle
Data publicació2017-04
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
Goldwasser and Micali (J Comput Syst Sci 28(2):270–299, 1984) highlighted the importance of randomizing the plaintext for public-key encryption and introduced the notion of semantic security. They also realized a cryptosystem meeting this security notion under the standard complexity assumption of deciding quadratic residuosity modulo a composite number. The Goldwasser–Micali cryptosystem is simple and elegant but is quite wasteful in bandwidth when encrypting large messages. A number of works followed to address this issue and proposed various modifications. This paper revisits the original Goldwasser–Micali cryptosystem using 2k-th power residue symbols. The so-obtained cryptosystems appear as a very natural generalization for k=2 (the case k=1 corresponds exactly to the Goldwasser–Micali cryptosystem). Advantageously, they are efficient in both bandwidth and speed; in particular, they allow for fast decryption. Further, the cryptosystems described in this paper inherit the useful features of the original cryptosystem (like its homomorphic property) and are shown to be secure under a similar complexity assumption. As a prominent application, this paper describes an efficient lossy trapdoor function-based thereon.
CitacióHerranz, J., Libert, B., Joye, M., Benhamouda, F. Efficient cryptosystems from 2k-th power residue symbols. "Journal of cryptology", Abril 2017, vol. 30, núm. 2, “The final publication is available at link.springer.com”., p. 519-549.
ISSN0933-2790
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
435.pdf | 407,8Kb | Visualitza/Obre |