Q4638115 (Q4638115): Difference between revisions

@@ Property / cites work @@
+Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
+Normal rank
@@ Property / cites work @@
+Incompressible functions, relative-error extractors, and the power of nondeterministic reductions
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Pseudorandomness when the odds are against you
@@ Property / cites work: Pseudorandomness when the odds are against you / rank @@
+Normal rank
@@ Property / cites work @@
+Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
+Normal rank
@@ Property / cites work @@
+On Constructing One-Way Permutations from Indistinguishability Obfuscation
+Normal rank
@@ Property / cites work @@
+Q4783716
@@ Property / cites work: Q4783716 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for non-black-box zero knowledge
@@ Property / cites work: Lower bounds for non-black-box zero knowledge / rank @@
+Normal rank
@@ Property / cites work @@
+Derandomization in Cryptography
@@ Property / cites work: Derandomization in Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Decision Versus Search
@@ Property / cites work: The Complexity of Decision Versus Search / rank @@
+Normal rank
@@ Property / cites work @@
+On the theory of average case complexity
@@ Property / cites work: On the theory of average case complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Structure vs. hardness through the obfuscation lens
+Normal rank
@@ Property / cites work @@
+A Note on Perfect Correctness by Derandomization
@@ Property / cites work: A Note on Perfect Correctness by Derandomization / rank @@
+Normal rank
@@ Property / cites work @@
+Designing programs that check their work
@@ Property / cites work: Designing programs that check their work / rank @@
+Normal rank
@@ Property / cites work @@
+Relativized cryptography
@@ Property / cites work: Relativized cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+Does the polynomial hierarchy collapse if onto functions are invertible?
+Normal rank
@@ Property / cites work @@
+Settling the complexity of computing two-player Nash equilibria
+Normal rank
@@ Property / cites work @@
+The Complexity of Computing a Nash Equilibrium
@@ Property / cites work: The Complexity of Computing a Nash Equilibrium / rank @@
+Normal rank
@@ Property / cites work @@
+Q5365081
@@ Property / cites work: Q5365081 / rank @@
+Normal rank
@@ Property / cites work @@
+Zaps and Their Applications
@@ Property / cites work: Zaps and Their Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Advances in Cryptology - EUROCRYPT 2004
@@ Property / cites work: Advances in Cryptology - EUROCRYPT 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of promise problems with applications to public-key cryptography
+Normal rank
@@ Property / cites work @@
+Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
+Normal rank
@@ Property / cites work @@
+Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds
+Normal rank
@@ Property / cites work @@
+Q4526985
@@ Property / cites work: Q4526985 / rank @@
+Normal rank
@@ Property / cites work @@
+Integer factoring and modular square roots
@@ Property / cites work: Integer factoring and modular square roots / rank @@
+Normal rank
@@ Property / cites work @@
+How easy is local search?
@@ Property / cites work: How easy is local search? / rank @@
+Normal rank
@@ Property / cites work @@
+The Dual BKR Inequality and Rudich's Conjecture
@@ Property / cites work: The Dual BKR Inequality and Rudich's Conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+One-Way Functions and (Im)perfect Obfuscation
@@ Property / cites work: One-Way Functions and (Im)perfect Obfuscation / rank @@
+Normal rank
@@ Property / cites work @@
+BPP and the polynomial hierarchy
@@ Property / cites work: BPP and the polynomial hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Search Problems in the Decision Tree Model
@@ Property / cites work: Search Problems in the Decision Tree Model / rank @@
+Normal rank
@@ Property / cites work @@
+On total functions, existence theorems and computational complexity
+Normal rank
@@ Property / cites work @@
+Bit commitment using pseudorandomness
@@ Property / cites work: Bit commitment using pseudorandomness / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness vs randomness
@@ Property / cites work: Hardness vs randomness / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the parity argument and other inefficient proofs of existence
+Normal rank
@@ Property / cites work @@
+Can PPAD hardness be based on standard cryptographic assumptions?
+Normal rank
@@ Property / cites work @@
+Q5750403
@@ Property / cites work: Q5750403 / rank @@
+Normal rank
@@ Property / cites work @@
+How to use indistinguishability obfuscation
@@ Property / cites work: How to use indistinguishability obfuscation / rank @@
+Normal rank
@@ Property / cites work @@
+Q4249649
@@ Property / cites work: Q4249649 / rank @@
+Normal rank