The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The complexity of approximate counting
STOC '83 Proceedings of the fifteenth 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
The complexity of perfect zero-knowledge
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Zero knowledge proofs of identity
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
Non-interactive zero-knowledge and its applications
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A knowledge-based analysis of zero knowledge
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Designing programs that check their work
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of 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
Proving security against chosen cyphertext attacks
CRYPTO '88 Proceedings on Advances in cryptology
CRYPTO '88 Proceedings on Advances in cryptology
CRYPTO '88 Proceedings on Advances in cryptology
The computational complexity of universal hashing
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Space-bounded probabilistic game automata
Journal of the ACM (JACM)
Finite state verifiers I: the power of interaction
Journal of the ACM (JACM)
Finite state verifiers II: zero knowledge
Journal of the ACM (JACM)
Journal of the ACM (JACM)
ACM SIGACT News
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
A taxonomy of proof systems (part 2)
ACM SIGACT News
The random oracle hypothesis is false
Journal of Computer and System Sciences
Combinatorial techniques for universal hashing
Journal of Computer and System Sciences
Journal of Computer and System Sciences
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The amazing power of pairwise independence (abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the limits of non-approximability of lattice problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Backtrack searching in the presence of symmetry
Nordic Journal of Computing
On Higher Arthur-Merlin Classes
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Direct Minimum-Knowledge Computations
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Achieving Zero-Knowledge Robustly
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Foundations of Secure Interactive Computing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
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
Fast approximate probabilistically checkable proofs
Information and Computation
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On basing one-way functions on NP-hardness
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Progress in computational complexity theory
Journal of Computer Science and Technology
Pairwise independence and derandomization
Foundations and Trends® in Theoretical Computer Science
Journal of Computer and System Sciences
Graph and map isomorphism and all polyhedral embeddings in linear time
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
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Probabilistic Proof Systems: A Primer
Foundations and Trends® in Theoretical Computer Science
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
An application of quantum finite automata to interactive proof systems
Journal of Computer and System Sciences
Computation of equilibriain noncooperative games
Computers & Mathematics with Applications
On the complexity of hyperelliptic discrete logarithm problem
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Cryptographic protocols provably secure against dynamic adversaries
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
How intractable is the discrete logarithm for a general finite group?
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
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
Adptive quantum computation, constant depth quantum circuits and arthur-merlin games
Quantum Information & Computation
On the role of shared entanglement
Quantum Information & Computation
The complexity of stoquastic local Hamiltonian problems
Quantum Information & Computation
Verifying computations with streaming interactive proofs
Proceedings of the VLDB Endowment
A note on zero error algorithms having oracle access to one NP query
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Private coins versus public coins in zero-knowledge proof systems
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Unconditional characterizations of non-interactive zero-knowledge
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
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
On some variations of two-way probabilistic finite automata models
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Multiple usage of random bits in finite automata
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Finite state verifiers with constant randomness
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Interactive proofs of proximity: delegating computation in sublinear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
On the automorphism groups of strongly regular graphs I
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |