Cryptology ePrint Archive: Report 2012/508

Available versions in chronological order


On the (Im)Plausibility of Constant-Round Public-Coin Straight-Line-Simulatable Zero-Knowledge Proofs
Yi Deng and Juan Garay and San Ling and Huaxiong Wang and Moti Yung

On the (Im)Plausibility of Constant-Round Public-Coin Straight-Line-Simulatable Zero-Knowledge Proofs
Yi Deng and Juan Garay and San Ling and Huaxiong Wang and Moti Yung

On Limitations of Universal Simulation: Constant-Round Public-Coin Zero-Knowledge Proofs Imply Understanding Programs
Yi Deng and Juan Garay and San Ling and Huaxiong Wang and Moti Yung


[ Cryptology ePrint archive ]