### Abstract

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.

Original language | English (US) |
---|---|

Title of host publication | Public Key Cryptography, PKC 2010 - 13th International Conference on Practice and Theory in Public Key Cryptography, Proceedings |

Pages | 1-18 |

Number of pages | 18 |

DOIs | |

State | Published - 2010 |

Event | 13th International Conference on Practice and Theory in Public Key Cryptography, PKC 2010 - Paris, France Duration: May 26 2010 → May 28 2010 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 6056 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 13th International Conference on Practice and Theory in Public Key Cryptography, PKC 2010 |
---|---|

Country | France |

City | Paris |

Period | 5/26/10 → 5/28/10 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Simple and efficient public-key encryption from computational diffie-hellman in the standard model'. Together they form a unique fingerprint.

## Cite this

Haralambiev, K., Jager, T., Kiltz, E., & Shoup, V. (2010). Simple and efficient public-key encryption from computational diffie-hellman in the standard model. In

*Public Key Cryptography, PKC 2010 - 13th International Conference on Practice and Theory in Public Key Cryptography, Proceedings*(pp. 1-18). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6056 LNCS). https://doi.org/10.1007/978-3-642-13013-7_1