## CryptoDB

### Rosario Gennaro

#### Publications

Year
Venue
Title
2022
TCC
Vector Commitments allow one to (concisely) commit to a vector of messages so that one can later (concisely) open the commitment at selected locations. In the state of the art of vector commitments, {\em algebraic} constructions have emerged as a particularly useful class, as they enable advanced properties, such as stateless updates, subvector openings and aggregation, that are for example unknown in Merkle-tree-based schemes. In spite of their popularity, algebraic vector commitments remain poorly understood objects. In particular, no construction in standard prime order groups (without pairing) is known. In this paper, we shed light on this state of affairs by showing that a large class of concise algebraic vector commitments in pairing-free, prime order groups are impossible to realize. Our results also preclude any cryptographic primitive that implies the algebraic vector commitments we rule out, as special cases. This means that we also show the impossibility, for instance, of succinct polynomial commitments and functional commitments (for all classes of functions including linear forms) in pairing-free groups of prime order.
2018
CRYPTO
We develop a general approach to adding a threshold functionality to a large class of (non-threshold) cryptographic schemes. A threshold functionality enables a secret key to be split into a number of shares, so that only a threshold of parties can use the key, without reconstructing the key. We begin by constructing a threshold fully-homomorphic encryption scheme (ThFHE) from the learning with errors (LWE) problem. We next introduce a new concept, called a universal thresholdizer, from which many threshold systems are possible. We show how to construct a universal thresholdizer from our ThFHE. A universal thresholdizer can be used to add threshold functionality to many systems, such as CCA-secure public-key encryption (PKE), signature schemes, pseudorandom functions, and others primitives. In particular, by applying this paradigm to a (non-threshold) lattice signature system, we obtain the first single-round threshold signature scheme from LWE.
2018
TCC
This paper initiates a study of Fine Grained Secure Computation: i.e. the construction of secure computation primitives against “moderately complex” adversaries. We present definitions and constructions for compact Fully Homomorphic Encryption and Verifiable Computation secure against (non-uniform) $\mathsf {NC}^1$ adversaries. Our results do not require the existence of one-way functions and hold under a widely believed separation assumption, namely $\mathsf {NC}^{1}\subsetneq \oplus \mathsf {L}/ {\mathsf {poly}}$ . We also present two application scenarios for our model: (i) hardware chips that prove their own correctness, and (ii) protocols against rational adversaries potentially relevant to the Verifier’s Dilemma in smart-contracts transactions such as Ethereum.
2016
JOFC
2014
PKC
2013
TCC
2013
CRYPTO
2013
ASIACRYPT
2013
EUROCRYPT
2012
TCC
2012
ASIACRYPT
2011
CRYPTO
2011
PKC
2010
PKC
2010
PKC
2010
JOFC
2010
CRYPTO
2009
JOFC
2008
TCC
2008
JOFC
2008
PKC
2008
EUROCRYPT
2007
PKC
2007
JOFC
2007
JOFC
2007
JOFC
2005
EUROCRYPT
2005
PKC
2005
JOFC
2004
ASIACRYPT
2004
CRYPTO
2004
CRYPTO
2004
EUROCRYPT
2004
TCC
2003
EUROCRYPT
2003
EUROCRYPT
2002
CRYPTO
2002
EUROCRYPT
2002
JOFC
2002
JOFC
2001
CHES
2001
EUROCRYPT
2000
CRYPTO
2000
EUROCRYPT
2000
JOFC
2000
JOFC
1999
CRYPTO
1999
EUROCRYPT
1999
EUROCRYPT
1998
CRYPTO
1998
EUROCRYPT
1997
CRYPTO
1997
CRYPTO
1997
EUROCRYPT
1996
CRYPTO
1996
EUROCRYPT
1995
EUROCRYPT

#### Program Committees

Crypto 2022
Crypto 2021
Crypto 2019
Crypto 2015 (Program chair)
Crypto 2014 (Program chair)
Asiacrypt 2013
TCC 2013
PKC 2013
Eurocrypt 2013
PKC 2012
PKC 2011 (Program chair)
Eurocrypt 2010
PKC 2009
PKC 2008
Crypto 2007
PKC 2006
TCC 2005
Eurocrypt 2004
Eurocrypt 2002
Asiacrypt 2001
Crypto 1999