Tightly Secure Ring-LWE Based Key Encapsulation with Short Ciphertexts. / Albrecht, Martin; Orsini, Emmanuela; Paterson, Kenneth; Peer, Guy; Smart, Nigel.

Computer Security – ESORICS 2017. Springer, 2017. p. 29-46 (Lecture Notes in Computer Science; Vol. 10492).

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

Published

Standard

Tightly Secure Ring-LWE Based Key Encapsulation with Short Ciphertexts. / Albrecht, Martin; Orsini, Emmanuela; Paterson, Kenneth; Peer, Guy; Smart, Nigel.

Computer Security – ESORICS 2017. Springer, 2017. p. 29-46 (Lecture Notes in Computer Science; Vol. 10492).

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

Harvard

Albrecht, M, Orsini, E, Paterson, K, Peer, G & Smart, N 2017, Tightly Secure Ring-LWE Based Key Encapsulation with Short Ciphertexts. in Computer Security – ESORICS 2017. Lecture Notes in Computer Science, vol. 10492, Springer, pp. 29-46. https://doi.org/10.1007/978-3-319-66402-6_4

APA

Albrecht, M., Orsini, E., Paterson, K., Peer, G., & Smart, N. (2017). Tightly Secure Ring-LWE Based Key Encapsulation with Short Ciphertexts. In Computer Security – ESORICS 2017 (pp. 29-46). (Lecture Notes in Computer Science; Vol. 10492). Springer. https://doi.org/10.1007/978-3-319-66402-6_4

Vancouver

Albrecht M, Orsini E, Paterson K, Peer G, Smart N. Tightly Secure Ring-LWE Based Key Encapsulation with Short Ciphertexts. In Computer Security – ESORICS 2017. Springer. 2017. p. 29-46. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-319-66402-6_4

Author

Albrecht, Martin ; Orsini, Emmanuela ; Paterson, Kenneth ; Peer, Guy ; Smart, Nigel. / Tightly Secure Ring-LWE Based Key Encapsulation with Short Ciphertexts. Computer Security – ESORICS 2017. Springer, 2017. pp. 29-46 (Lecture Notes in Computer Science).

BibTeX

@inproceedings{09399e79410740fba755d0aac159b7e4,
title = "Tightly Secure Ring-LWE Based Key Encapsulation with Short Ciphertexts",
abstract = "We provide a tight security proof for an IND-CCA Ring-LWE based Key Encapsulation Mechanism that is derived from a generic construction of Dent (IMA Cryptography and Coding, 2003). Such a tight reduction is not known for the generic construction. The resulting scheme has shorter ciphertexts than can be achieved with other generic constructions of Dent or by using the well-known Fujisaki-Okamoto constructions (PKC 1999, Crypto 1999). Our tight security proof is obtained by reducing to the security of the underlying Ring-LWE problem, avoiding an intermediate reduction to a CPA-secure encryption scheme. The proof technique maybe of interest for other schemes based on LWE and Ring-LWE.",
author = "Martin Albrecht and Emmanuela Orsini and Kenneth Paterson and Guy Peer and Nigel Smart",
year = "2017",
doi = "10.1007/978-3-319-66402-6_4",
language = "English",
isbn = "978-3-319-66401-9",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "29--46",
booktitle = "Computer Security – ESORICS 2017",

}

RIS

TY - GEN

T1 - Tightly Secure Ring-LWE Based Key Encapsulation with Short Ciphertexts

AU - Albrecht, Martin

AU - Orsini, Emmanuela

AU - Paterson, Kenneth

AU - Peer, Guy

AU - Smart, Nigel

PY - 2017

Y1 - 2017

N2 - We provide a tight security proof for an IND-CCA Ring-LWE based Key Encapsulation Mechanism that is derived from a generic construction of Dent (IMA Cryptography and Coding, 2003). Such a tight reduction is not known for the generic construction. The resulting scheme has shorter ciphertexts than can be achieved with other generic constructions of Dent or by using the well-known Fujisaki-Okamoto constructions (PKC 1999, Crypto 1999). Our tight security proof is obtained by reducing to the security of the underlying Ring-LWE problem, avoiding an intermediate reduction to a CPA-secure encryption scheme. The proof technique maybe of interest for other schemes based on LWE and Ring-LWE.

AB - We provide a tight security proof for an IND-CCA Ring-LWE based Key Encapsulation Mechanism that is derived from a generic construction of Dent (IMA Cryptography and Coding, 2003). Such a tight reduction is not known for the generic construction. The resulting scheme has shorter ciphertexts than can be achieved with other generic constructions of Dent or by using the well-known Fujisaki-Okamoto constructions (PKC 1999, Crypto 1999). Our tight security proof is obtained by reducing to the security of the underlying Ring-LWE problem, avoiding an intermediate reduction to a CPA-secure encryption scheme. The proof technique maybe of interest for other schemes based on LWE and Ring-LWE.

U2 - 10.1007/978-3-319-66402-6_4

DO - 10.1007/978-3-319-66402-6_4

M3 - Conference contribution

SN - 978-3-319-66401-9

T3 - Lecture Notes in Computer Science

SP - 29

EP - 46

BT - Computer Security – ESORICS 2017

PB - Springer

ER -