Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

21

CC
2016
Springer

favoriteEmaildiscussreport

68views System Software» more CC 2016»

Quantum commitments from complexity assumptions

8 years 20 days ago

Quantum commitments from complexity assumptions

Download www.liafa.jussieu.fr

Abstract. We study worst-case complexity assumptions that imply quantum bitcommitment schemes. First we show that QSZK ⊆ QMA implies a computationally hiding and statistically binding auxiliary-input quantum commitment scheme. We then extend our result to show that the much weaker assumption QIP ⊆ QMA (which is weaker than PSPACE ⊆ PP) implies the existence of auxiliary-input commitment schemes with quantum advice. Finally, to strengthen the plausibility of the separation QSZK ⊆ QMA we ﬁnd a quantum oracle relative to which honest-veriﬁer QSZK is not contained in QCMA.

André Chailloux, Iordanis Kerenidis, Bill R

Real-time Traffic

CC 2016 | System Software |

claim paper

Related Content

» Perfectly Concealing Quantum Bit Commitment from any Quantum OneWay Permutation

» Constructing Committed Signatures from StrongRSA Assumption in the Standard Complexity Mod...

» Computational Collapse of Quantum State with Application to Oblivious Transfer

» ConstantRound Nonmalleable Commitments from Subexponential OneWay Functions

» Fully Simulatable QuantumSecure CoinFlipping and Applications

» The effect of communication costs in solidstate quantum computing architectures

» Concurrent Composition in the Bounded Quantum Storage Model

» Quantum versus Classical Learnability

» Universally Composable Commitments

» Computing the optimal strategy to commit to

Post Info
More Details (n/a)

Added	31 Mar 2016
Updated	31 Mar 2016
Type	Journal
Year	2016
Where	CC
Authors	André Chailloux, Iordanis Kerenidis, Bill Rosgen

Comments (0)