The following pages link to Amos Beimel (Q290383):
Displaying 50 items.
- Secret-sharing schemes for very dense graphs (Q290386) (← links)
- Learning unions of high-dimensional boxes over the reals (Q294744) (← links)
- Communication-efficient distributed oblivious transfer (Q439979) (← links)
- Private approximation of clustering and vertex cover (Q626661) (← links)
- Lower bounds for monotone span programs (Q677989) (← links)
- Choosing, agreeing, and eliminating in communication complexity (Q744609) (← links)
- Approximate belief updating in max-2-connected Bayes networks is NP-hard (Q840823) (← links)
- Matrix columns allocation problems (Q1019735) (← links)
- Monotone circuits for monotone weighted threshold functions (Q1044746) (← links)
- (Q1271192) (redirect page) (← links)
- Learning boxes in high dimension (Q1271193) (← links)
- Reliable communication over partially authenticated networks (Q1292432) (← links)
- Buses for anonymous message delivery (Q1402361) (← links)
- The complexity of multiparty PSM protocols and related models (Q1648834) (← links)
- Linear secret-sharing schemes for forbidden graph access structures (Q1690278) (← links)
- Optimal linear multiparty conditional disclosure of secrets protocols (Q1710680) (← links)
- Evolving ramp secret-sharing schemes (Q1796800) (← links)
- The query complexity of finding local minima in the lattice (Q1854471) (← links)
- Reducing the servers' computation in private information retrieval: PIR with preprocessing (Q1880406) (← links)
- On private computation in incomplete networks (Q1954202) (← links)
- On arithmetic branching programs (Q1961372) (← links)
- Evolving ramp secret sharing with a small gap (Q2055622) (← links)
- On the round complexity of the shuffle model (Q2119066) (← links)
- The share size of secret-sharing schemes for almost all access structures and graphs (Q2119092) (← links)
- Quadratic secret sharing and conditional disclosure of secrets (Q2129018) (← links)
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds (Q2210437) (← links)
- Learning privately with labeled and unlabeled examples (Q2223696) (← links)
- Bounds on the sample complexity for private learning and private data release (Q2251471) (← links)
- How should we solve search problems privately? (Q2267364) (← links)
- Secret-sharing schemes for general and uniform access structures (Q2292702) (← links)
- General constructions for information-theoretic private information retrieval (Q2485285) (← links)
- Protocols for multiparty coin toss with a dishonest majority (Q2516525) (← links)
- Robust information-theoretic private information retrieval (Q2642258) (← links)
- Distribution Design (Q2800555) (← links)
- One-way functions are essential for single-server private information retrieval (Q2819537) (← links)
- Secret Sharing Schemes for Dense Forbidden Graphs (Q2827736) (← links)
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy (Q2851871) (← links)
- Non-Interactive Secure Multiparty Computation (Q2874549) (← links)
- Secret Sharing Schemes for Very Dense Graphs (Q2914258) (← links)
- Private approximation of search problems (Q2931376) (← links)
- Characterizing the sample complexity of private learners (Q2986862) (← links)
- Secret-Sharing Schemes: A Survey (Q3005578) (← links)
- Bounds on the Sample Complexity for Private Learning and Private Data Release (Q3408209) (← links)
- On Linear Secret Sharing for Connectivity in Directed Graphs (Q3540044) (← links)
- Edge Eavesdropping Games (Q3541875) (← links)
- Protocols for Multiparty Coin Toss with Dishonest Majority (Q3582776) (← links)
- Choosing, Agreeing, and Eliminating in Communication Complexity (Q3587399) (← links)
- Weakly-Private Secret Sharing Schemes (Q3596384) (← links)
- Private Approximation of Clustering and Vertex Cover (Q3596391) (← links)
- Distributed Private Data Analysis: Simultaneously Solving How and What (Q3600234) (← links)
