Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing最新文献

筛选
英文 中文
Circuits resilient to short-circuit errors 对短路错误有弹性的电路
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing Pub Date : 2022-06-09 DOI: 10.1145/3519935.3520007
K. Efremenko, Bernhard Haeupler, Y. Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena
{"title":"Circuits resilient to short-circuit errors","authors":"K. Efremenko, Bernhard Haeupler, Y. Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena","doi":"10.1145/3519935.3520007","DOIUrl":"https://doi.org/10.1145/3519935.3520007","url":null,"abstract":"Given a Boolean circuit C, we wish to convert it to a circuit C′ that computes the same function as C even if some of its gates suffer from adversarial short circuit errors, i.e., their output is replaced by the value of one of their inputs. Can we design such a resilient circuit C′ whose size is roughly comparable to that of C? Prior work gave a positive answer for the special case where C is a formula. We study the general case and show that any Boolean circuit C of size s can be converted to a new circuit C′ of quasi-polynomial size sO(logs) that computes the same function as C even if a 1/51 fraction of the gates on any root-to-leaf path in C′ are short circuited. Moreover, if the original circuit C is a formula, the resilient circuit C′ is of near-linear size s1+є. The construction of our resilient circuits utilizes the connection between circuits and DAG-like communication protocols, originally introduced in the context of proof complexity.","PeriodicalId":426164,"journal":{"name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115798322","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Explicit binary tree codes with sub-logarithmic size alphabet 显式二叉树代码与次对数大小的字母表
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing Pub Date : 2022-06-09 DOI: 10.1145/3519935.3520033
Inbar Ben Yaacov, Gil Cohen, Tal Yankovitz
{"title":"Explicit binary tree codes with sub-logarithmic size alphabet","authors":"Inbar Ben Yaacov, Gil Cohen, Tal Yankovitz","doi":"10.1145/3519935.3520033","DOIUrl":"https://doi.org/10.1145/3519935.3520033","url":null,"abstract":"Since they were first introduced by Schulman (STOC 1993), the construction of tree codes remained an elusive open problem. The state-of-the-art construction by Cohen, Haeupler and Schulman (STOC 2018) has constant distance and (logn)e colors for some constant e > 1 that depends on the distance, where n is the depth of the tree. Insisting on a constant number of colors at the expense of having vanishing distance, Gelles, Haeupler, Kol, Ron-Zewi, and Wigderson (SODA 2016) constructed a distance Ω(1/logn) tree code. In this work we improve upon these prior works and construct a distance-δ tree code with (logn)O(√δ) colors. This is the first construction of a constant distance tree code with sub-logarithmic number of colors. Moreover, as a direct corollary we obtain a tree code with a constant number of colors and distance Ω(1/(loglogn)2), exponentially improving upon the above-mentioned work by Gelles et al.","PeriodicalId":426164,"journal":{"name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130044430","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Directed flow-augmentation 导演flow-augmentation
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing Pub Date : 2022-06-09 DOI: 10.1145/3519935.3520018
Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
{"title":"Directed flow-augmentation","authors":"Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström","doi":"10.1145/3519935.3520018","DOIUrl":"https://doi.org/10.1145/3519935.3520018","url":null,"abstract":"We show a flow-augmentation algorithm in directed graphs: There exists a randomized polynomial-time algorithm that, given a directed graph G, two integers s,t ∈ V(G), and an integer k, adds (randomly) to G a number of arcs such that for every minimal st-cut Z in G of size at most k, with probability 2−poly(k) the set Z becomes a minimum st-cut in the resulting graph. The directed flow-augmentation tool allows us to prove (randomized) fixed-parameter tractability of a number of problems parameterized by the cardinality of the deletion set, whose parameterized complexity status was repeatedly posed as open problems: Chain SAT, defined by Chitnis, Egri, and Marx [ESA’13, Algorithmica’17], a number of weighted variants of classic directed cut problems, such as Weighted st-Cut, Weighted Directed Feedback Vertex Set, or Weighted Almost 2-SAT. By proving that Chain SAT is (randomized) FPT, we confirm a conjecture of Chitnis, Egri, and Marx that, for any graph H, if the List H-Coloring problem is polynomial-time solvable, then the corresponding vertex-deletion problem is fixed-parameter tractable (with the remark that our algorithms are randomized).","PeriodicalId":426164,"journal":{"name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130215601","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Expanders via local edge flips in quasilinear time 拟线性时间内通过局部边缘翻转的膨胀器
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing Pub Date : 2022-06-09 DOI: 10.1145/3519935.3520022
George Giakkoupis
{"title":"Expanders via local edge flips in quasilinear time","authors":"George Giakkoupis","doi":"10.1145/3519935.3520022","DOIUrl":"https://doi.org/10.1145/3519935.3520022","url":null,"abstract":"Mahlmann and Schindelhaue (2005) proposed the following simple process, called flip-chain, for transforming any given connected d-regular graph into a d-regular expander: In each step, a random 3-path abcd is selected, and edges ab and cd are replaced by two new edges ac and bd, provided that ac and bd do not exist already. A motivation for the study of the flip-chain arises in the design of overlay networks, where it is common practice that adjacent nodes periodically exchange random neighbors, to maintain good connectivity properties. It is known that the flip-chain converges to the uniform distribution over connected d-regular graphs, and it is conjectured that an expander graph is obtained after O(ndlogn) steps, w.h.p., where n is the number of vertices. However, the best known upper bound on the number of steps is O(n2d2√logn), and the best bound on the mixing time of the chain is O(n16d36logn). We provide a new analysis of a natural flip-chain instantiation, which shows that starting from any connected d-regular graph, for d = Ω(log2 n), an expander is obtained after O(ndlog2n) steps, w.h.p. This result is tight within logarithmic factors, and almost matches the conjectured bound. Moreover, it justifies the use of edge flip operations in practice: for any d-regular graph with d = poly(logn), an expander is reached after each vertex participates in at most poly(logn) operations, w.h.p. Our analysis is arguably more elementary than previous approaches. It uses the novel notion of the strain of a cut, a value that depends both on the crossing edges and their adjacent edges. By keeping track of the cut strains, we form a recursive argument that bounds the time before all sets of a given size have large expansion, after all smaller sets have already attained large expansion.","PeriodicalId":426164,"journal":{"name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131634200","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication 迭代矩阵乘法的集多元线性和非交换公式下界
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing Pub Date : 2022-06-09 DOI: 10.1145/3519935.3520044
Sébastien Tavenas, N. Limaye, S. Srinivasan
{"title":"Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication","authors":"Sébastien Tavenas, N. Limaye, S. Srinivasan","doi":"10.1145/3519935.3520044","DOIUrl":"https://doi.org/10.1145/3519935.3520044","url":null,"abstract":"An Algebraic Formula for a polynomial P∈ [x1,…,xN] is an algebraic expression for P(x1,…,xN) using variables, field constants, additions and multiplications. Such formulas capture an algebraic analog of the Boolean complexity class NC1. Proving lower bounds against this model is thus an important problem. It is known that, to prove superpolynomial lower bounds against algebraic formulas, it suffices to prove good enough lower bounds against restricted kinds of formulas known as Set-Multilinear formulas, for computing a polynomial P(x1,...,xN) of degree O(logN/loglogN). In the past, many superpolynomial lower bounds were found, but they are of the form Ω(f(d) poly(N)) (where f is typically a subexponential function) which is insufficient to get lower bounds for general formulas. Recently, the authors proved the first non-FPT lower bounds, i.e., a lower bound of the form NΩ(f(d)), against small-depth set-multilinear formulas (and also for circuits). In this work, we extend this result in two directions. Large-depth set-multilinear formulas. In the setting of general set-multilinear formulas, we prove a lower bound of (logn)Ω(logd) for computing the Iterated Matrix Multiplication polynomial IMMn,d. In particular, this implies the first superpolynomial lower bound against unbounded-depth set-multilinear formulas computing IMMn,n. As a corollary, this resolves the homogeneous version of a question of Nisan (asked in 1991) regarding the relative power of Algebraic formulas and Branching programs in the non-commutative setting. Stronger bounds for homogeneous non-commutative small-depth circuits. In the small-depth homogeneous non-commutative case, we prove a lower bound of nd1/Δ/2O(Δ), which yields non-FPT bounds for depths up to o(√logd). In comparison, our previous bound works in the harder commutative set-multilinear setting, but only up to depths o(loglogd). Moreover, our lower bound holds for all values of d, as opposed to the previous set-multilinear lower bound, which holds as long as d is small, i.e., d = O(logn).","PeriodicalId":426164,"journal":{"name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122003519","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Robustness of average-case meta-complexity via pseudorandomness 基于伪随机的平均情况元复杂度的鲁棒性
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing Pub Date : 2022-06-09 DOI: 10.1145/3519935.3520051
Rahul Ilango, Hanlin Ren, R. Santhanam
{"title":"Robustness of average-case meta-complexity via pseudorandomness","authors":"Rahul Ilango, Hanlin Ren, R. Santhanam","doi":"10.1145/3519935.3520051","DOIUrl":"https://doi.org/10.1145/3519935.3520051","url":null,"abstract":"We show broad equivalences in the average-case complexity of many different meta-complexity problems, including Kolmogorov complexity, time-bounded Kolmogorov complexity, and the Minimum Circuit Size Problem. These results hold for a wide range of parameters (various thresholds, approximation gaps, weak or strong average-case hardness, etc.) and complexity notions, showing the theory of meta-complexity is very *robust* in the average-case setting. Our results are shown by establishing new and generic connections between meta-complexity and the theory of pseudorandomness and one-way functions. Using these connections, we give the first unconditional characterization of one-way functions based on the average-case hardness of the Minimum Circuit Size Problem. We also give a surprising and clean characterization of one-way functions based on the average-case hardness of (the worst-case uncomputable) Kolmogorov complexity. Moreover, the latter is the first characterization of one-way functions based on the average-case hardness of a fixed problem on *any* samplable distribution. We give various applications of these results to the foundations of cryptography and the theory of meta-complexity. For example, we show that the average-case hardness of deciding k-SAT or Clique on any samplable distribution of high enough entropy implies the existence of one-way functions. We also use our results to unconditionally solve various meta-complexity problems in CZK (computational zero-knowledge) on average, and give implications of our results for the classic question of proving NP-hardness for the Minimum Circuit Size Problem.","PeriodicalId":426164,"journal":{"name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129976921","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Distributed ∆-coloring plays hide-and-seek 分布∆-着色玩捉迷藏
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing Pub Date : 2022-06-09 DOI: 10.1145/3519935.3520027
A. Balliu, S. Brandt, F. Kuhn, D. Olivetti
{"title":"Distributed ∆-coloring plays hide-and-seek","authors":"A. Balliu, S. Brandt, F. Kuhn, D. Olivetti","doi":"10.1145/3519935.3520027","DOIUrl":"https://doi.org/10.1145/3519935.3520027","url":null,"abstract":"We prove several new tight or near-tight distributed lower bounds for classic symmetry breaking problems in graphs. As a basic tool, we first provide a new insightful proof that any deterministic distributed algorithm that computes a Δ-coloring on Δ-regular trees requires Ω(logΔn) rounds and any randomized such algorithm requires Ω(logΔlogn) rounds. We prove this by showing that a natural relaxation of the Δ-coloring problem is a fixed point in the round elimination framework. As a first application, we show that our Δ-coloring lower bound proof directly extends to arbdefective colorings. An arbdefective c-coloring of a graph G=(V,E) is given by a c-coloring of V and an orientation of E, where the arbdefect of a color i is the maximum number of monochromatic outgoing edges of any node of color i. We exactly characterize which variants of the arbdefective coloring problem can be solved in O(f(Δ) + log*n) rounds, for some function f, and which of them instead require Ω(logΔn) rounds for deterministic algorithms and Ω(logΔlogn) rounds for randomized ones. As a second application, which we see as our main contribution, we use the structure of the fixed point as a building block to prove lower bounds as a function of Δ for problems that, in some sense, are much easier than Δ-coloring, as they can be solved in O(log* n) deterministic rounds in bounded-degree graphs. More specifically, we prove lower bounds as a function of Δ for a large class of distributed symmetry breaking problems, which can all be solved by a simple sequential greedy algorithm. For example, we obtain novel results for the fundamental problem of computing a (2,β)-ruling set, i.e., for computing an independent set S⊆ V such that every node v∈ V is within distance ≤ β of some node in S. We in particular show that Ω(βΔ1/β) rounds are needed even if initially an O(Δ)-coloring of the graph is given. With an initial O(Δ)-coloring, this lower bound is tight and without, it still nearly matches the existing O(βΔ2/(β+1)+log* n) upper bound. The new (2,β)-ruling set lower bound is an exponential improvement over the best existing lower bound for the problem, which was proven in [FOCS ’20]. As a special case of the lower bound, we also obtain a tight linear-in-Δ lower bound for computing a maximal independent set (MIS) in trees. While such an MIS lower bound was known for general graphs, the best previous MIS lower bounds for trees was Ω(logΔ). Our lower bound even applies to a much more general family of problems that allows for almost arbitrary combinations of natural constraints from coloring problems, orientation problems, and independent set problems, and provides a single unified proof for known and new lower bound results for these types of problems. All of our lower bounds as a function of Δ also imply substantial lower bounds as a function of n. For instance, we obtain that the maximal independent set problem, on trees, requires Ω(logn / loglogn) rounds for deterministic algorithms, w","PeriodicalId":426164,"journal":{"name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132998203","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
Verifying the unseen: interactive proofs for label-invariant distribution properties 验证看不见的:标签不变分布属性的交互式证明
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing Pub Date : 2022-06-09 DOI: 10.1145/3519935.3519987
T. Herman, G. Rothblum
{"title":"Verifying the unseen: interactive proofs for label-invariant distribution properties","authors":"T. Herman, G. Rothblum","doi":"10.1145/3519935.3519987","DOIUrl":"https://doi.org/10.1145/3519935.3519987","url":null,"abstract":"Given i.i.d. samples from an unknown distribution over a large domain [N], approximating several basic quantities, including the distribution’s support size, its entropy, and its distance from the uniform distribution, requires Θ(N / logN) samples [Valiant and Valiant, STOC 2011]. Suppose, however, that we can interact with a powerful but untrusted prover, who knows the entire distribution (or a good approximation of it). Can we use such a prover to approximate (or rather, to approximately verify) such statistical quantities more efficiently? We show that this is indeed the case: the support size, the entropy, and the distance from the uniform distribution, can all be approximately verified via a 2-message interactive proof, where the communication complexity, the verifier’s running time, and the sample complexity are O(√N). For all these quantities, the sample complexity is tight up to polylog N factors (for any interactive proof, regardless of its communication complexity or verification time). More generally, we give a tolerant interactive proof system with the above sample and communication complexities for verifying a distribution’s proximity to any label-invariant property (any property that is invariant to re-labeling of the elements in the distribution’s support). The verifier’s running time in this more general protocol is also O(√N), under a mild assumption about the complexity of deciding, given a compact representation of a distribution, whether it is in the property or far from it.","PeriodicalId":426164,"journal":{"name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133160506","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Bypassing the surface embedding: approximation schemes for network design in minor-free graphs 绕过曲面嵌入:无次次图中网络设计的近似方案
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing Pub Date : 2022-06-09 DOI: 10.1145/3519935.3520049
Vincent Cohen-Addad
{"title":"Bypassing the surface embedding: approximation schemes for network design in minor-free graphs","authors":"Vincent Cohen-Addad","doi":"10.1145/3519935.3520049","DOIUrl":"https://doi.org/10.1145/3519935.3520049","url":null,"abstract":"Since the mid 90s, the study of the complexity of classic network design problems such as the traveling salesman problem (TSP), the Steiner tree problem (ST), or the k-MST problem on metric spaces such as low-dimensional Euclidean spaces, doubling metrics, planar or minor-free graphs, has led to major improvements of our understanding of the structure of both these important metric spaces, and the underlying problems. In their celebrated work, Arora and Mitchell gave quasi polynomial-time approximation schemes (QPTAS) for several network design problems in Euclidean space, that have later been improved to polynomial and (near-)linear in some cases. Arora and Mitchell’s QPTAS result has been extended by Talwar [STOC’04] to doubling metrics showing that the Euclidean embedding is not a necessary condition to design approximation schemes for network design problems. In the case of planar and more broadly minor-free graphs, the picture is much less satisfactory. For example, nothing better than the general case is known for k-MST, an open question that has thus been repeatedly asked. Even when approximation schemes are known for the planar case, generalizing them to the minor-free setting is often a major challenge because most of the topological properties are lost. Therefore, one of the most important question of the field is whether we can bypass these topological arguments to obtain a general framework for network design problems in minor-free graphs, similar to Arora, Mitchell and Talwar’s? In this paper, we answer this question in the affirmative by proposing a framework for network design problems in minor-free graphs. We give the first approximation schemes, with quasi-polynomial running time, for k-MST, Steiner tree, and Steiner forest in minor-free graphs. The result on k-MST was not known before even for the planar case, and obtaining approximation schemes for Steiner tree on minor-free graphs has been a major open problem.cczc","PeriodicalId":426164,"journal":{"name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116878466","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Proving as fast as computing: succinct arguments with constant prover overhead 证明和计算一样快:简洁的参数和恒定的证明器开销
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing Pub Date : 2022-06-09 DOI: 10.1145/3519935.3519956
Noga Ron-Zewi, R. Rothblum
{"title":"Proving as fast as computing: succinct arguments with constant prover overhead","authors":"Noga Ron-Zewi, R. Rothblum","doi":"10.1145/3519935.3519956","DOIUrl":"https://doi.org/10.1145/3519935.3519956","url":null,"abstract":"Succinct arguments are proof systems that allow a powerful, but untrusted, prover to convince a weak verifier that an input x belongs to a language L ∈ NP, with communication that is much shorter than the NP witness. Such arguments, which grew out of the theory literature, are now drawing immense interest also in practice, where a key bottleneck that has arisen is the high computational cost of proving correctness. In this work we address this problem by constructing succinct arguments for general computations, expressed as Boolean circuits (of bounded fan-in), with a strictly linear size prover. The soundness error of the protocol is an arbitrarily small constant. Prior to this work, succinct arguments were known with a quasi-linear size prover for general Boolean circuits or with linear-size only for arithmetic circuits, defined over large finite fields. In more detail, for every Boolean circuit C=C(x,w), we construct an O(log|C|)-round argument-system in which the prover can be implemented by a size O(|C|) Boolean circuit (given as input both the instance x and the witness w), with arbitrarily small constant soundness error and using poly(λ,log|C|) communication, where λ denotes the security parameter. The verifier can be implemented by a size O(|x|) + poly(λ, log|C|) circuit following a size O(|C|) private pre-processing step, or, alternatively, by using a purely public-coin protocol (with no pre-processing) with a size O(|C|) verifier. The protocol can be made zero-knowledge using standard techniques (and with similar parameters). The soundness of our protocol is computational and relies on the existence of collision resistant hash functions that can be computed by linear-size circuits, such as those proposed by Applebaum et al. (ITCS, 2017). At the heart of our construction is a new information-theoretic interactive oracle proof (IOP), an interactive analog of a PCP, for circuit satisfiability, with constant prover overhead. The improved efficiency of our IOP is obtained by bypassing a barrier faced by prior IOP constructions, which needed to (either explicitly or implicitly) encode the entire computation using a multiplication code.","PeriodicalId":426164,"journal":{"name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115028542","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 19
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书