Lecture notes in computer science

Resettable Cryptography in Constant Rounds – The Case of Zero Knowledge

Yi Deng, Dengguo Feng, Vipul Goyal, Dongdai Lin, Amit Sahai, Moti M. Yung

Published Jan 1, 2011• 17 citations

Related papers

Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model

Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Visconti

Constant-Round Resettable Zero Knowledge With Concurrent Soundness in the Bare Public-Key Model

Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Visconti

Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model

Moti M. Yung, Yunlei Zhao

A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds

Nai-Hui Chia, Kai-Min Chung, Takashi Yamakawa

A novel approach to public-coin concurrent zero-knowledge and applications on resettable security

Zhenbin Yan, Yi Deng

Nearly Simultaneously Resettable Black-Box Zero Knowledge

Joshua Baron, Rafail Ostrovsky, Ivan Visconti