Skip to search formSkip to main contentSkip to account menu

Private Circuits: Securing Hardware against Probing Attacks

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.
View via Publisher (opens in a new tab)

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 to…
View via Publisher (opens in a new tab)

Protecting data privacy in private information retrieval schemes

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.
View on ACM (opens in a new tab)

Keyword Search and Oblivious Pseudorandom Functions

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.
View via Publisher (opens in a new tab)

Priced Oblivious Transfer: How to Sell Digital Goods

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.
View via Publisher (opens in a new tab)

Batch codes and their applications

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.
View on ACM (opens in a new tab)

Function Secret Sharing: Improvements and Extensions

Efficient protocols for verifying that keys (k*/1,...,k*/m ), obtained from a potentially malicious user, are consistent with some f in F are presented, critical for applications that involve private writing or voting by many users.
View on ACM (opens in a new tab)

Function Secret Sharing

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).
View via Publisher (opens in a new tab)

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 security…
View via Publisher (opens in a new tab)

Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation

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.
View via Publisher (opens in a new tab)
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)