Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
From MaRDI portal
Recommendations
- Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model under Standard Assumption
- Advances in Cryptology – CRYPTO 2004
- On round-optimal zero knowledge in the bare public-key model
- Improved Setup Assumptions for 3-Round Resettable Zero Knowledge
- scientific article; zbMATH DE number 2009952
Cited in
(16)- Delayed-input cryptographic protocols
- Individual simulations
- Concurrent knowledge extraction in public-key models
- A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
- Improved OR-composition of sigma-protocols
- Concurrent non-malleable commitments (and more) in 3 rounds
- Simultaneously resettable arguments of knowledge
- On round-optimal zero knowledge in the bare public-key model
- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
- Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model under Standard Assumption
- Resettably Secure Computation
- scientific article; zbMATH DE number 1955784 (Why is no real title available?)
- Advances in Cryptology – CRYPTO 2004
- Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
- 4-round resettably-sound zero knowledge
- An Extension to Bellare and Rogaway (1993) Model: Resetting Compromised Long-Term Keys
This page was built for publication: Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5429387)
