Universally composable privacy amplification against quantum adversaries

Renato Renner, Robert König

Research output: Contribution to journalConference articlepeer-review

253 Scopus citations

Abstract

Privacy amplification is the art of shrinking a partially secret string Z to a highly secret key S. We show that, even if an adversary holds quantum information about the initial string Z, the key S obtained by two-universal hashing is secure, according to a universally composable security definition. Additionally, we give an asymptotically optimal lower bound on the length of the extractable key S in terms of the adversary's (quantum) knowledge about Z. Our result has applications in quantum cryptography. In particular, it implies that many of the known quantum key distribution protocols are universally composable.

Original languageEnglish
Pages (from-to)407-425
Number of pages19
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3378
DOIs
StatePublished - 2005
Externally publishedYes
EventSecond Theory of Cryptography Conference, TCC 2005 - Cambridge, MA, United States
Duration: 10 Feb 200512 Feb 2005

Fingerprint

Dive into the research topics of 'Universally composable privacy amplification against quantum adversaries'. Together they form a unique fingerprint.

Cite this