Public-key encryption schemes with auxiliary inputs

Yevgeniy Dodis, Shafi Goldwasser, Yael Tauman Kalai, Chris Peikert, Vinod Vaikuntanathan

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

Abstract

We construct public-key cryptosystems that remain secure even when the adversary is given any computationally uninvertible function of the secret key as auxiliary input (even one that may reveal the secret key information- theoretically). Our schemes are based on the decisional Diffie-Hellman (DDH) and the Learning with Errors (LWE) problems. As an independent technical contribution, we extend the Goldreich-Levin theorem to provide a hard-core (pseudorandom) value over large fields.

Original languageEnglish (US)
Title of host publicationTheory of Cryptography - 7th Theory of Cryptography Conference, TCC 2010, Proceedings
Pages361-381
Number of pages21
Volume5978 LNCS
DOIs
StatePublished - 2010
Event7th Theory of Cryptography Conference, TCC 2010 - Zurich, Switzerland
Duration: Feb 9 2010Feb 11 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5978 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other7th Theory of Cryptography Conference, TCC 2010
CountrySwitzerland
CityZurich
Period2/9/102/11/10

Fingerprint

Public Key Encryption
Cryptography
Public-key Cryptosystem
Diffie-Hellman
Theorem
Learning

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Dodis, Y., Goldwasser, S., Tauman Kalai, Y., Peikert, C., & Vaikuntanathan, V. (2010). Public-key encryption schemes with auxiliary inputs. In Theory of Cryptography - 7th Theory of Cryptography Conference, TCC 2010, Proceedings (Vol. 5978 LNCS, pp. 361-381). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5978 LNCS). https://doi.org/10.1007/978-3-642-11799-2_22

Public-key encryption schemes with auxiliary inputs. / Dodis, Yevgeniy; Goldwasser, Shafi; Tauman Kalai, Yael; Peikert, Chris; Vaikuntanathan, Vinod.

Theory of Cryptography - 7th Theory of Cryptography Conference, TCC 2010, Proceedings. Vol. 5978 LNCS 2010. p. 361-381 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5978 LNCS).

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

Dodis, Y, Goldwasser, S, Tauman Kalai, Y, Peikert, C & Vaikuntanathan, V 2010, Public-key encryption schemes with auxiliary inputs. in Theory of Cryptography - 7th Theory of Cryptography Conference, TCC 2010, Proceedings. vol. 5978 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5978 LNCS, pp. 361-381, 7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, 2/9/10. https://doi.org/10.1007/978-3-642-11799-2_22
Dodis Y, Goldwasser S, Tauman Kalai Y, Peikert C, Vaikuntanathan V. Public-key encryption schemes with auxiliary inputs. In Theory of Cryptography - 7th Theory of Cryptography Conference, TCC 2010, Proceedings. Vol. 5978 LNCS. 2010. p. 361-381. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-11799-2_22
Dodis, Yevgeniy ; Goldwasser, Shafi ; Tauman Kalai, Yael ; Peikert, Chris ; Vaikuntanathan, Vinod. / Public-key encryption schemes with auxiliary inputs. Theory of Cryptography - 7th Theory of Cryptography Conference, TCC 2010, Proceedings. Vol. 5978 LNCS 2010. pp. 361-381 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{c7dd1ad899f54113a2cfbe503c91ceff,
title = "Public-key encryption schemes with auxiliary inputs",
abstract = "We construct public-key cryptosystems that remain secure even when the adversary is given any computationally uninvertible function of the secret key as auxiliary input (even one that may reveal the secret key information- theoretically). Our schemes are based on the decisional Diffie-Hellman (DDH) and the Learning with Errors (LWE) problems. As an independent technical contribution, we extend the Goldreich-Levin theorem to provide a hard-core (pseudorandom) value over large fields.",
author = "Yevgeniy Dodis and Shafi Goldwasser and {Tauman Kalai}, Yael and Chris Peikert and Vinod Vaikuntanathan",
year = "2010",
doi = "10.1007/978-3-642-11799-2_22",
language = "English (US)",
isbn = "3642117988",
volume = "5978 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "361--381",
booktitle = "Theory of Cryptography - 7th Theory of Cryptography Conference, TCC 2010, Proceedings",

}

TY - GEN

T1 - Public-key encryption schemes with auxiliary inputs

AU - Dodis, Yevgeniy

AU - Goldwasser, Shafi

AU - Tauman Kalai, Yael

AU - Peikert, Chris

AU - Vaikuntanathan, Vinod

PY - 2010

Y1 - 2010

N2 - We construct public-key cryptosystems that remain secure even when the adversary is given any computationally uninvertible function of the secret key as auxiliary input (even one that may reveal the secret key information- theoretically). Our schemes are based on the decisional Diffie-Hellman (DDH) and the Learning with Errors (LWE) problems. As an independent technical contribution, we extend the Goldreich-Levin theorem to provide a hard-core (pseudorandom) value over large fields.

AB - We construct public-key cryptosystems that remain secure even when the adversary is given any computationally uninvertible function of the secret key as auxiliary input (even one that may reveal the secret key information- theoretically). Our schemes are based on the decisional Diffie-Hellman (DDH) and the Learning with Errors (LWE) problems. As an independent technical contribution, we extend the Goldreich-Levin theorem to provide a hard-core (pseudorandom) value over large fields.

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

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

U2 - 10.1007/978-3-642-11799-2_22

DO - 10.1007/978-3-642-11799-2_22

M3 - Conference contribution

AN - SCOPUS:77949580684

SN - 3642117988

SN - 9783642117985

VL - 5978 LNCS

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

SP - 361

EP - 381

BT - Theory of Cryptography - 7th Theory of Cryptography Conference, TCC 2010, Proceedings

ER -