• Publications
  • Influence
Private Circuits: Securing Hardware against Probing Attacks
TLDR
This paper proposes several efficient techniques for building private circuits resisting side channel attacks, and provides a formal threat model and proofs of security for their constructions. Expand
Extending Oblivious Transfers Efficiently
We consider the problem of extending oblivious transfers: Given a small number of oblivious transfers “for free,” can one implement a large number of oblivious transfers? Beaver has shown how toExpand
Protecting data privacy in private information retrieval schemes
TLDR
This paper shows how to transform PIR schemes into SPIR schemes (with information-theoretic privacy), paying a constant factor in communication complexity, and introduces a new cryptographic primitive, called conditional disclosure of secrets, which it is believed may be a useful building block for the design of other cryptographic protocols. Expand
Founding Cryptography on Oblivious Transfer - Efficiently
We present a simple and efficient compiler for transforming secure multi-party computation (MPC) protocols that enjoy security only with an honest majority into MPC protocols that guarantee securityExpand
Batch codes and their applications
TLDR
This work demonstrates the usefulness of batch codes by presenting two types of applications: trading maximal load for storage in certain load-balancing scenarios, and amortizing the computational cost of private information retrieval (PIR) and related cryptographic protocols. Expand
Priced Oblivious Transfer: How to Sell Digital Goods
TLDR
The first one-round (two-pass) protocol for oblivious transfer that does not rely on the random oracle model is presented, which is a special case of a more general "conditional disclosure" methodology, which extends a previous approach from [11] and adapts it to the 2-party setting. Expand
Keyword Search and Oblivious Pseudorandom Functions
TLDR
This work investigates the problem of privacy-preserving access to a database, where records in the database are accessed according to their associated keywords and gives efficient solutions for various settings of KS. Expand
Founding Cryptography on Tamper-Proof Hardware Tokens
TLDR
It is shown that stateless hardware tokens are sufficient to base general secure computation on the existence of one-way functions, and gives the first general feasibility result for program obfuscation using stateless tokens, while strengthening the standard notion of obfuscation by providing security against a malicious sender. Expand
Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation
TLDR
This work presents a method for converting shares of a secret into shares of the same secret in a different secret-sharing scheme using only local computation and no communication between players, and shows how this can be combined with any pseudorandom function to create any number of Shamir secret-sharings of (pseudo)random values without communication. Expand
Function Secret Sharing
TLDR
This work introduces and studies the notion of function secret sharing (FSS), a natural generalization of distributed point functions (DPF), a primitive that was recently introduced by Gilboa and Ishai (Eurocrypt 2014). Expand
...
1
2
3
4
5
...