One-way functions and Pseudorandom generators
Combinatorica - Theory of Computing
BPP has subexponential time simulations unless EXPTIME has publishable proofs
Computational Complexity
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Direct product results and the GCD problem, in old and new communication models
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
SIAM Journal on Computing
Computing From Partial Solutions
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
Hard-core distributions for somewhat hard problems
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Does Parallel Repetition Lower the Error in Computationally Sound Protocols?
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Towards Proving Strong Direct Product Theorems
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
List-Decoding Using The XOR Lemma
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Limitations of Quantum Advice and One-Way Communication
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Key agreement from weak bit agreement
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
An efficient parallel repetition theorem for Arthur-Merlin games
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Products and help bits in decision trees
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Parallel repetition of computationally sound protocols revisited
TCC'07 Proceedings of the 4th conference on Theory of cryptography
CAPTCHA: using hard AI problems for security
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Hardness amplification of weakly verifiable puzzles
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Uniform direct product theorems: simplified, optimized, and derandomized
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On the (Im)Possibility of Key Dependent Encryption
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Distinguishing distributions using Chernoff information
ProvSec'10 Proceedings of the 4th international conference on Provable security
An efficient parallel repetition theorem
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Counterexamples to hardness amplification beyond negligible
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
On the Composition of Public-Coin Zero-Knowledge Protocols
SIAM Journal on Computing
A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 0.00 |
Consider a challenge-response protocol where the probability of a correct response is at least a for a legitimate user, and at most β