DOCSLIB.ORG

Foundation of Cryptography, Lecture 6 Interactive Proofs and Zero Knowledge

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Foundation of Cryptography, Lecture 6 Interactive Proofs and Zero Knowledge Foundation of Cryptography, Lecture 6 Interactive Proofs and Zero Knowledge Iftach Haitner, Tel Aviv University Tel Aviv University. April 23, 2014 Iftach Haitner (TAU) Foundation of Cryptography April 23, 2014 1 / 37 Part I Interactive Proofs Iftach Haitner (TAU) Foundation of Cryptography April 23, 2014 2 / 37 Efficient verifier, efficient prover (given the witness) Soundness holds unconditionally A proof system NP as a Non-interactive Proofs Definition 1 (NP) L 2NP iff 9 and poly-time algorithmV such that: 8x 2 L there exists w 2 f0; 1g∗ s.t. V(x; w) = 1 V(x; w) = 0 for every x 2=L and w 2 f0; 1g∗ Only jxj counts for the running time ofV. Iftach Haitner (TAU) Foundation of Cryptography April 23, 2014 3 / 37 Efficient verifier, efficient prover (given the witness) Soundness holds unconditionally NP as a Non-interactive Proofs Definition 1 (NP) L 2NP iff 9 and poly-time algorithmV such that: 8x 2 L there exists w 2 f0; 1g∗ s.t. V(x; w) = 1 V(x; w) = 0 for every x 2=L and w 2 f0; 1g∗ Only jxj counts for the running time ofV. A proof system Iftach Haitner (TAU) Foundation of Cryptography April 23, 2014 3 / 37 Soundness holds unconditionally NP as a Non-interactive Proofs Definition 1 (NP) L 2NP iff 9 and poly-time algorithmV such that: 8x 2 L there exists w 2 f0; 1g∗ s.t. V(x; w) = 1 V(x; w) = 0 for every x 2=L and w 2 f0; 1g∗ Only jxj counts for the running time ofV. A proof system Efficient verifier, efficient prover (given the witness) Iftach Haitner (TAU) Foundation of Cryptography April 23, 2014 3 / 37 NP as a Non-interactive Proofs Definition 1 (NP) L 2NP iff 9 and poly-time algorithmV such that: 8x 2 L there exists w 2 f0; 1g∗ s.t. V(x; w) = 1 V(x; w) = 0 for every x 2=L and w 2 f0; 1g∗ Only jxj counts for the running time ofV. A proof system Efficient verifier, efficient prover (given the witness) Soundness holds unconditionally Iftach Haitner (TAU) Foundation of Cryptography April 23, 2014 3 / 37 IP = PSPACE! We typically consider (and achieve) perfect completeness. Negligible “soundness error" achieved via repetition. Sometime we have efficient provers via “auxiliary input". Relaxation: Computationally sound proofs [also known as, interactive arguments]: soundness only guaranteed against efficient( PPT) provers. Definition 2 (Interactive proof) A protocol (P; V) is an interactive proof for L, ifV is PPT and: a Completeness 8x 2 L, Pr[h(P; V)(x)iV = 1] ≥ 2=3. Soundness 8x 2=L , and any algorithmP ∗ ∗ Pr[h(P ; V)(x)iV = 1] ≤ 1=3. IP is the class of languages that have interactive proofs. a h(A(a); B(b))(c)iB denoteB’s view in random execution of (A(a); B(b))(c). Interactive proofs Protocols between efficient verifier and unbounded provers. Iftach Haitner (TAU) Foundation of Cryptography April 23, 2014 4 / 37 IP = PSPACE! We typically consider (and achieve) perfect completeness. Negligible “soundness error" achieved via repetition. Sometime we have efficient provers via “auxiliary input". Relaxation: Computationally sound proofs [also known as, interactive arguments]: soundness only guaranteed against efficient( PPT) provers. Interactive proofs Protocols between efficient verifier and unbounded provers. Definition 2 (Interactive proof) A protocol (P; V) is an interactive proof for L, ifV is PPT and: a Completeness 8x 2 L, Pr[h(P; V)(x)iV = 1] ≥ 2=3. Soundness 8x 2=L , and any algorithmP ∗ ∗ Pr[h(P ; V)(x)iV = 1] ≤ 1=3. IP is the class of languages that have interactive proofs. a h(A(a); B(b))(c)iB denoteB’s view in random execution of (A(a); B(b))(c). Iftach Haitner (TAU) Foundation of Cryptography April 23, 2014 4 / 37 We typically consider (and achieve) perfect completeness. Negligible “soundness error" achieved via repetition. Sometime we have efficient provers via “auxiliary input". Relaxation: Computationally sound proofs [also known as, interactive arguments]: soundness only guaranteed against efficient( PPT) provers. Interactive proofs Protocols between efficient verifier and unbounded provers. Definition 2 (Interactive proof) A protocol (P; V) is an interactive proof for L, ifV is PPT and: a Completeness 8x 2 L, Pr[h(P; V)(x)iV = 1] ≥ 2=3. Soundness 8x 2=L , and any algorithmP ∗ ∗ Pr[h(P ; V)(x)iV = 1] ≤ 1=3. IP is the class of languages that have interactive proofs. a h(A(a); B(b))(c)iB denoteB’s view in random execution of (A(a); B(b))(c). IP = PSPACE! Iftach Haitner (TAU) Foundation of Cryptography April 23, 2014 4 / 37 Negligible “soundness error" achieved via repetition. Sometime we have efficient provers via “auxiliary input". Relaxation: Computationally sound proofs [also known as, interactive arguments]: soundness only guaranteed against efficient( PPT) provers. Interactive proofs Protocols between efficient verifier and unbounded provers. Definition 2 (Interactive proof) A protocol (P; V) is an interactive proof for L, ifV is PPT and: a Completeness 8x 2 L, Pr[h(P; V)(x)iV = 1] ≥ 2=3. Soundness 8x 2=L , and any algorithmP ∗ ∗ Pr[h(P ; V)(x)iV = 1] ≤ 1=3. IP is the class of languages that have interactive proofs. a h(A(a); B(b))(c)iB denoteB’s view in random execution of (A(a); B(b))(c). IP = PSPACE! We typically consider (and achieve) perfect completeness. Iftach Haitner (TAU) Foundation of Cryptography April 23, 2014 4 / 37 Sometime we have efficient provers via “auxiliary input". Relaxation: Computationally sound proofs [also known as, interactive arguments]: soundness only guaranteed against efficient( PPT) provers. Interactive proofs Protocols between efficient verifier and unbounded provers. Definition 2 (Interactive proof) A protocol (P; V) is an interactive proof for L, ifV is PPT and: a Completeness 8x 2 L, Pr[h(P; V)(x)iV = 1] ≥ 2=3. Soundness 8x 2=L , and any algorithmP ∗ ∗ Pr[h(P ; V)(x)iV = 1] ≤ 1=3. IP is the class of languages that have interactive proofs. a h(A(a); B(b))(c)iB denoteB’s view in random execution of (A(a); B(b))(c). IP = PSPACE! We typically consider (and achieve) perfect completeness. Negligible “soundness error" achieved via repetition. Iftach Haitner (TAU) Foundation of Cryptography April 23, 2014 4 / 37 Relaxation: Computationally sound proofs [also known as, interactive arguments]: soundness only guaranteed against efficient( PPT) provers. Interactive proofs Protocols between efficient verifier and unbounded provers. Definition 2 (Interactive proof) A protocol (P; V) is an interactive proof for L, ifV is PPT and: a Completeness 8x 2 L, Pr[h(P; V)(x)iV = 1] ≥ 2=3. Soundness 8x 2=L , and any algorithmP ∗ ∗ Pr[h(P ; V)(x)iV = 1] ≤ 1=3. IP is the class of languages that have interactive proofs. a h(A(a); B(b))(c)iB denoteB’s view in random execution of (A(a); B(b))(c). IP = PSPACE! We typically consider (and achieve) perfect completeness. Negligible “soundness error" achieved via repetition. Sometime we have efficient provers via “auxiliary input". Iftach Haitner (TAU) Foundation of Cryptography April 23, 2014 4 / 37 Interactive proofs Protocols between efficient verifier and unbounded provers. Definition 2 (Interactive proof) A protocol (P; V) is an interactive proof for L, ifV is PPT and: a Completeness 8x 2 L, Pr[h(P; V)(x)iV = 1] ≥ 2=3. Soundness 8x 2=L , and any algorithmP ∗ ∗ Pr[h(P ; V)(x)iV = 1] ≤ 1=3. IP is the class of languages that have interactive proofs. a h(A(a); B(b))(c)iB denoteB’s view in random execution of (A(a); B(b))(c). IP = PSPACE! We typically consider (and achieve) perfect completeness. Negligible “soundness error" achieved via repetition. Sometime we have efficient provers via “auxiliary input". Relaxation: Computationally sound proofs [also known as, interactive arguments]: soundness only guaranteed against efficient( PPT) provers. Iftach Haitner (TAU) Foundation of Cryptography April 23, 2014 4 / 37 Section 1 Interactive Proof for Graph Non-Isomorphism Iftach Haitner (TAU) Foundation of Cryptography April 23, 2014 5 / 37 GI = f(G0; G1): G0 ≡ G1g 2NP Does GN I = f(G0; G1): G0 6≡ G1g 2NP ? We will show a simple interactive proof for GN I Idea: Beer tasting... Graph isomorphism Πm – the set of all permutations from [m] to [m] Definition 3 (graph isomorphism) GraphsG 0 = ([m]; E0) andG 1 = ([m]; E1) are isomorphic, denotedG 0 ≡ G1, if 9π 2 Πm such that (u; v) 2 E0 iff (π(u); π(v)) 2 E1. Iftach Haitner (TAU) Foundation of Cryptography April 23, 2014 6 / 37 Idea: Beer tasting... Does GN I = f(G0; G1): G0 6≡ G1g 2NP ? We will show a simple interactive proof for GN I Graph isomorphism Πm – the set of all permutations from [m] to [m] Definition 3 (graph isomorphism) GraphsG 0 = ([m]; E0) andG 1 = ([m]; E1) are isomorphic, denotedG 0 ≡ G1, if 9π 2 Πm such that (u; v) 2 E0 iff (π(u); π(v)) 2 E1. GI = f(G0; G1): G0 ≡ G1g 2NP Iftach Haitner (TAU) Foundation of Cryptography April 23, 2014 6 / 37 Idea: Beer tasting... We will show a simple interactive proof for GN I Graph isomorphism Πm – the set of all permutations from [m] to [m] Definition 3 (graph isomorphism) GraphsG 0 = ([m]; E0) andG 1 = ([m]; E1) are isomorphic, denotedG 0 ≡ G1, if 9π 2 Πm such that (u; v) 2 E0 iff (π(u); π(v)) 2 E1. GI = f(G0; G1): G0 ≡ G1g 2NP Does GN I = f(G0; G1): G0 6≡ G1g 2NP ? Iftach Haitner (TAU) Foundation of Cryptography April 23, 2014 6 / 37 Idea: Beer tasting..
Load more

Recommended publications
  • Interactive Proof Systems and Alternating Time-Space Complexity
    Theoretical Computer Science 113 (1993) 55-73 55 Elsevier Interactive proof systems and alternating time-space complexity Lance Fortnow” and Carsten Lund** Department of Computer Science, Unicersity of Chicago. 1100 E. 58th Street, Chicago, IL 40637, USA Abstract Fortnow, L. and C. Lund, Interactive proof systems and alternating time-space complexity, Theoretical Computer Science 113 (1993) 55-73. We show a rough equivalence between alternating time-space complexity and a public-coin interactive proof system with the verifier having a polynomial-related time-space complexity. Special cases include the following: . All of NC has interactive proofs, with a log-space polynomial-time public-coin verifier vastly improving the best previous lower bound of LOGCFL for this model (Fortnow and Sipser, 1988). All languages in P have interactive proofs with a polynomial-time public-coin verifier using o(log’ n) space. l All exponential-time languages have interactive proof systems with public-coin polynomial-space exponential-time verifiers. To achieve better bounds, we show how to reduce a k-tape alternating Turing machine to a l-tape alternating Turing machine with only a constant factor increase in time and space. 1. Introduction In 1981, Chandra et al. [4] introduced alternating Turing machines, an extension of nondeterministic computation where the Turing machine can make both existential and universal moves. In 1985, Goldwasser et al. [lo] and Babai [l] introduced interactive proof systems, an extension of nondeterministic computation consisting of two players, an infinitely powerful prover and a probabilistic polynomial-time verifier. The prover will try to convince the verifier of the validity of some statement.
    [Show full text]
  • Valuative Characterization of Central Extensions of Algebraic Tori on Krull
    Valuative characterization of central extensions of algebraic tori on Krull domains ∗ Haruhisa Nakajima † Department of Mathematics, J. F. Oberlin University Tokiwa-machi, Machida, Tokyo 194-0294, JAPAN Abstract Let G be an affine algebraic group with an algebraic torus G0 over an alge- braically closed field K of an arbitrary characteristic p. We show a criterion for G to be a finite central extension of G0 in terms of invariant theory of all regular 0 actions of any closed subgroup H containing ZG(G ) on affine Krull K-schemes such that invariant rational functions are locally fractions of invariant regular func- tions. Consider an affine Krull H-scheme X = Spec(R) and a prime ideal P of R with ht(P) = ht(P ∩ RH ) = 1. Let I(P) denote the inertia group of P un- der the action of H. The group G is central over G0 if and only if the fraction e(P, P ∩ RH )/e(P, P ∩ RI(P)) of ramification indices is equal to 1 (p = 0) or to the p-part of the order of the group of weights of G0 on RI(P)) vanishing on RI(P))/P ∩ RI(P) (p> 0) for an arbitrary X and P. MSC: primary 13A50, 14R20, 20G05; secondary 14L30, 14M25 Keywords: Krull domain; ramification index; algebraic group; algebraic torus; char- acter group; invariant theory 1 Introduction 1.A. We consider affine algebraic groups and affine schemes over a fixed algebraically closed field K of an arbitrary characteristic p. For an affine group G, denote by G0 its identity component.
    [Show full text]
  • The Complexity of Space Bounded Interactive Proof Systems
    The Complexity of Space Bounded Interactive Proof Systems ANNE CONDON Computer Science Department, University of Wisconsin-Madison 1 INTRODUCTION Some of the most exciting developments in complexity theory in recent years concern the complexity of interactive proof systems, defined by Goldwasser, Micali and Rackoff (1985) and independently by Babai (1985). In this paper, we survey results on the complexity of space bounded interactive proof systems and their applications. An early motivation for the study of interactive proof systems was to extend the notion of NP as the class of problems with efficient \proofs of membership". Informally, a prover can convince a verifier in polynomial time that a string is in an NP language, by presenting a witness of that fact to the verifier. Suppose that the power of the verifier is extended so that it can flip coins and can interact with the prover during the course of a proof. In this way, a verifier can gather statistical evidence that an input is in a language. As we will see, the interactive proof system model precisely captures this in- teraction between a prover P and a verifier V . In the model, the computation of V is probabilistic, but is typically restricted in time or space. A language is accepted by the interactive proof system if, for all inputs in the language, V accepts with high probability, based on the communication with the \honest" prover P . However, on inputs not in the language, V rejects with high prob- ability, even when communicating with a \dishonest" prover. In the general model, V can keep its coin flips secret from the prover.
    [Show full text]
  • Nitin Saurabh the Institute of Mathematical Sciences, Chennai
    ALGEBRAIC MODELS OF COMPUTATION By Nitin Saurabh The Institute of Mathematical Sciences, Chennai. A thesis submitted to the Board of Studies in Mathematical Sciences In partial fulllment of the requirements For the Degree of Master of Science of HOMI BHABHA NATIONAL INSTITUTE April 2012 CERTIFICATE Certied that the work contained in the thesis entitled Algebraic models of Computation, by Nitin Saurabh, has been carried out under my supervision and that this work has not been submitted elsewhere for a degree. Meena Mahajan Theoretical Computer Science Group The Institute of Mathematical Sciences, Chennai ACKNOWLEDGEMENTS I would like to thank my advisor Prof. Meena Mahajan for her invaluable guidance and continuous support since my undergraduate days. Her expertise and ideas helped me comprehend new techniques. Her guidance during the preparation of this thesis has been invaluable. I also thank her for always being there to discuss and clarify any matter. I am extremely grateful to all the faculty members of theory group at IMSc and CMI for their continuous encouragement and giving me an opportunity to learn from them. I would like to thank all my friends, at IMSc and CMI, for making my stay in Chennai a memorable one. Most of all, I take this opportunity to thank my parents, my uncle and my brother. Abstract Valiant [Val79, Val82] had proposed an analogue of the theory of NP-completeness in an entirely algebraic framework to study the complexity of polynomial families. Artihmetic circuits form the most standard model for studying the complexity of polynomial computations. In a note [Val92], Valiant argued that in order to prove lower bounds for boolean circuits, obtaining lower bounds for arithmetic circuits should be a rst step.
    [Show full text]
  • The Complexity Zoo
    The Complexity Zoo Scott Aaronson www.ScottAaronson.com LATEX Translation by Chris Bourke [email protected] 417 classes and counting 1 Contents 1 About This Document 3 2 Introductory Essay 4 2.1 Recommended Further Reading ......................... 4 2.2 Other Theory Compendia ............................ 5 2.3 Errors? ....................................... 5 3 Pronunciation Guide 6 4 Complexity Classes 10 5 Special Zoo Exhibit: Classes of Quantum States and Probability Distribu- tions 110 6 Acknowledgements 116 7 Bibliography 117 2 1 About This Document What is this? Well its a PDF version of the website www.ComplexityZoo.com typeset in LATEX using the complexity package. Well, what’s that? The original Complexity Zoo is a website created by Scott Aaronson which contains a (more or less) comprehensive list of Complexity Classes studied in the area of theoretical computer science known as Computa- tional Complexity. I took on the (mostly painless, thank god for regular expressions) task of translating the Zoo’s HTML code to LATEX for two reasons. First, as a regular Zoo patron, I thought, “what better way to honor such an endeavor than to spruce up the cages a bit and typeset them all in beautiful LATEX.” Second, I thought it would be a perfect project to develop complexity, a LATEX pack- age I’ve created that defines commands to typeset (almost) all of the complexity classes you’ll find here (along with some handy options that allow you to conveniently change the fonts with a single option parameters). To get the package, visit my own home page at http://www.cse.unl.edu/~cbourke/.
    [Show full text]
  • UNIONS of LINES in Fn 1. Introduction the Main Problem We
    UNIONS OF LINES IN F n RICHARD OBERLIN Abstract. We show that if a collection of lines in a vector space over a finite field has \dimension" at least 2(d−1)+β; then its union has \dimension" at least d + β: This is the sharp estimate of its type when no structural assumptions are placed on the collection of lines. We also consider some refinements and extensions of the main result, including estimates for unions of k-planes. 1. Introduction The main problem we will consider here is to give a lower bound for the dimension of the union of a collection of lines in terms of the dimension of the collection of lines, without imposing a structural hy- pothesis on the collection (in contrast to the Kakeya problem where one assumes that the lines are direction-separated, or perhaps satisfy the weaker \Wolff axiom"). Specifically, we are motivated by the following conjecture of D. Ober- lin (hdim denotes Hausdorff dimension). Conjecture 1.1. Suppose d ≥ 1 is an integer, that 0 ≤ β ≤ 1; and that L is a collection of lines in Rn with hdim(L) ≥ 2(d − 1) + β: Then [ (1) hdim( L) ≥ d + β: L2L The bound (1), if true, would be sharp, as one can see by taking L to be the set of lines contained in the d-planes belonging to a β- dimensional family of d-planes. (Furthermore, there is nothing to be gained by taking 1 < β ≤ 2 since the dimension of the set of lines contained in a d + 1-plane is 2(d − 1) + 2.) Standard Fourier-analytic methods show that (1) holds for d = 1, but the conjecture is open for d > 1: As a model problem, one may consider an analogous question where Rn is replaced by a vector space over a finite-field.
    [Show full text]
  • CS 579: Computational Complexity. Lecture 2 Space Complexity
    CS 579: Computational Complexity. Lecture 2 Space complexity. Alexandra Kolla Today Space Complexity, L,NL Configuration Graphs Log- Space Reductions NL Completeness, STCONN Savitch’s theorem SL Turing machines, briefly (3-tape) Turing machine M described by tuple (Γ,Q,δ), where ◦ Γ is “alphabet” . Contains start and blank symbol, 0,1,among others (constant size). ◦ Q is set of states, including designated starting state and halt state (constant size). ◦ Transition function δ:푄 × Γ3 → 푄 × Γ2 × {퐿, 푆, 푅}3 describing the rules M uses to move. Turing machines, briefly (3-tape) NON-DETERMINISTIC Turing machine M described by tuple (Γ,Q,δ0,δ1), where ◦ Γ is “alphabet” . Contains start and blank symbol, 0,1,among others (constant size). ◦ Q is set of states, including designated starting state and halt state (constant size). ◦ Two transition functions δ0, δ1 :푄 × Γ3 → 푄 × Γ2 × {퐿, 푆, 푅}3. At every step, TM makes non- deterministic choice which one to Space bounded turing machines Space-bounded turing machines used to study memory requirements of computational tasks. Definition. Let 푠: ℕ → ℕ and 퐿 ⊆ {0,1}∗. We say that L∈ SPACE(s(n)) if there is a constant c and a TM M deciding L s.t. at most c∙s(n) locations on M’s work tapes (excluding the input tape) are ever visited by M’s head during its computation on every input of length n. We will assume a single work tape and no output tape for simplicity. Similarly for NSPACE(s(n)), TM can only use c∙s(n) nonblank tape locations, regardless of its nondeterministic choices Space bounded turing machines Read-only “input” tape.
    [Show full text]
  • Lecture 11 — October 16, 2012 1 Overview 2
    6.841: Advanced Complexity Theory Fall 2012 Lecture 11 | October 16, 2012 Prof. Dana Moshkovitz Scribe: Hyuk Jun Kweon 1 Overview In the previous lecture, there was a question about whether or not true randomness exists in the universe. This question is still seriously debated by many physicists and philosophers. However, even if true randomness does not exist, it is possible to use pseudorandomness for practical purposes. In any case, randomization is a powerful tool in algorithms design, sometimes leading to more elegant or faster ways of solving problems than known deterministic methods. This naturally leads one to wonder whether randomization can solve problems outside of P, de- terministic polynomial time. One way of viewing randomized algorithms is that for each possible setting of the random bits used, a different strategy is pursued by the algorithm. A property of randomized algorithms that succeed with bounded error is that the vast majority of strategies suc- ceed. With error reduction, all but exponentially many strategies will succeed. A major theme of theoretical computer science over the last 20 years has been to turn algorithms with this property into algorithms that deterministically find a winning strategy. From the outset, this seems like a daunting task { without randomness, how can one efficiently search for such strategies? As we'll see in later lectures, this is indeed possible, modulo some hardness assumptions. There are two main objectives in this lecture. The first objective is to introduce some probabilis- tic complexity classes, by bounding time or space. These classes are probabilistic analogues of deterministic complexity classes P and L.
    [Show full text]
  • R Z- /Li ,/Zo Rl Date Copyright 2012
    Hearing Moral Reform: Abolitionists and Slave Music, 1838-1870 by Karl Byrn A thesis submitted to Sonoma State University in partial fulfillment of the requirements for the degree of MASTER OF ARTS III History Dr. Steve Estes r Z- /Li ,/zO rL Date Copyright 2012 By Karl Bym ii AUTHORIZATION FOR REPRODUCTION OF MASTER'S THESIS/PROJECT I grant permission for the reproduction ofparts ofthis thesis without further authorization from me, on the condition that the person or agency requesting reproduction absorb the cost and provide proper acknowledgement of authorship. Permission to reproduce this thesis in its entirety must be obtained from me. iii Hearing Moral Reform: Abolitionists and Slave Music, 1838-1870 Thesis by Karl Byrn ABSTRACT Purpose ofthe Study: The purpose of this study is to analyze commentary on slave music written by certain abolitionists during the American antebellum and Civil War periods. The analysis is not intended to follow existing scholarship regarding the origins and meanings of African-American music, but rather to treat this music commentary as a new source for understanding the abolitionist movement. By treating abolitionists' reports of slave music as records of their own culture, this study will identify larger intellectual and cultural currents that determined their listening conditions and reactions. Procedure: The primary sources involved in this study included journals, diaries, letters, articles, and books written before, during, and after the American Civil War. I found, in these sources, that the responses by abolitionists to the music of slaves and freedmen revealed complex ideologies and motivations driven by religious and reform traditions, antebellum musical cultures, and contemporary racial and social thinking.
    [Show full text]
  • Collapsing Exact Arithmetic Hierarchies
    Electronic Colloquium on Computational Complexity, Report No. 131 (2013) Collapsing Exact Arithmetic Hierarchies Nikhil Balaji and Samir Datta Chennai Mathematical Institute fnikhil,[email protected] Abstract. We provide a uniform framework for proving the collapse of the hierarchy, NC1(C) for an exact arith- metic class C of polynomial degree. These hierarchies collapses all the way down to the third level of the AC0- 0 hierarchy, AC3(C). Our main collapsing exhibits are the classes 1 1 C 2 fC=NC ; C=L; C=SAC ; C=Pg: 1 1 NC (C=L) and NC (C=P) are already known to collapse [1,18,19]. We reiterate that our contribution is a framework that works for all these hierarchies. Our proof generalizes a proof 0 1 from [8] where it is used to prove the collapse of the AC (C=NC ) hierarchy. It is essentially based on a polynomial degree characterization of each of the base classes. 1 Introduction Collapsing hierarchies has been an important activity for structural complexity theorists through the years [12,21,14,23,18,17,4,11]. We provide a uniform framework for proving the collapse of the NC1 hierarchy over an exact arithmetic class. Using 0 our method, such a hierarchy collapses all the way down to the AC3 closure of the class. 1 1 1 Our main collapsing exhibits are the NC hierarchies over the classes C=NC , C=L, C=SAC , C=P. Two of these 1 1 hierarchies, viz. NC (C=L); NC (C=P), are already known to collapse ([1,19,18]) while a weaker collapse is known 0 1 for a third one viz.
    [Show full text]
  • Dspace 1.8 Documentation
    DSpace 1.8 Documentation DSpace 1.8 Documentation Author: The DSpace Developer Team Date: 03 November 2011 URL: https://wiki.duraspace.org/display/DSDOC18 Page 1 of 621 DSpace 1.8 Documentation Table of Contents 1 Preface _____________________________________________________________________________ 13 1.1 Release Notes ____________________________________________________________________ 13 2 Introduction __________________________________________________________________________ 15 3 Functional Overview ___________________________________________________________________ 17 3.1 Data Model ______________________________________________________________________ 17 3.2 Plugin Manager ___________________________________________________________________ 19 3.3 Metadata ________________________________________________________________________ 19 3.4 Packager Plugins _________________________________________________________________ 20 3.5 Crosswalk Plugins _________________________________________________________________ 21 3.6 E-People and Groups ______________________________________________________________ 21 3.6.1 E-Person __________________________________________________________________ 21 3.6.2 Groups ____________________________________________________________________ 22 3.7 Authentication ____________________________________________________________________ 22 3.8 Authorization _____________________________________________________________________ 22 3.9 Ingest Process and Workflow ________________________________________________________ 24
    [Show full text]
  • Simple Doubly-Efficient Interactive Proof Systems for Locally
    Electronic Colloquium on Computational Complexity, Revision 3 of Report No. 18 (2017) Simple doubly-efficient interactive proof systems for locally-characterizable sets Oded Goldreich∗ Guy N. Rothblumy September 8, 2017 Abstract A proof system is called doubly-efficient if the prescribed prover strategy can be implemented in polynomial-time and the verifier’s strategy can be implemented in almost-linear-time. We present direct constructions of doubly-efficient interactive proof systems for problems in P that are believed to have relatively high complexity. Specifically, such constructions are presented for t-CLIQUE and t-SUM. In addition, we present a generic construction of such proof systems for a natural class that contains both problems and is in NC (and also in SC). The proof systems presented by us are significantly simpler than the proof systems presented by Goldwasser, Kalai and Rothblum (JACM, 2015), let alone those presented by Reingold, Roth- blum, and Rothblum (STOC, 2016), and can be implemented using a smaller number of rounds. Contents 1 Introduction 1 1.1 The current work . 1 1.2 Relation to prior work . 3 1.3 Organization and conventions . 4 2 Preliminaries: The sum-check protocol 5 3 The case of t-CLIQUE 5 4 The general result 7 4.1 A natural class: locally-characterizable sets . 7 4.2 Proof of Theorem 1 . 8 4.3 Generalization: round versus computation trade-off . 9 4.4 Extension to a wider class . 10 5 The case of t-SUM 13 References 15 Appendix: An MA proof system for locally-chracterizable sets 18 ∗Department of Computer Science, Weizmann Institute of Science, Rehovot, Israel.
    [Show full text]