Loading...
Loading...

Go to the content (press return)

Efficient cryptosystems from 2k-th power residue symbols

Author
Herranz, J.; Libert, B.; Joye, M.; Benhamouda, F.
Type of activity
Journal article
Journal
Journal of cryptology
Date of publication
2017-04
Volume
30
Number
2
First page
519
Last page
549
DOI
https://doi.org/10.1007/s00145-016-9229-5 Open in new window
Repository
http://eprint.iacr.org/2013/435 Open in new window
http://hdl.handle.net/2117/103661 Open in new window
URL
http://link.springer.com/article/10.1007/s00145-016-9229-5?wt_mc=internal.event.1.SEM.ArticleAuthorOnlineFirst Open in new window
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 wor...
Citation
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.
Keywords
Goldwasser–Micali cryptosystem, Homomorphic encryption, Public-key encryption, Quadratic residuosity, Standard model
Group of research
MAK - Mathematics Applied to Cryptography

Participants

  • Herranz Sotoca, Javier  (author)
  • Libert, Benoit  (author)
  • Joye, Marc  (author)
  • Benhamouda, Fabrice  (author)

Attachments