• Publications
  • Influence
Secure Schemes for Secret Sharing and Key Distribution
  • 509
  • 119
Secret-Sharing Schemes: A Survey
  • A. Beimel
  • Computer Science, Mathematics
  • IWCC
  • 30 May 2011
A secret-sharing scheme is a method by which a dealer distributes shares to parties such that only authorized subsets of parties can reconstruct the secret. Secret-sharing schemes are an importantExpand
  • 395
  • 25
  • Open Access
Barrier for Information-Theoretic Private Information Retrieval
Private Information Retrieval (PIR) protocols allow a user to retrieve a data item from a database while hiding the identity of the item being retrieved. Specifically, in information-theoretic,Expand
  • 88
  • 18
Characterizing Ideal Weighted Threshold Secret Sharing
Weighted threshold secret sharing was introduced by Shamir in his seminal work on secret sharing. In such settings, there is a set of users where each user is assigned a positive weight. A dealerExpand
  • 108
  • 12
  • Open Access
General constructions for information-theoretic private information retrieval
A Private Information Retrieval (PIR) protocol enables a user to retrieve a data item from a database while hiding the identity of the item being retrieved; specifically, in a t-private k-server PIRExpand
  • 88
  • 10
  • Open Access
Buses for Anonymous Message Delivery
Abstract. This work develops a novel approach to hide the senders and the receivers of messages. The intuition is taken from an everyday activity that hides the ``communication pattern''—the publicExpand
  • 127
  • 9
  • Open Access
The All-or-Nothing Nature of Two-Party Secure Computation
A function f is computationally securely computable if two computationally-bounded parties Alice, having a secret input x, and Bob, having a secret input y, can talk back and forth so that (even ifExpand
  • 67
  • 9
Robust Information-Theoretic Private Information Retrieval
A Private Information Retrieval (PIR) protocol allows a user to retrieve a data item of its choice from a database, such that the servers storing the database do not gain information on the identityExpand
  • 50
  • 9
Distributed Private Data Analysis: On Simultaneously Solving How and What
We examine the combination of two directions in the field of privacy concerning computations over distributed private inputs --- secure function evaluation(SFE) and differential privacy. While inExpand
  • 129
  • 8
  • Open Access
Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval
Private information retrieval (PIR) protocols allow a user to retrieve a data item from a database while hiding the identity of the item being retrieved. Specifically, in information-theoretic,Expand
  • 177
  • 7
  • Open Access