DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Shlomo Moran
Shlomo Moran
Arxiv:2104.04742V2 [Quant-Ph] 13 Apr 2021 Keywords: Quantum Cryptography, Remote State Preparation, Zero-Knowledge, Learning with Errors Table of Contents
On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs*
Interactive Proofs
Is It Easier to Prove Theorems That Are Guaranteed to Be True?
DRAFT -- DRAFT -- Appendix
Combinatorial Topology and Distributed Computing Copyright 2010 Herlihy, Kozlov, and Rajsbaum All Rights Reserved
List of My Favorite Publications
Lecture 14 1 Admin 2 Theorems Vs. Proofs 3 Interactive Proof
Proofs of Proximity for Distribution Testing
Bfm:978-3-540-31691-6/1.Pdf
SODA08 Schedule
On Round-Efficient Argument Systems
Interactive Proofs of Proximity: Delegating Computation in Sublinear Time
On Emulating Interactive Proofs with Public Coins∗
Statement of Research
Signature Redacted Department of Electrical Engineering and Computer Science Signature Redacted""'I May 23, 2019 C Ertified by
Chicago Journal of Theoretical Computer Science the MIT Press
Is It Easier to Prove Theorems That Are Guaranteed to Be True?
Top View
On Interactive Proofs with a Laconic Prover
Novel Frameworks for Mining Heterogeneous and Dynamic
The Read/Write Protocol Complex Is Collapsible?
Interactive Proofs of Proximity: Delegating Computation in Sublinear Time
Time- and Space-Efficient Arguments from Groups of Unknown Order∗
On Transformations of Interactive Proofs That Preserve the Prover's Complexity
Protecting Privacy by Splitting Trust
The Power of Distributed Verifiers in Interactive Proofs
Verifiable Stream Computation and Arthur-Merlin Communication
Optimal Fine-Grained Hardness of Approximation of Linear Equations
Proofs of Proximity for Distribution Testing∗†
Quantum Information and the PCP Theorem
A History of the PCP Theorem
Ilan Newman 1 Personal Details 2 Higher Education 3 Academic
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe*
Cryptography (Summer 2015) Final Program Report
Podc 2007 2007
The Complexity of Zero Knowledge