The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
On The Complexity Of Matrix Group Problems I
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Riemann's hypothesis and tests for primality
Journal of Computer and System Sciences
Private coins versus public coins in interactive proof systems
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The complexity of perfect zero-knowledge
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
How to prove all NP-statements in zero-knowledge, and a methodology of cryptographic protocol design
Proceedings on Advances in cryptology---CRYPTO '86
Zero-knowledge simulation of Boolean circuits
Proceedings on Advances in cryptology---CRYPTO '86
Achieving independence in logarithmic number of rounds
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy
Journal of the ACM (JACM)
Everything provable is provable in zero-knowledge
CRYPTO '88 Proceedings on Advances in cryptology
Zero-knowledge with finite state verifiers (invited talk)
CRYPTO '88 Proceedings on Advances in cryptology
CRYPTO '88 Proceedings on Advances in cryptology
Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Local expansion of vertex-transitive graphs and random generation in finite groups
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Making conditionally secure cryptosystems unconditionally abuse-free in a general context
CRYPTO '89 Proceedings on Advances in cryptology
How convincing is your protocol?
ACM SIGACT News
Space-bounded probabilistic game automata
Journal of the ACM (JACM)
Average case intractability of matrix and diophantine problems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the hardness of computing the permanent of random matrices (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Making zero-knowledge provers efficient
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Deciding finiteness of matrix groups in Las Vegas polynomial time
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Finite state verifiers I: the power of interaction
Journal of the ACM (JACM)
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
A taxonomy of proof systems (part 2)
ACM SIGACT News
PSPACE is provable by two provers in one round
Journal of Computer and System Sciences
The random oracle hypothesis is false
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Receipt-free secret-ballot elections (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Knowledge on the average—perfect, statistical and logarithmic
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Adaptive zero knowledge and computational equivocation (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On relationships between statistical zero-knowledge proofs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A General Zero-Knowledge Scheme
Designs, Codes and Cryptography
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
On the limits of non-approximability of lattice problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On the complexity of computing short linearly independent vectors and short bases in a lattice
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Some facets of complexity theory and cryptography: A five-lecture tutorial
ACM Computing Surveys (CSUR)
In search of an easy witness: exponential time vs. probabilistic polynomial time
Journal of Computer and System Sciences - Complexity 2001
The Complexity of the Extended GCD Problem
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
On Interactive Proofs with a Laconic Prover
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Some Results on Derandomization
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On Higher Arthur-Merlin Classes
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Honest Verifier vs Dishonest Verifier in Public Cain Zero-Knowledge Proofs
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
PSPACE has constant-round quantum interactive proof systems
Theoretical Computer Science - Algorithms,automata, complexity and games
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
PSPACE Has Constant-Round Quantum Interactive Proof Systems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Derandomizing Arthur-Merlin Games Using Hitting Sets
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Quantum multi-prover interactive proof systems with limited prior entanglement
Journal of Computer and System Sciences
Information and Computation
On interactive proofs with a laconic prover
Computational Complexity
Simple extractors for all min-entropies and a new pseudorandom generator
Journal of the ACM (JACM)
Beyond NP: the work and legacy of Larry Stockmeyer
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Quantum Information and the PCP Theorem
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Theoretical Computer Science - Mathematical foundations of computer science 2004
Resource bounded symmetry of information revisited
Theoretical Computer Science - Mathematical foundations of computer science 2004
On basing one-way functions on NP-hardness
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A note on the circuit complexity of PP
Theoretical Computer Science
Progress in computational complexity theory
Journal of Computer Science and Technology
Derandomizing Arthur-Merlin games using hitting sets
Computational Complexity
LWPP and WPP are not uniformly gap-definable
Journal of Computer and System Sciences
Information and Computation
Error-bounded probabilistic computations between MA and AM
Journal of Computer and System Sciences
Journal of Computer and System Sciences
The PCP theorem by gap amplification
Journal of the ACM (JACM)
Verifying and decoding in constant depth
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Toward a general theory of quantum games
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Pseudorandomness for Approximate Counting and Sampling
Computational Complexity
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy
Theoretical Computer Science
A survey of lower bounds for satisfiability and related problems
Foundations and Trends® in Theoretical Computer Science
Delegating computation: interactive proofs for muggles
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Perfect zero-knowledge languages can be recognized in two rounds
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Interactive proof systems: Provers that never fail and random selection
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
On the cunning power of cheating verifiers: Some observations about zero knowledge proofs
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Generic oracles and oracle classes
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
On the Complexity of Succinct Zero-Sum Games
Computational Complexity
Probabilistic Proof Systems: A Primer
Foundations and Trends® in Theoretical Computer Science
Lower Bounds for Swapping Arthur and Merlin
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
An application of quantum finite automata to interactive proof systems
Journal of Computer and System Sciences
Polynomial-time theory of matrix groups
Proceedings of the forty-first annual ACM symposium on Theory of computing
Computation of equilibriain noncooperative games
Computers & Mathematics with Applications
Information and Computation
The relativized relationship between probabilistically checkable debate systems, IP and PSPACE
Information Processing Letters
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
On the complexity of hyperelliptic discrete logarithm problem
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
The complexity of zero knowledge
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Proceedings of the forty-second ACM symposium on Theory of computing
Communications of the ACM
From secrecy to soundness: efficient verification via secure computation
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Non-interactive verifiable computing: outsourcing computation to untrusted workers
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Improved delegation of computation using fully homomorphic encryption
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
On the use of financial data as a random beacon
EVT/WOTE'10 Proceedings of the 2010 international conference on Electronic voting technology/workshop on trustworthy elections
Solvable Group Isomorphism Is (Almost) in NP ∩ coNP
ACM Transactions on Computation Theory (TOCT)
Complexity classes of equivalence problems revisited
Information and Computation
Adptive quantum computation, constant depth quantum circuits and arthur-merlin games
Quantum Information & Computation
The complexity of stoquastic local Hamiltonian problems
Quantum Information & Computation
Finite groups and complexity theory: from leningrad to saint petersburg via las vegas
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
On perfect completeness for QMA
Quantum Information & Computation
Another proof that BPP ⊆ PH (and more)
Studies in complexity and cryptography
Verifiable delegation of computation over large datasets
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Journal of the ACM (JACM)
Trust extension as a mechanism for secure code execution on commodity computers
Trust extension as a mechanism for secure code execution on commodity computers
Practical verified computation with streaming interactive proofs
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Quantum interactive proofs with weak error bounds
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Entanglement in interactive proof systems with binary answers
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
On graph isomorphism for restricted graph classes
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
An efficient parallel repetition theorem
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Code equivalence and group isomorphism
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Quantum interactive proofs with competing provers
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Relations between average-case and worst-case complexity
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
An application of quantum finite automata to interactive proof systems (extended abstract)
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
The complexity of quasigroup isomorphism and the minimum generating set problem
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Arthur-Merlin games and the problem of isomorphism testing
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
The multiparty communication complexity of set disjointness
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems
Quantum Information & Computation
Publicly verifiable delegation of large polynomials and matrix computations, with applications
Proceedings of the 2012 ACM conference on Computer and communications security
Stronger methods of making quantum interactive proofs perfectly complete
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Multi-Client non-interactive verifiable computation
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Algebraic (trapdoor) one-way functions and their applications
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Classical, quantum and nonsignalling resources in bipartite games
Theoretical Computer Science
Communication lower bounds using directional derivatives
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Guest column: the quantum PCP conjecture
ACM SIGACT News
Verifiable delegation of computation on outsourced data
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
ACM SIGOPS 24th Symposium on Operating Systems Principles
Verifying computations with state
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
Verifying the correctness of remote executions: from wild implausibility to near practicality
Proceedings of the 9th Workshop on Hot Topics in Dependable Systems
On the automorphism groups of strongly regular graphs I
Proceedings of the 5th conference on Innovations in theoretical computer science
Outsourcing computation of modular exponentiations in cloud computing
Cluster Computing
Hi-index | 0.02 |
In a previous paper [BS] we proved, using the elements of the theory of nilpotent groups, that some of the fundamental computational problems in matriz groups belong to NP. These problems were also shown to belong to coNP, assuming an unproven hypothesis concerning finite simple groups.The aim of this paper is to replace most of the (proven and unproven) group theory of [BS] by elementary combinatorial arguments. The result we prove is that relative to a random oracle B, the mentioned matrix group problems belong to (NP∩coNP)B.The problems we consider are membership in and order of a matrix group given by a list of generators. These problems can be viewed as multidimensional versions of a close relative of the discrete logarithm problem. Hence NP∩coNP might be the lowest natural complexity class they may fit in.We remark that the results remain valid for black box groups where group operations are performed by an oracle.The tools we introduce seem interesting in their own right. We define a new hierarchy of complexity classes AM(k) “just above NP”, introducing Arthur vs. Merlin games, the bounded-away version of Papdimitriou's Games against Nature. We prove that in spite of their analogy with the polynomial time hierarchy, the finite levels of this hierarchy collapse to AM=AM(2). Using a combinatorial lemma on finite groups [BE], we construct a game by which the nondeterministic player (Merlin) is able to convince the random player (Arthur) about the relation [G]=N provided Arthur trusts conclusions based on statistical evidence (such as a Slowly-Strassen type “proof” of primality).One can prove that AM consists precisely of those languages which belong to NPB for almost every oracle B.Our hierarchy has an interesting, still unclarified relation to another hierarchy, obtained by removing the central ingredient from the User vs. Expert games of Goldwasser, Micali and Rackoff.