#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2012

2017

- This year (2)
- Last 5 years (11)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

We show the following reductions from the learning with errors problem (LWE) to the learning with rounding problem (LWR): (1) Learning the secret and (2) distinguishing samples from random strings isâ€¦ (More)

- Rafail Ostrovsky, Silas Richelson, Alessandra Scafuro
- CRYPTO
- 2015

In [Eurocrypt 2004] Katz and Ostrovsky establish the exact round complexity of secure two-party computation with respect to black-box proofs of security. They prove that 5 rounds are necessary forâ€¦ (More)

- Vipul Goyal, Abhishek Jain, Rafail Ostrovsky, Silas Richelson, Ivan Visconti
- ASIACRYPT
- 2013

In [18] Goyal et al. introduced the bounded player model for secure computation. In the bounded player model, there are an a priori bounded number of players in the system, however, each player mayâ€¦ (More)

- Vipul Goyal, Omkant Pandey, Silas Richelson
- IACR Cryptology ePrint Archive
- 2015

We present a new non-malleable commitment protocol. Our protocol has the following features: itemize The protocol has only three rounds of interaction. Pass (TCC 2013) showed an impossibility resultâ€¦ (More)

- Vipul Goyal, Silas Richelson, Alon Rosen, Margarita Vald
- 2014 IEEE 55th Annual Symposium on Foundations ofâ€¦
- 2014

In their seminal work on non-malleable cryptography, Dolev, Dwork and Naor, showed how to construct a non-malleable commitment with logarithmically-many "rounds"/"slots", the idea being that anyâ€¦ (More)

- Hai Brenner, Vipul Goyal, Silas Richelson, Alon Rosen, Margarita Vald
- ACM Conference on Computer and Communicationsâ€¦
- 2015

The notion of non-malleability in cryptography refers to the setting where the adversary is a man-in-the-middle (MIM) who takes part in two or more protocol executions and tries to use informationâ€¦ (More)

- Abhishek Jain, Rafail Ostrovsky, Silas Richelson, Ivan Visconti
- IACR Cryptology ePrint Archive
- 2012

In this paper we put forward the Bounded Player Model for secure computation. In this new model, the number of players that will ever be involved in secure computations is bounded, but the number ofâ€¦ (More)

A multiparty computation protocol is said to be adaptively secure if it retains its security in the presence of an adversary who can adaptively corrupt participants as the protocol proceeds. This isâ€¦ (More)

- Tal Moran, Ilan Orlov, Silas Richelson
- IACR Cryptology ePrint Archive
- 2014

Secure Multi-party Computation (MPC) is one of the foundational achievements of modern cryptography, allowing multiple, distrusting, parties to jointly compute a function of their inputs, whileâ€¦ (More)

- Ran Canetti, Justin Holmgren, Silas Richelson
- TCC
- 2017

Private Information Retrieval (PIR) allows a client to obtain data from a public database without disclosing the locations accessed. Traditionally, the stress is on preserving sublinear work for theâ€¦ (More)