The following pages link to Guy N. Rothblum (Q385708):
Displayed 50 items.
- Refereed delegation of computation (Q385709) (← links)
- Obfuscating conjunctions (Q514475) (← links)
- Are PCPs inherent in efficient arguments? (Q626678) (← links)
- Securely obfuscating re-encryption (Q656916) (← links)
- On best-possible obfuscation (Q744349) (← links)
- From obfuscation to the security of Fiat-Shamir for proofs (Q1680212) (← links)
- On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments (Q1690273) (← links)
- Batch verification and proofs of proximity with polylog overhead (Q2119040) (← links)
- Batch verification for statistical zero knowledge proofs (Q2119042) (← links)
- Incrementally verifiable computation via incremental PCPs (Q2175954) (← links)
- Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles (Q2272198) (← links)
- Pure Differential Privacy for Rectangle Queries via Private Partitions (Q2795997) (← links)
- Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems (Q2829945) (← links)
- Obfuscating Conjunctions (Q2849410) (← links)
- Differential privacy under continual observation (Q2875198) (← links)
- How to Compute under $${\mathcal {\varvec{AC}}}^\mathbf{0}$$ Leakage without Secure Hardware (Q2914283) (← links)
- Black-box obfuscation for d-CNFs (Q2988884) (← links)
- Program Obfuscation with Leaky Hardware (Q3102218) (← links)
- Delegating Computation (Q3177732) (← links)
- Obfuscation of Hyperplane Membership (Q3408188) (← links)
- Leakage-Resilient Signatures (Q3408204) (← links)
- How to Compute in the Presence of Leakage (Q3449567) (← links)
- The complexity of online memory checking (Q3452196) (← links)
- The Complexity of Local List Decoding (Q3541812) (← links)
- (Q3549643) (← links)
- (Q3549691) (← links)
- (Q3549694) (← links)
- Securing Computation against Continuous Leakage (Q3582748) (← links)
- On Best-Possible Obfuscation (Q3596381) (← links)
- Securely Obfuscating Re-encryption (Q3596382) (← links)
- One-Time Programs (Q3600212) (← links)
- How Efficient Can Memory Checking Be? (Q3611785) (← links)
- Weak Verifiable Random Functions (Q3611788) (← links)
- (Q4993281) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- Worst-Case to Average-Case Reductions for Subclasses of P (Q5098780) (← links)
- Constant-Round Interactive Proof Systems for AC0[2] and NC1 (Q5098783) (← links)
- (Q5121910) (← links)
- Fast Pseudorandomness for Independence and Load Balancing (Q5167798) (← links)
- On the complexity of differentially private data release (Q5172732) (← links)
- Two Protocols for Delegation of Computation (Q5200454) (← links)
- Gentle measurement of quantum states and differential privacy (Q5212773) (← links)
- Fiat-Shamir: from practice to theory (Q5212848) (← links)
- Finding a Nash equilibrium is no easier than breaking Fiat-Shamir (Q5212850) (← links)
- Composable and versatile privacy via truncated CDP (Q5230278) (← links)
- Fine-grained Complexity Meets IP = PSPACE (Q5236182) (← links)
- Constant-round interactive proofs for delegating computation (Q5361818) (← links)
- Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles (Q5426024) (← links)
- Interactive proofs of proximity (Q5495850) (← links)
- (Q5743387) (← links)