Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Multiparty Computation from Somewhat Homomorphic Encryption

- I. Damgård, Valerio Pastro, N. Smart, Sarah Zakarias
- Computer Science
- IACR Cryptol. ePrint Arch.
- 19 August 2012

We propose a general multiparty computation protocol secure against an active adversary corrupting up to $$n-1$$ of the n players. The protocol may be used to compute securely arithmetic circuits… Expand

Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits

- I. Damgård, Marcel Keller, Enrique Larraia, Valerio Pastro, P. Scholl, N. Smart
- Computer Science
- ESORICS
- 9 September 2013

SPDZ (pronounced “Speedz”) is the nickname of the MPC protocol of Damgard et al. from Crypto 2012. In this paper we both resolve a number of open problems with SPDZ; and present several theoretical… Expand

Overdrive: Making SPDZ Great Again

- Marcel Keller, Valerio Pastro, Dragos Rotaru
- Computer Science
- IACR Cryptol. ePrint Arch.
- 29 April 2018

SPDZ denotes a multiparty computation scheme in the preprocessing model based on somewhat homomorphic encryption (SHE) in the form of BGV. At CCS ’16, Keller et al. presented MASCOT, a replacement of… Expand

Efficiently Verifiable Computation on Encrypted Data

- Dario Fiore, R. Gennaro, Valerio Pastro
- Computer Science
- CCS '14
- 3 November 2014

We study the task of verifiable delegation of computation on encrypted data. We improve previous definitions in order to tolerate adversaries that learn whether or not clients accept the result of a… Expand

Essentially Optimal Robust Secret Sharing with Maximal Corruptions

- A. Bishop, Valerio Pastro, R. Rajaraman, Daniel Wichs
- Computer Science
- EUROCRYPT
- 8 May 2016

In a t-out-of-nrobust secret sharing scheme, a secret message is shared among n parties who can reconstruct the message by combining their shares. An adversary can adaptively corrupt upi¾?to t of the… Expand

A Simple Obfuscation Scheme for Pattern-Matching with Wildcards

- A. Bishop, L. Kowalczyk, T. Malkin, Valerio Pastro, Mariana Raykova, K. Shi
- Computer Science
- IACR Cryptol. ePrint Arch.
- 19 August 2018

We give a simple and efficient method for obfuscating pattern matching with wildcards. In other words, we construct a way to check an input against a secret pattern, which is described in terms of… Expand

Robust Secret Sharing Schemes Against Local Adversaries

- A. Bishop, Valerio Pastro
- Computer Science
- Public Key Cryptography
- 6 March 2016

We study robust secret sharing schemes in which between one third and one half of the players are corrupted. In this scenario, robust secret sharing is possible only with a share size larger than the… Expand

Secure Computation for Machine Learning With SPDZ

- V. Chen, Valerio Pastro, Mariana Raykova
- Computer Science
- ArXiv
- 2 January 2019

Secure Multi-Party Computation (MPC) is an area of cryptography that enables computation on sensitive data from multiple sources while maintaining privacy guarantees. However, theoretical MPC… Expand

On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations

- R. Cramer, I. Damgård, Valerio Pastro
- Computer Science, Mathematics
- ICITS
- 15 August 2012

We present a protocol that allows to prove in zero-knowledge that committed values xi, yi, zi, i=1,…,l satisfy xiyi=zi, where the values are taken from a finite field. For error probability 2−u the… Expand

Verifiable Computation over Encrypted Data in the Presence of Verification Queries

- R. Gennaro, Valerio Pastro
- Computer Science
- IACR Cryptol. ePrint Arch.
- 2014