Concurrent non-malleable zero knowledge proofs
From MaRDI portal
Recommendations
- Concurrent non-malleable zero knowledge with adaptive inputs
- Statistical concurrent non-malleable zero-knowledge from one-way functions
- Statistical concurrent non-malleable zero-knowledge from one-way functions
- On constant-round concurrent non-malleable proof systems
- Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
Cited in
(29)- Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds
- On constant-round concurrent non-malleable proof systems
- Non-malleable functions and their applications
- Statistical concurrent non-malleable zero-knowledge from one-way functions
- Non-uniformly sound certificates with applications to concurrent zero-knowledge
- Towards malicious security of private coin honest verifier zero knowledge for NP via witness encryption
- Concurrent zero-knowledge. With additional background by Oded Goldreich
- Concurrent zero knowledge, revisited
- Non-malleable time-lock puzzles and applications
- scientific article; zbMATH DE number 1696658 (Why is no real title available?)
- Non-malleable zero knowledge: black-box constructions and definitional relationships
- Concurrent non-malleable zero knowledge with adaptive inputs
- Concurrent security and non-malleability
- Expedient Non-malleability Notions for Hash Functions
- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
- Efficiency preserving transformations for concurrent non-malleable zero knowledge
- Statistical concurrent non-malleable zero-knowledge from one-way functions
- Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
- An Observation on Non-Malleable Witness-Indistinguishability and Non-Malleable Zero-Knowledge
- Concurrent non-malleable statistically hiding commitment
- Concurrent Non-Malleable Witness Indistinguishable Argument from Any One-Way Function
- Constant-Round Nonmalleable Commitments from Any One-Way Function
- Statistical concurrent non-malleable zero knowledge
- Theory of Cryptography
- A new approach to efficient non-malleable zero-knowledge
- Black-box (and fast) non-malleable zero knowledge
- Improved black-box constructions of composable secure computation
- Four-round statistical non-malleable zero-knowledge
- Lower bounds for concurrent zero knowledge
This page was built for publication: Concurrent non-malleable zero knowledge proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3582768)