The papers in this volume were presented at the 56th Annual ACM Symposium on Theory of Computing (STOC 2024), sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT). The conference was held in Vancouver, Canada, June 24--28, 2024, with the papers being presented as live talks.
Adaptively-Sound Succinct Arguments for NP from Indistinguishability Obfuscation
A succinct non-interactive argument (SNARG) for NP allows a prover to convince a verifier that an NP statement x is true with a proof of size o(|x| + |w|), where w is the associated NP witness. A SNARG satisfies adaptive soundness if the malicious prover ...
A New Approach for Non-Interactive Zero-Knowledge from Learning with Errors
We put forward a new approach for achieving non-interactive zero-knowledge proofs (NIKZs) from the learning with errors (LWE) assumption (with subexponential modulus to noise ratio). We provide a LWE-based construction of a hidden bits generator that ...
Optimal Load-Balanced Scalable Distributed Agreement
We consider the fundamental problem of designing classical consensus-related distributed abstractions for large-scale networks, where the number of parties can be huge. Specifically, we consider tasks such as Byzantine Agreement, Broadcast, and Committee ...
Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice-Based SNARKs
The Learning With Errors (LWE) problem asks to find s from an input of the form (A, b = As+e) ∈ (ℤ/qℤ)m × n × (ℤ/qℤ)m, for a vector e that has small-magnitude entries. In this work, we do not focus on solving LWE but on the task of sampling instances. ...
Batch Proofs Are Statistically Hiding
Batch proofs are proof systems that convince a verifier that x1,…,xt ∈ L, for some NP language L, with communication that is much shorter than sending the t witnesses. In the case of statistical soundness (where the cheating prover is unbounded but the ...
Index Terms
- Proceedings of the 56th Annual ACM Symposium on Theory of Computing
Recommendations
Acceptance Rates
Year | Submitted | Accepted | Rate |
---|---|---|---|
STOC '15 | 347 | 93 | 27% |
STOC '14 | 319 | 91 | 29% |
STOC '13 | 360 | 100 | 28% |
STOC '11 | 304 | 84 | 28% |
STOC '08 | 325 | 80 | 25% |
STOC '03 | 270 | 80 | 30% |
STOC '02 | 287 | 91 | 32% |
STOC '01 | 230 | 83 | 36% |
STOC '00 | 182 | 85 | 47% |
STOC '98 | 169 | 75 | 44% |
STOC '97 | 211 | 75 | 36% |
STOC '96 | 201 | 74 | 37% |
STOC '89 | 196 | 56 | 29% |
STOC '88 | 192 | 53 | 28% |
STOC '87 | 165 | 50 | 30% |
STOC '80 | 125 | 47 | 38% |
STOC '79 | 111 | 37 | 33% |
STOC '78 | 120 | 38 | 32% |
STOC '77 | 87 | 31 | 36% |
STOC '76 | 83 | 30 | 36% |
STOC '75 | 87 | 31 | 36% |
STOC '74 | 95 | 35 | 37% |
STOC '71 | 50 | 23 | 46% |
STOC '70 | 70 | 27 | 39% |
Overall | 4,586 | 1,469 | 32% |