On the concurrent composition of zero-knowledge proofs
From MaRDI portal
Recommendations
Cited in
(55)- Hybrid commitments and their applications to zero-knowledge proof systems
- General composition and universal composability in secure multiparty computation
- On the security loss of unique signatures
- Round-efficient black-box construction of composable multi-party computation
- On constant-round concurrent non-malleable proof systems
- Public-coin parallel zero-knowledge for NP
- On the concurrent composition of quantum zero-knowledge
- Composition with knowledge assumptions
- Random walks and concurrent zero-knowledge
- Non-black-box simulation in the fully concurrent setting, revisited
- Lower bounds and impossibility results for concurrent self composition
- Concurrent zero-knowledge. With additional background by Oded Goldreich
- Concurrent zero knowledge, revisited
- Simpler session-key generation from short random passwords
- Lower bounds for non-black-box zero knowledge
- Strengthening zero-knowledge protocols using signatures
- Individual simulations
- Concurrent knowledge extraction in public-key models
- scientific article; zbMATH DE number 1696658 (Why is no real title available?)
- Adaptive hardness and composable security in the plain model from standard assumptions
- Two-message, oblivious evaluation of cryptographic functionalities
- Client-server concurrent zero knowledge with constant rounds and guaranteed complexity
- The knowledge tightness of parallel zero-knowledge
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
- Eye for an eye: efficient concurrent zero-knowledge in the timing model
- Efficiency preserving transformations for concurrent non-malleable zero knowledge
- On non-black-box simulation and the impossibility of approximate obfuscation
- Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
- Local Sequentiality Does Not Help for Concurrent Composition
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- scientific article; zbMATH DE number 5568627 (Why is no real title available?)
- scientific article; zbMATH DE number 31277 (Why is no real title available?)
- scientific article; zbMATH DE number 177820 (Why is no real title available?)
- Concurrent zero-knowledge: Reducing the need for timing constraints
- Leakproof secret sharing protocols with applications to group identification scheme
- scientific article; zbMATH DE number 2009953 (Why is no real title available?)
- scientific article; zbMATH DE number 2009955 (Why is no real title available?)
- Possibility and impossibility results for selective decommitments
- scientific article; zbMATH DE number 1775426 (Why is no real title available?)
- On the Composition of Zero-Knowledge Proof Systems
- On concurrent zero-knowledge with pre-processing. (Extended abstract)
- Concurrent and resettable zero-knowledge in poly-logarithmic rounds
- Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
- Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting
- The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization
- Precise Concurrent Zero Knowledge
- Automata, Languages and Programming
- On the Composition of Two-Prover Commitments, and Applications to Multi-round Relativistic Commitments
- The power of undirected rewindings for adaptive security
- On sequential composition of precise zero-knowledge
- New limits of provable security and applications to ElGamal encryption
- CDS composition of multi-round protocols
- Improved black-box constructions of composable secure computation
- New limits for homomorphic encryption
- Non-interactive zero-knowledge proofs for composite statements
This page was built for publication: On the concurrent composition of zero-knowledge proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250778)
