2024 Proceeding- General Chairs:
- Bojan Mohar,
- Igor Shinkar,
- Program Chair:
- Ryan O'Donnell
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.
Memory Checking Requires Logarithmic Overhead
We study the complexity of memory checkers with computational security and prove the first general tight lower bound.
Memory checkers, first introduced over 30 years ago by Blum, Evans, Gemmel, Kannan, and Naor (FOCS ’91, Algorithmica ’94), allow a user ...
Perfect Zero-Knowledge PCPs for #P
We construct perfect zero-knowledge probabilistically checkable proofs (PZK-PCPs) for every language in #P. This is the first construction of a PZK-PCP for any language outside BPP. Furthermore, unlike previous constructions of (statistical) zero-...
One-Way Functions and Zero Knowledge
The fundamental theorem of Goldreich, Micali, and Wigderson (J. ACM 1991) shows that the existence of a one-way function is sufficient for constructing computational zero knowledge (CZK) proofs for all languages in NP. We prove its converse, thereby ...
Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman Problem
In the (preprocessing) Decisional Diffie-Hellman (DDH) problem, we are given a cyclic group G with a generator g and a prime order N, and want to prepare some advice of S, such that we can efficiently distinguish (gx,gy,gxy) from (gx,gy,gz) in time T ...
SNARGs under LWE via Propositional Proofs
We construct a succinct non-interactive argument (SNARG) system for every NP language L that has a propositional proof of non-membership, i.e. of x∉ L. The soundness of our SNARG system relies on the hardness of the learning with errors (LWE) problem. ...
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% |