.png){kind=icon}
.png){kind=icon}
Return
Comparing classical and quantum conditional disclosure of secrets
.png){kind=icon}
PRE
AI
DOI：.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The conditional disclosure of secrets (CDS) setting is among the most basic primitives studied in information-theoretic cryptography. Motivated by a connection to non-local quantum computation and position-based cryptography, CDS with quantum resources has recently been considered. Here, we study the differences between quantum and classical CDS, with the aims of clarifying the power of quantum resources in information-theoretic cryptography. We establish the following results: center dot We prove a ohm(log R0,A -> B(f) + log R0,B -> A(f)) lower bound on quantum CDS where R0,A -> B(f ) is the classical one-way communication complexity with perfect correctness. center dot We prove a lower bound on quantum CDS in terms of two round, public coin, two-prover interactive proofs. center dot For perfectly correct CDS, we give a separation for a promise version of the not-equals function, showing a quantum upper bound of O(logn) and classical lower bound of ohm(n). center dot We give a logarithmic upper bound for quantum CDS on forrelation, while the best known classical algorithm is linear. We interpret this as preliminary evidence that classical and quantum CDS are separated even with correctness and security error allowed. We also give a separation for classical and quantum private simultaneous message passing for a partial function, improving on an earlier relational separation. Our results use novel combinations of techniques from non-local quantum computation and communication complexity.
Journal
IF:
5.4
Papers:
951
Citations:
1.0W