New binding-concealing trade-offs for quantum string commitment

DOI10.1007/S00145-008-9025-YMaRDI QIDQ1021244zbMATH OpenOpenAlexFDO

Authors Rahul Jain

Publication date 8 June 2009

Published in Journal of Cryptology (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/0506001

zbMATH Keywords

relative entropyquantum channelssubstate theoremobservational divergencestring commitment

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Communication theory (94A05)

Abstract: String commitment schemes are similar to the well studied bit commitment schemes in cryptography with the difference that the committing party, say Alice, is supposed to commit a long string instead of a single bit, to another party say Bob. Similar to bit commitment schemes, such schemes are supposed to be binding, i.e Alice cannot change her choice after committing, and concealing i.e. Bob cannot find Alice's committed string before Alice reveals it. Ideal commitment schemes are known to be impossible. Even if some degrees of cheating is allowed, Buhrman, Christandl, Hayden, Lo and Wehner (quant-ph/0504078) have recently shown that there are some binding-concealing trade-offs that any quantum string commitment scheme (QSC) must follow. They showed trade-offs both in the scenario of single execution of the protocol and in the asymptotic regime of sufficiently large number of parallel executions of the protocol. We present here new trade-offs in the scenario of single execution of a QSC protocol. Our trade-offs also immediately imply the trade-off shown by Buhrman et al. in the asymptotic regime. We show our results by making a central use of an important information theoretic tool called the substate theorem due to Jain, Radhakrishnan and Sen. Our techniques are quite different from that of Buhrman et al. and may be of independent interest.

Recommendations

• Security of quantum bit string commitment depends on the information measure
• A short impossibility proof of quantum bit commitment
• scientific article; zbMATH DE number 1302858
• An arbitrarily concealing and practically binding quantum bit commitment protocol
• Quantum bit escrow

Cites work

• scientific article; zbMATH DE number 1263182 (Why is no real title available?)
• A Separation between Divergence and Holevo Information for Ensembles
• Coin flipping by telephone a protocol for solving impossible problems
• Communication complexity of remote state preparation with entanglement
• Foundations of Cryptography
• Security of quantum bit string commitment depends on the information measure
• Why quantum bit commitment and ideal quantum coin tossing are impossible.

Cited in

(4)

• A separation between divergence and Holevo information for ensembles
• Two-way quantum-bit-string commitment
• Security of quantum bit string commitment depends on the information measure
• RECOVERING STRINGS IN ORACLES: QUANTUM AND CLASSIC

This page was built for publication: New binding-concealing trade-offs for quantum string commitment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1021244)