Stateful public-key cryptosystems: How to encrypt with one 160-bit exponentiation

Mihir Bellare, Tadayoshi Kohno, Victor Shoup

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We show how to significantly speed-up the encryption portion of some public-key cryptosystems by the simple expedient of allowing a sender to maintain state that is re-used across different encryptions.In particular we present stateful versions of the DHIES and Kurosawa-Desmedt schemes that each use only 1 exponentiation to encrypt, as opposed to 2 and 3 respectively in the original schemes, yielding the fastest discrete-log based public-key encryption schemes known in the random-oracle and standard models respectively. The schemes are proven to meet an appropriate extension of the standard definition of IND-CCA security that takes into account novel types of attacks possible in the stateful setting.

Original languageEnglish (US)
Title of host publicationProceedings of the ACM Conference on Computer and Communications Security
Pages380-389
Number of pages10
DOIs
StatePublished - 2006
EventCCS 2006: 13th ACM Conference on Computer and Communications Security - Alexandria, VA, United States
Duration: Oct 30 2006Nov 3 2006

Other

OtherCCS 2006: 13th ACM Conference on Computer and Communications Security
CountryUnited States
CityAlexandria, VA
Period10/30/0611/3/06

Fingerprint

Cryptography

Keywords

  • Cryptography
  • Public-key encryption

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Bellare, M., Kohno, T., & Shoup, V. (2006). Stateful public-key cryptosystems: How to encrypt with one 160-bit exponentiation. In Proceedings of the ACM Conference on Computer and Communications Security (pp. 380-389). [1180452] https://doi.org/10.1145/1180405.1180452

Stateful public-key cryptosystems : How to encrypt with one 160-bit exponentiation. / Bellare, Mihir; Kohno, Tadayoshi; Shoup, Victor.

Proceedings of the ACM Conference on Computer and Communications Security. 2006. p. 380-389 1180452.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bellare, M, Kohno, T & Shoup, V 2006, Stateful public-key cryptosystems: How to encrypt with one 160-bit exponentiation. in Proceedings of the ACM Conference on Computer and Communications Security., 1180452, pp. 380-389, CCS 2006: 13th ACM Conference on Computer and Communications Security, Alexandria, VA, United States, 10/30/06. https://doi.org/10.1145/1180405.1180452
Bellare M, Kohno T, Shoup V. Stateful public-key cryptosystems: How to encrypt with one 160-bit exponentiation. In Proceedings of the ACM Conference on Computer and Communications Security. 2006. p. 380-389. 1180452 https://doi.org/10.1145/1180405.1180452
Bellare, Mihir ; Kohno, Tadayoshi ; Shoup, Victor. / Stateful public-key cryptosystems : How to encrypt with one 160-bit exponentiation. Proceedings of the ACM Conference on Computer and Communications Security. 2006. pp. 380-389
@inproceedings{2c0757488cf648afa6392b9bbae86765,
title = "Stateful public-key cryptosystems: How to encrypt with one 160-bit exponentiation",
abstract = "We show how to significantly speed-up the encryption portion of some public-key cryptosystems by the simple expedient of allowing a sender to maintain state that is re-used across different encryptions.In particular we present stateful versions of the DHIES and Kurosawa-Desmedt schemes that each use only 1 exponentiation to encrypt, as opposed to 2 and 3 respectively in the original schemes, yielding the fastest discrete-log based public-key encryption schemes known in the random-oracle and standard models respectively. The schemes are proven to meet an appropriate extension of the standard definition of IND-CCA security that takes into account novel types of attacks possible in the stateful setting.",
keywords = "Cryptography, Public-key encryption",
author = "Mihir Bellare and Tadayoshi Kohno and Victor Shoup",
year = "2006",
doi = "10.1145/1180405.1180452",
language = "English (US)",
pages = "380--389",
booktitle = "Proceedings of the ACM Conference on Computer and Communications Security",

}

TY - GEN

T1 - Stateful public-key cryptosystems

T2 - How to encrypt with one 160-bit exponentiation

AU - Bellare, Mihir

AU - Kohno, Tadayoshi

AU - Shoup, Victor

PY - 2006

Y1 - 2006

N2 - We show how to significantly speed-up the encryption portion of some public-key cryptosystems by the simple expedient of allowing a sender to maintain state that is re-used across different encryptions.In particular we present stateful versions of the DHIES and Kurosawa-Desmedt schemes that each use only 1 exponentiation to encrypt, as opposed to 2 and 3 respectively in the original schemes, yielding the fastest discrete-log based public-key encryption schemes known in the random-oracle and standard models respectively. The schemes are proven to meet an appropriate extension of the standard definition of IND-CCA security that takes into account novel types of attacks possible in the stateful setting.

AB - We show how to significantly speed-up the encryption portion of some public-key cryptosystems by the simple expedient of allowing a sender to maintain state that is re-used across different encryptions.In particular we present stateful versions of the DHIES and Kurosawa-Desmedt schemes that each use only 1 exponentiation to encrypt, as opposed to 2 and 3 respectively in the original schemes, yielding the fastest discrete-log based public-key encryption schemes known in the random-oracle and standard models respectively. The schemes are proven to meet an appropriate extension of the standard definition of IND-CCA security that takes into account novel types of attacks possible in the stateful setting.

KW - Cryptography

KW - Public-key encryption

UR - http://www.scopus.com/inward/record.url?scp=34547313805&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34547313805&partnerID=8YFLogxK

U2 - 10.1145/1180405.1180452

DO - 10.1145/1180405.1180452

M3 - Conference contribution

SP - 380

EP - 389

BT - Proceedings of the ACM Conference on Computer and Communications Security

ER -