Publication:3166192
From MaRDI portal
zbMath1268.81044MaRDI QIDQ3166192
Publication date: 21 October 2012
Related Items
Unnamed Item, Unnamed Item, Approximate Degree in Classical and Quantum Computing, A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$, On the Power of Statistical Zero Knowledge, Zero-Knowledge Proofs of Proximity, An Exponential Separation Between MA and AM Proofs of Proximity, Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations, Unnamed Item, Quantum commitments from complexity assumptions, An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity, Public-coin statistical zero-knowledge batch verification against malicious verifiers