The following pages link to Boaz Barak (Q656921):
Displaying 21 items.
- Secure computation without authentication (Q656923) (← links)
- Limits on low-degree pseudorandom generators (or: sum-of-squares meets program obfuscation) (Q1648854) (← links)
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction (Q1928613) (← links)
- Noisy tensor completion via the sum-of-squares hierarchy (Q2144539) (← links)
- Sum-of-squares meets program obfuscation, revisited (Q2292645) (← links)
- Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles (Q2408585) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- How to Compress Interactive Communication (Q2848223) (← links)
- How to compress interactive communication (Q2875133) (← links)
- Public-key cryptography from different assumptions (Q2875143) (← links)
- 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction (Q2931427) (← links)
- Sum of Squares Lower Bounds from Pairwise Independence (Q2941493) (← links)
- Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method (Q2941498) (← links)
- On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction (Q2986870) (← links)
- Subexponential Algorithms for Unique Games and Related Problems (Q3177749) (← links)
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle (Q3183575) (← links)
- Deep double descent: where bigger models and more data hurt* (Q5020041) (← links)
- (Q5090379) (← links)
- Fractional Sylvester–Gallai theorems (Q5170981) (← links)
- Advances in Cryptology - CRYPTO 2003 (Q5428127) (← links)
- (Q6126238) (← links)
