The following pages link to Amos Beimel (Q290383):
Displaying 50 items.
- On Matroids and Nonideal Secret Sharing (Q3604544) (← links)
- Secret Sharing and Non-Shannon Information Inequalities (Q3611787) (← links)
- How Should We Solve Search Problems Privately? (Q3612543) (← links)
- Characterizing Ideal Weighted Threshold Secret Sharing (Q3614213) (← links)
- Private Approximation of Search Problems (Q3642862) (← links)
- (Q4252753) (← links)
- (Q4258572) (← links)
- (Q4318693) (← links)
- (Q4341771) (← links)
- (Q4343447) (← links)
- Learning functions represented as multiplicity automata (Q4406308) (← links)
- (Q4414292) (← links)
- Computing Functions of a Shared Secret (Q4490789) (← links)
- (Q4535072) (← links)
- (Q4536794) (← links)
- Secret Sharing With Public Reconstruction (Q4701164) (← links)
- Universally ideal secret-sharing schemes (Q4838633) (← links)
- Communication in key distribution schemes (Q4879986) (← links)
- (Q4941849) (← links)
- Linear Secret-Sharing Schemes for Forbidden Graph Access Structures (Q5080047) (← links)
- Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling (Q5096104) (← links)
- Better secret sharing via robust conditional disclosure of secrets (Q5144916) (← links)
- 1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds (Q5199197) (← links)
- (Q5214238) (← links)
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions (Q5261630) (← links)
- Ad Hoc PSM Protocols: Secure Computation Without Coordination (Q5270377) (← links)
- Secret Sharing and Non-Shannon Information Inequalities (Q5272344) (← links)
- Separating the Power of Monotone Span Programs over Different Fields (Q5317192) (← links)
- On the Power of Nonlinear Secret-Sharing (Q5317613) (← links)
- Learning Privately with Labeled and Unlabeled Examples (Q5363036) (← links)
- Matroids Can Be Far from Ideal Secret Sharing (Q5445507) (← links)
- Structural Information and Communication Complexity (Q5710094) (← links)
- Theory of Cryptography (Q5711666) (← links)
- (Q5741634) (← links)
- On the Cryptographic Complexity of the Worst Functions (Q5746343) (← links)
- Multi-linear Secret-Sharing Schemes (Q5746346) (← links)
- (Q5875525) (← links)
- Efficient reliable communication over partially authenticated networks (Q5892142) (← links)
- Theory of Cryptography (Q5898370) (← links)
- Theory of Cryptography (Q5901775) (← links)
- Efficient reliable communication over partially authenticated networks (Q5917936) (← links)
- (Q6059374) (← links)
- (Q6126230) (← links)
- Quadratic secret sharing and conditional disclosure of secrets (Q6575551) (← links)
- Cryptography from planted graphs: security with logarithmic-size messages (Q6581792) (← links)
- Three party secure computation with friends and foes (Q6582170) (← links)
- Improved polynomial secret-sharing schemes (Q6582181) (← links)
- Complete characterization of fairness in secure two-party computation of Boolean functions (Q6621746) (← links)
- Lower bounds for secret-sharing schemes for \(k\)-hypergraphs (Q6642402) (← links)
- Structural lower bounds on black-box constructions of pseudorandom functions (Q6652977) (← links)
