Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
From MaRDI portal
Publication:5429387
DOI10.1007/978-3-540-72540-4_8zbMath1141.94382OpenAlexW2117642101MaRDI QIDQ5429387
Yunlei Zhao, Mordechai M. Yung
Publication date: 29 November 2007
Published in: Advances in Cryptology - EUROCRYPT 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72540-4_8
Related Items (9)
Concurrent knowledge extraction in public-key models ⋮ Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model ⋮ Individual simulations ⋮ Delayed-input cryptographic protocols ⋮ A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles ⋮ Improved OR-Composition of Sigma-Protocols ⋮ Resettably Secure Computation ⋮ Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model ⋮ Concurrent Non-Malleable Commitments (and More) in 3 Rounds
This page was built for publication: Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
