International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Omer Paneth

Affiliation: MIT

Publications

Year
Venue
Title
2019
CRYPTO
On Round Optimal Statistical Zero Knowledge Arguments
Nir Bitansky Omer Paneth
We construct the first three message statistical zero knowledge arguments for all of NP, matching the known lower bound. We do so based on keyless multi-collision resistant hash functions and the Learning with Errors assumption—the same assumptions used to obtain round optimal computational zero knowledge.The main component in our construction is a statistically witness indistinguishable argument of knowledge based on a new notion of statistically hiding commitments with subset opening.
2017
EUROCRYPT
2017
TCC
2016
EUROCRYPT
2016
TCC
2016
TCC
2016
TCC
2015
EPRINT
2015
EPRINT
2015
EPRINT
2015
EPRINT
2015
EPRINT
2015
EPRINT
2015
TCC
2015
TCC
2014
CRYPTO
2014
CRYPTO
2014
CRYPTO
2014
EUROCRYPT
2014
PKC
2014
TCC
2014
EPRINT
2014
EPRINT
2014
EPRINT
2014
EPRINT
2013
TCC
2013
TCC
2013
CRYPTO
2012
TCC

Program Committees

Crypto 2019
Eurocrypt 2017
TCC 2017