On Deniability in the Common Reference String and Random Oracle Model (2003)
| Venue: | In proceedings of CRYPTO ’03, LNCS series |
| Citations: | 42 - 4 self |
BibTeX
@INPROCEEDINGS{Pass03ondeniability,
author = {Rafael Pass},
title = {On Deniability in the Common Reference String and Random Oracle Model},
booktitle = {In proceedings of CRYPTO ’03, LNCS series},
year = {2003},
pages = {316--337},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We revisit the definitions of zero-knowledge in the Common Reference String (CRS) model and the Random Oracle (RO) model. We argue that even though these definitions syntactically mimic the standard zero-knowledge definition, they loose some of its spirit. In particular, we show that there exist a specific natural security property that is not captured by these definitions. This is the property of deniability. We formally define the notion of deniable zero-knowledge in these models and investigate the possibility of achieving it. Our results are different for the two models: – Concerning the CRS model, we rule out the possibility of achieving deniable zero-knowledge protocols in “natural ” settings where such protocols cannot already be achieved in plain model. – In the RO model, on the other hand, we construct an efficient 2round deniable zero-knowledge argument of knowledge, that preserves both the zero-knowledge property and the proof of knowledge property under concurrent executions (concurrent zero-knowledge and concurrent proof-of knowledge). 1
