Impossibility of growing quantum bit commitments

Winkler, S; Tomamichel, M; Hengl, S; Renner, R

Impossibility of growing quantum bit commitments

Winkler, S Tomamichel, M

Hengl, S Renner, R

Permalink

Publication Type:: Journal Article
Citation:: Physical Review Letters, 2011, 107 (9)
Issue Date:: 2011-08-26

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Published VersionAdobe PDF (84.91 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Winkler, S	en_US
dc.contributor.author	Tomamichel, M https://orcid.org/0000-0001-5410-3329	en_US
dc.contributor.author	Hengl, S	en_US
dc.contributor.author	Renner, R	en_US
dc.date.issued	2011-08-26	en_US
dc.identifier.citation	Physical Review Letters, 2011, 107 (9)	en_US
dc.identifier.issn	0031-9007	en_US
dc.identifier.uri	http://hdl.handle.net/10453/116909
dc.description.abstract	Quantum key distribution (QKD) is often, more correctly, called key growing. Given a short key as a seed, QKD enables two parties, connected by an insecure quantum channel, to generate a secret key of arbitrary length. Conversely, no key agreement is possible without access to an initial key. Here, we consider another fundamental cryptographic task, commitments. While, similar to key agreement, commitments cannot be realized from scratch, we ask whether they may be grown. That is, given the ability to commit to a fixed number of bits, is there a way to augment this to commitments to strings of arbitrary length? Using recently developed information-theoretic techniques, we answer this question in the negative. © 2011 American Physical Society.	en_US
dc.relation.ispartof	Physical Review Letters	en_US
dc.relation.isbasedon	10.1103/PhysRevLett.107.090502	en_US
dc.subject.classification	General Physics	en_US
dc.title	Impossibility of growing quantum bit commitments	en_US
dc.type	Journal Article
utslib.citation.volume	9	en_US
utslib.citation.volume	107	en_US
utslib.for	020603 Quantum Information, Computation and Communication	en_US
utslib.for	01 Mathematical Sciences	en_US
utslib.for	02 Physical Sciences	en_US
utslib.for	09 Engineering	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	open_access
pubs.issue	9	en_US
pubs.publication-status	Published	en_US
pubs.volume	107	en_US

Abstract:

Quantum key distribution (QKD) is often, more correctly, called key growing. Given a short key as a seed, QKD enables two parties, connected by an insecure quantum channel, to generate a secret key of arbitrary length. Conversely, no key agreement is possible without access to an initial key. Here, we consider another fundamental cryptographic task, commitments. While, similar to key agreement, commitments cannot be realized from scratch, we ask whether they may be grown. That is, given the ability to commit to a fixed number of bits, is there a way to augment this to commitments to strings of arbitrary length? Using recently developed information-theoretic techniques, we answer this question in the negative. © 2011 American Physical Society.

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

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