- Private Approximation of Search Problems # Amos Beimel + Paz Carmi Kobbi Nissim Enav Weinreb
- Monotone Circuits for Monotone Weighted Threshold Functions Amos Beimel
- Protocols for Multiparty Coin Toss With Dishonest Majority
- Efficient Reliable Communication over Partially Authenticated Networks
- Monotone Circuits for Weighted Threshold Functions Amos Beimel
- Distributed Private Data Analysis: On Simultaneously Solving How and What #
- ON THE POWER OF NONLINEAR SECRET-SHARING AMOS BEIMEL AND YUVAL ISHAI
- Approximate Belief Updating in Max2Connected Bayes Networks is
- InformationTheoretic Private Information Retrieval: A Unified Construction
- General Constructions for InformationTheoretic Private Information Retrieval #
- Monotone Circuits for Monotone Weighted Threshold Functions # Amos Beimel + Enav Weinreb #
- Private Approximation of Search Problems # Amos Beimel + Paz Carmi Kobbi Nissim Enav Weinreb
- On Private Computation in Incomplete Networks # Amos Beimel
- Private addition over GF(q) Each P i has an input x i 2 GF(q).
- Characterizing Ideal Weighted Threshold Secret Sharing Amos Beimel # Tamir Tassa + Enav Weinreb #
- Weakly-Private Secret Sharing Schemes Amos Beimel1
- On Matroids and Non-ideal Secret Sharing Amos Beimel ? and Noam Livne
- IEEE TRANSACTIONS ON INFORMATION THEORY 1 On Matroids and Nonideal Secret Sharing
- IEEE/ACM TRANSACTIONS ON NETWORKING, DECEMBER 2007 1 RT Oblivious Erasure Correcting
- WeaklyPrivate Secret Sharing Schemes # Amos Beimel 1 and Matthew Franklin 2
- Efficient Reliable Communication over Partially Authenticated Amos Beimel Lior Malka
- Reducing the Servers' Computation in Private Information Retrieval: PIR with Preprocessing
- On Private Computation in Incomplete Amos Beimel1
- Private Approximation of Search Problems Amos Beimel
- Approximate Belief Updating in Max-2-Connected Bayes Networks is
- Information-Theoretic Private Information Retrieval: A Unified Construction
- On Linear Secret Sharing for Connectivity in Directed Graphs
- Edge Eavesdropping Games Amos Beimel 1,# and Matthew Franklin 2,##
- The Query Complexity of Finding Local Minima in the Lattice 1
- Choosing, Agreeing, and Eliminating in Communication Complexity #
- Bounds on the Sample Complexity for Private Learning and Private Data Release
- Efficient Reliable Communication over Partially Authenticated Networks
- On Private Computation in Incomplete Amos Beimel 1
- Secure Multiparty Computation with Partial Fairness Amos Beimel #
- Edge Eavesdropping Games Amos Beimel # Matthew Franklin +
- COMPUTING FUNCTIONS OF A SHARED SECRET AMOS BEIMEL , MIKE BURMESTER y , YVO DESMEDT z , AND EYAL KUSHILEVITZ x
- Matrix Columns Allocation Problems Amos Beimel 1
- Characterizing Ideal Weighted Threshold Secret Sharing Amos Beimel # Tamir Tassa + Enav Weinreb #
- Private Information Retrieval: A Primer Amos Beimel
- Matroids Can Be Far From Ideal Secret Sharing Amos Beimel 1,# , Noam Livne 2,## , and Carles Padro 3,# # #
- ! "#$#%& '() 0 ' 1$2(# 34567 89 @8A5B64C DEF4GE4H I4GPQBCF8G RGFS4CTF6UHI44CPDV4SW XY`abH cTCW4d7
- Breaking the O(n 1/(2k-1) ) Barrier for InformationTheoretic Private Information Retrieval #
- Learning Functions Represented as Multiplicity Automata \Lambda
- Reliable Communication over Partially Authenticated Networks \Lambda
- Robust InformationTheoretic Private Information Retrieval # Amos Beimel + Yoav Stahl #
- Learning Unions of High Dimensional Boxes over the Reals Amos Beimel Eyal Kushilevitz y
- Learning Boxes in High Dimension \Lambda Amos Beimel y Eyal Kushilevitz z
- 18 REFERENCES D. R. Stinson, An explication of secret sharing schemes. Designs, Codes and
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. , NO. , SEPTEMBER 2007 1 On Matroids and Non-ideal Secret Sharing
- SEPARATING THE POWER OF MONOTONE SPAN PROGRAMS OVER DIFFERENT FIELDS #
- The Query Complexity of Finding Local Minima in the Lattice1
- Private Approximation of Clustering and Vertex Amos Beimel, Renen Hallak, and Kobbi Nissim
- Bounds on the Sample Complexity for Private Learning and Private Data Release
- ON THE POWER OF NONLINEAR SECRETSHARING # AMOS BEIMEL + AND YUVAL ISHAI #
- Edge Eavesdropping Games Amos Beimel
- Separating the Power of Monotone Span Programs over Different Fields
- Characterizing Ideal Weighted Threshold Secret Sharing Amos Beimel
- IEEE/ACM TRANSACTIONS ON NETWORKING, DECEMBER 2007 1 RT Oblivious Erasure Correcting
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 44, NO. 5, SEPTEMBER 1998 1 Secret Sharing with Public Reconstruction
- A Quantitative Approach to Reductions in Secure Computation Amos Beimel # Tal Malkin +
- Oneway Functions are Essential for SingleServer Private Information Retrieval
- Matrix Columns Allocation Problems Amos Beimel 1
- [9] W. Jackson and K. M. Martin. On Ideal Secret Sharing Schemes. submitted for publication, [10] E.D. Karnin, J.W. Greene, and M.E. Hellman. On Secret Sharing Systems. IEEE Trans.
- Private Information Retrieval: A Primer Amos Beimel
- Breaking the O(n1/(2k-1) ) Barrier for
- Robust Information-Theoretic Private Information Retrieval Amos Beimel
- General Constructions for Information-Theoretic Private Information Retrieval
- Reducing the Servers' Computation in Private Information Retrieval: PIR with Preprocessing
- Secret Sharing and Non-Shannon Information Inequalities
- Matroids Can Be Far From Ideal Secret Sharing Amos Beimel1,
- Characterizing Ideal Weighted Threshold Secret Sharing Amos Beimel
- Distributed Private Data Analysis: Simultaneously Solving How and What
- Distributed Private Data Analysis: On Simultaneously Solving How and What
- Secure Multiparty Computation with Partial Fairness Amos Beimel
- How Should We Solve Search Problems Amos Beimel1
- Private Approximation of Search Problems Amos Beimel
- A Quantitative Approach to Reductions in Secure Computation Amos Beimel
- Edge Eavesdropping Games Amos Beimel1,
- Efficient Reliable Communication over Partially Authenticated Amos Beimel Lior Malka
- Choosing, Agreeing, and Eliminating in Communication Complexity
- Monotone Circuits for Weighted Threshold Functions Amos Beimel
- Separating the Power of Monotone Span Programs over Different Fields
- Robust Information-Theoretic Private Information Retrieval Amos Beimel
- Private Approximation of Clustering and Vertex Amos Beimel, Renen Hallak, and Kobbi Nissim
- Distributed Private Data Analysis: Simultaneously Solving How and What
- Learning Unions of High Dimensional Boxes over the Reals Amos Beimel
- Communication in Key Distribution Schemes \Lambda Amos Beimel y Benny Chor z
- Protocols for Multiparty Coin Toss With Dishonest Majority
- Buses for Anonymous Message Delivery Amos Beimel Shlomi Dolev
- On Private Computation in Incomplete Networks Amos Beimel
- Robust InformationTheoretic Private Information Retrieval Amos Beimel Yoav Stahl y
- The All-or-Nothing Nature of Two-Party Secure Computation
- SEPARATING THE POWER OF MONOTONE SPAN PROGRAMS OVER DIFFERENT FIELDS
- On Linear Secret Sharing for Connectivity in Directed Graphs
- Breaking the O(n1/(2k-1) ) Barrier for
- On Arithmetic Branching Programs \Lambda Amos Beimel y Anna G'al z
- Breaking the O(n 1=(2k 1) ) Barrier for
- Secret Sharing and NonShannon Information Inequalities #
- Secret-Sharing Schemes: A Survey Amos Beimel
- Choosing, Agreeing, and Eliminating in Communication Amos Beimel
