Cover Image

Perfect Zero-Knowledge PCPs for #P

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gur, Tom, O'Connor, Jack, Spooner, Nicholas
Format:	Preprint
Published:	2024
Subjects:	Computational Complexity Cryptography and Security Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Zero-Knowledge PCP Theorem
by: Gur, Tom, et al.
Published: (2024)

Mind the Gap? Not for SVP Hardness under ETH!
by: Aggarwal, Divesh, et al.
Published: (2025)

Towards EXPTIME One Way Functions: Bloom Filters, Succinct Graphs, Cliques, & Self Masking
by: Dolev, Shlomi
Published: (2025)

On the Maximum Distance Sublattice Problem and Closest Vector Problem
by: Kumar, Rajendra, et al.
Published: (2018)

Improved Hardness of BDD and SVP Under Gap-(S)ETH
by: Bennett, Huck, et al.
Published: (2021)

Keeping a Secret Requires a Good Memory: Space Lower-Bounds for Private Algorithms
by: Epasto, Alessandro, et al.
Published: (2026)

The Planted Orthogonal Vectors Problem
by: Kühnemann, David, et al.
Published: (2025)

Cell-Probe Lower Bounds via Semi-Random CSP Refutation: Simplified and the Odd-Locality Case
by: Guruswami, Venkatesan, et al.
Published: (2025)

On the instance optimality of detecting collisions and subgraphs
by: Ben-Eliezer, Omri, et al.
Published: (2023)

Streaming Zero-Knowledge Proofs
by: Cormode, Graham, et al.
Published: (2023)

No exponential quantum speedup for $\mathrm{SIS}^\infty$ anymore
by: Kothari, Robin, et al.
Published: (2025)

Near Optimal Alphabet-Soundness Tradeoff PCPs
by: Minzer, Dor, et al.
Published: (2024)

Exploration is Harder than Prediction: Cryptographically Separating Reinforcement Learning from Supervised Learning
by: Golowich, Noah, et al.
Published: (2024)

Efficient and Near-Optimal Noise Generation for Streaming Differential Privacy
by: Dvijotham, Krishnamurthy, et al.
Published: (2024)

Privately Estimating Black-Box Statistics
by: Steinke, Günter F., et al.
Published: (2025)

Average-Case Complexity of Quantum Stabilizer Decoding
by: Khesin, Andrey Boris, et al.
Published: (2025)

The NISQ Complexity of Collision Finding
by: Hamoudi, Yassine, et al.
Published: (2022)

InstaHide's Sample Complexity When Mixing Two Private Images
by: Huang, Baihe, et al.
Published: (2020)

Optimal Offline ORAM with Perfect Security via Simple Oblivious Priority Queues
by: Thießen, Thore, et al.
Published: (2024)

Time-Aware Projections: Truly Node-Private Graph Statistics under Continual Observation
by: Jain, Palak, et al.
Published: (2024)

Separating Oblivious and Adaptive Differential Privacy under Continual Observation
by: Bun, Mark, et al.
Published: (2026)

Local Node Differential Privacy
by: Raskhodnikova, Sofya, et al.
Published: (2026)

Self-referential instances of the dominating set problem are irreducible
by: Zhou, Guangyan
Published: (2026)

Quantum Channel Testing in Average-Case Distance
by: Rosenthal, Gregory, et al.
Published: (2024)

Exact Matching and Top-k Perfect Matching Parameterized by Neighborhood Diversity or Bandwidth
by: Maalouly, Nicolas El, et al.
Published: (2025)

On the Power of Interactive Proofs for Learning
by: Gur, Tom, et al.
Published: (2024)

Enabling AI ASICs for Zero Knowledge Proof
by: Tong, Jianming, et al.
Published: (2026)

Colouring $(P_r+P_s)$-Free Graphs
by: Klimošová, Tereza, et al.
Published: (2018)

Almost Instance-optimal Clipping for Summation Problems in the Shuffle Model of Differential Privacy
by: Dong, Wei, et al.
Published: (2024)

Dynamic Accountable Storage: An Efficient Protocol for Real-time Cloud Storage Auditing
by: Goodrich, Michael T., et al.
Published: (2024)

Individualized Privacy Accounting via Subsampling with Applications in Combinatorial Optimization
by: Ghazi, Badih, et al.
Published: (2024)

Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More
by: Chandra, Rishi, et al.
Published: (2024)

Adversary Resilient Learned Bloom Filters
by: Almashaqbeh, Ghada, et al.
Published: (2024)

On Learning Parities with Dependent Noise
by: Golowich, Noah, et al.
Published: (2024)

Differentially Private Substring and Document Counting with Near-Optimal Error
by: Bernardini, Giulia, et al.
Published: (2024)

On Wagner's k-Tree Algorithm Over Integers
by: Lin, Haoxing, et al.
Published: (2024)

Fine-Grained Privacy Guarantees for Coverage Problems
by: Dhulipala, Laxman, et al.
Published: (2024)

Near-Universally-Optimal Differentially Private Minimum Spanning Trees
by: Hladík, Richard, et al.
Published: (2024)

Sublinear Space Graph Algorithms in the Continual Release Model
by: Epasto, Alessandro, et al.
Published: (2024)

Improved Lower Bound for Differentially Private Facility Location
by: Manurangsi, Pasin
Published: (2024)