TY - GEN
T1 - Simple and efficient public-key encryption from computational diffie-hellman in the standard model
AU - Haralambiev, Kristiyan
AU - Jager, Tibor
AU - Kiltz, Eike
AU - Shoup, Victor
PY - 2010
Y1 - 2010
N2 - This paper proposes practical chosen-ciphertext secure public-key encryption systems that are provably secure under the computational Diffie-Hellman assumption, in the standard model. Our schemes are conceptually simpler and more efficient than previous constructions. We also show that in bilinear groups the size of the public-key can be shrunk from n to 2â̂šn group elements, where n is the security parameter.
AB - This paper proposes practical chosen-ciphertext secure public-key encryption systems that are provably secure under the computational Diffie-Hellman assumption, in the standard model. Our schemes are conceptually simpler and more efficient than previous constructions. We also show that in bilinear groups the size of the public-key can be shrunk from n to 2â̂šn group elements, where n is the security parameter.
UR - http://www.scopus.com/inward/record.url?scp=79955548922&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79955548922&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-13013-7_1
DO - 10.1007/978-3-642-13013-7_1
M3 - Conference contribution
AN - SCOPUS:79955548922
SN - 3642130127
SN - 9783642130120
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1
EP - 18
BT - Public Key Cryptography, PKC 2010 - 13th International Conference on Practice and Theory in Public Key Cryptography, Proceedings
T2 - 13th International Conference on Practice and Theory in Public Key Cryptography, PKC 2010
Y2 - 26 May 2010 through 28 May 2010
ER -