On the Composition of Zero-Knowledge Proof Systems
From MaRDI portal
(Redirected from Publication:4875450)
Recommendations
- scientific article; zbMATH DE number 177820
- Composition of zero-knowledge proofs with efficient provers
- scientific article; zbMATH DE number 1304087
- On the Composition of Public-Coin Zero-Knowledge Protocols
- On the composition of public-coin zero-knowledge protocols
- Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
- A framework for practical universally composable zero-knowledge protocols
- scientific article; zbMATH DE number 4191124
- Zero-knowledge proofs from secure multiparty computation
- On sequential composition of precise zero-knowledge
Cited in
(96)- Parallel and Concurrent Security of the HB and HB + Protocols
- On the implausibility of constant-round public-coin zero-knowledge proofs
- On the enumeration of minimal non-pairwise compatibility graphs
- An efficient statistical zero-knowledge authentication protocol for smart cards
- Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
- Random oracles and non-uniformity
- Instance-hiding interactive proofs (extended abstract)
- The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization
- On Monotone Formula Composition of Perfect Zero-Knowledge Languages
- Optimal security for keyed hash functions: avoiding time-space tradeoffs for finding collisions
- Knowledge encryption and its applications to simulatable protocols with low round-complexity
- The Knowledge Complexity of Interactive Proof Systems
- Post-quantum insecurity from LWE
- GNUC: a new universal composability framework
- Concurrent knowledge extraction in public-key models
- Reduction zero-knowledge
- scientific article; zbMATH DE number 1952908 (Why is no real title available?)
- A one-round, two-prover, zero-knowledge protocol for NP
- A note on constant-round zero-knowledge proofs of knowledge
- Parallel repetition of computationally sound protocols revisited
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- An Equivalence Between Zero Knowledge and Commitments
- What security can we achieve within 4 rounds?
- Broadcast-optimal four-round MPC in the plain model
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations
- Round optimal black-box ``commit-and-prove
- Parallel and concurrent security of the HB and \(HB^{+}\) protocols
- On zero-knowledge with strict polynomial-time simulation and extraction from differing-input obfuscation for circuits
- The Complexity of Zero Knowledge
- Round-optimal black-box commit-and-prove with succinct communication
- Cryptography and cryptographic protocols
- On the round complexity of black-box secure MPC
- Possibility and impossibility results for selective decommitments
- The knowledge tightness of parallel zero-knowledge
- Long-term security and universal composability
- What Security Can We Achieve Within 4 Rounds?
- Hybrid commitments and their applications to zero-knowledge proof systems
- Instance-hiding interactive proofs
- Universality of graph homomorphism games and the quantum coloring problem
- Private coins versus public coins in zero-knowledge proof systems
- Scalable zkSNARKs for matrix computations. A generic framework for verifiable deep learning
- Round-optimal black-box MPC in the plain model
- Four-round statistical non-malleable zero-knowledge
- On sequential composition of precise zero-knowledge
- scientific article; zbMATH DE number 7758312 (Why is no real title available?)
- On the Composition of Public-Coin Zero-Knowledge Protocols
- scientific article; zbMATH DE number 176551 (Why is no real title available?)
- A uniform-complexity treatment of encryption and zero-knowledge
- Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- 3-message zero knowledge against human ignorance
- Post-quantum zero-knowledge with space-bounded simulation
- Round-optimal multi-party computation with identifiable abort
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
- Impossibility of black-box simulation against leakage attacks
- Statistical Zaps and new oblivious transfer protocols
- Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- On the composition of public-coin zero-knowledge protocols
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- Lower bounds for non-black-box zero knowledge
- Strong batching for non-interactive statistical zero-knowledge
- Existence of 3-round zero-knowledge proof systems for NP
- Non-interactive zero-knowledge proofs for composite statements
- Public-coin three-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
- Magic functions
- Public-coin parallel zero-knowledge for NP
- Weak Zero-Knowledge beyond the Black-Box Barrier
- On non-black-box simulation and the impossibility of approximate obfuscation
- Round-optimal zero-knowledge proofs of knowledge for NP
- On the adaptive security of Free-XOR-based garbling schemes in the plain model
- CDS composition of multi-round protocols
- Threshold secret sharing with geometric algebras
- The round complexity of statistical MPC with optimal resiliency
- An almost-constant round interactive zero-knowledge proof
- scientific article; zbMATH DE number 708809 (Why is no real title available?)
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- The hunting of the SNARK
- Sherlock Holmes zero-knowledge protocols secure against active attackers
- How to simulate it -- a tutorial on the simulation proof technique
- Individual simulations
- Post-quantum resettably-sound zero knowledge
- On the existence of extractable one-way functions
- scientific article; zbMATH DE number 177820 (Why is no real title available?)
- Which languages have 4-round zero-knowledge proofs?
- Composition of zero-knowledge proofs with efficient provers
- Concurrent composition of differential privacy
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle?
- Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract)
- Mathematical Foundations of Computer Science 2004
- Two-message, oblivious evaluation of cryptographic functionalities
- Non-black-box simulation in the fully concurrent setting, revisited
- Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
- Constructing tree decompositions of graphs with bounded gonality
This page was built for publication: On the Composition of Zero-Knowledge Proof Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875450)
