Leftover hashing against quantum side information

Tomamichel, M; Schaffner, C; Smith, A; Renner, R

Leftover hashing against quantum side information

Tomamichel, M

Schaffner, C Smith, A Renner, R

Permalink

Publication Type:: Journal Article
Citation:: IEEE Transactions on Information Theory, 2011, 57 (8), pp. 5524 - 5535
Issue Date:: 2011-08-01

Closed Access

	Filename	Description	Size
	ja.pdf	Published Version	259.41 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Tomamichel, M https://orcid.org/0000-0001-5410-3329	en_US
dc.contributor.author	Schaffner, C	en_US
dc.contributor.author	Smith, A	en_US
dc.contributor.author	Renner, R	en_US
dc.date.issued	2011-08-01	en_US
dc.identifier.citation	IEEE Transactions on Information Theory, 2011, 57 (8), pp. 5524 - 5535	en_US
dc.identifier.issn	0018-9448	en_US
dc.identifier.uri	http://hdl.handle.net/10453/116913
dc.description.abstract	The Leftover Hash Lemma states that the output of a two-universal hash function applied to an input with sufficiently high entropy is almost uniformly random. In its standard formulation, the lemma refers to a notion of randomness that is (usually implicitly) defined with respect to classical side information. Here, a strictly more general version of the Leftover Hash Lemma that is valid even if side information is represented by the state of a quantum system is shown. Our result applies to almost two-universal families of hash functions. The generalized Leftover Hash Lemma has applications in cryptography, e.g., for key agreement in the presence of an adversary who is not restricted to classical information processing. © 2011 IEEE.	en_US
dc.relation.ispartof	IEEE Transactions on Information Theory	en_US
dc.relation.isbasedon	10.1109/TIT.2011.2158473	en_US
dc.subject.classification	Networking & Telecommunications	en_US
dc.title	Leftover hashing against quantum side information	en_US
dc.type	Journal Article
utslib.citation.volume	8	en_US
utslib.citation.volume	57	en_US
utslib.for	0801 Artificial Intelligence and Image Processing	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
utslib.for	1005 Communications Technologies	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	/University of Technology Sydney/Strength - QSI - Centre for Quantum Software and Information
utslib.copyright.status	closed_access
pubs.issue	8	en_US
pubs.publication-status	Published	en_US
pubs.volume	57	en_US

Abstract:

The Leftover Hash Lemma states that the output of a two-universal hash function applied to an input with sufficiently high entropy is almost uniformly random. In its standard formulation, the lemma refers to a notion of randomness that is (usually implicitly) defined with respect to classical side information. Here, a strictly more general version of the Leftover Hash Lemma that is valid even if side information is represented by the state of a quantum system is shown. Our result applies to almost two-universal families of hash functions. The generalized Leftover Hash Lemma has applications in cryptography, e.g., for key agreement in the presence of an adversary who is not restricted to classical information processing. © 2011 IEEE.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/116913