Conference ProceedingsOPEN ACCESS

Practical chosen ciphertext secure encryption from factoring

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5479 LNCS 313-332
DOI: 10.1007/978-3-642-01001-9_18
101Citations
Citations of this article
39Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We propose a practical public-key encryption scheme whose security against chosen-ciphertext attacks can be reduced in the standard model to the assumption that factoring is intractable. © International Association for Cryptologic Research 2009.

Author supplied keywords

Cite

CITATION STYLE

APA

Hofheinz, D., & Kiltz, E. (2009). Practical chosen ciphertext secure encryption from factoring. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5479 LNCS, pp. 313–332). https://doi.org/10.1007/978-3-642-01001-9_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free