The following pages link to Enav Weinreb (Q541667):
Displaying 21 items.
- Partition arguments in multiparty communication complexity (Q541668) (← links)
- On locally decodable codes, self-correctable codes, and \(t\)-private PIR (Q603915) (← links)
- On \(d\)-multiplicative secret sharing (Q604627) (← links)
- Choosing, agreeing, and eliminating in communication complexity (Q744609) (← links)
- Monotone circuits for monotone weighted threshold functions (Q1044746) (← links)
- How should we solve search problems privately? (Q2267364) (← links)
- Private approximation of search problems (Q2931376) (← links)
- Choosing, Agreeing, and Eliminating in Communication Complexity (Q3587399) (← links)
- Secure Linear Algebra Using Linearly Recurrent Sequences (Q3596387) (← links)
- Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries (Q3600236) (← links)
- On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR (Q3603474) (← links)
- How Should We Solve Search Problems Privately? (Q3612543) (← links)
- Characterizing Ideal Weighted Threshold Secret Sharing (Q3614213) (← links)
- Partition Arguments in Multiparty Communication Complexity (Q3638050) (← links)
- Private Approximation of Search Problems (Q3642862) (← links)
- The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection (Q5171164) (← links)
- On the complexity of communication complexity (Q5172741) (← links)
- (Q5302091) (← links)
- Separating the Power of Monotone Span Programs over Different Fields (Q5317192) (← links)
- Theory of Cryptography (Q5711666) (← links)
- Theory of Cryptography (Q5898372) (← links)
