4-round resettably-sound zero knowledge
From MaRDI portal
Recommendations
- Resettably-sound resettable zero knowledge in constant rounds
- Resettably sound zero-knowledge arguments from OWFs -- the (semi) black-box way
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations
- Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model under Standard Assumption
- Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
Cited in
(18)- Round-optimal fully black-box zero-knowledge arguments from one-way permutations
- Pattern matching on encrypted streams
- Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds
- Resettably-sound resettable zero knowledge in constant rounds
- Non-interactive secure computation from one-way functions
- What security can we achieve within 4 rounds?
- Delayed-input cryptographic protocols
- Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?
- Post-quantum resettably-sound zero knowledge
- Concurrent knowledge extraction in public-key models
- What Security Can We Achieve Within 4 Rounds?
- Simultaneously resettable arguments of knowledge
- 3-message zero knowledge against human ignorance
- On non-black-box simulation and the impossibility of approximate obfuscation
- Constant-round concurrent zero-knowledge from indistinguishability obfuscation
- Resettably sound zero-knowledge arguments from OWFs -- the (semi) black-box way
- Resettable statistical zero-knowledge for NP
- Public-coin three-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
This page was built for publication: 4-round resettably-sound zero knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5746338)
