Critical rounds in multi-round proofs: proof of partial knowledge and trapdoor commitments
From MaRDI portal
No records found.
Cites work
- A compressed \(\varSigma \)-protocol theory for lattices
- A generic transform from multi-round interactive proof to NIZK
- A new approach to efficient non-malleable zero-knowledge
- Acyclicity programming for sigma-protocols
- Aggregating Falcon signatures with LaBRADOR
- Automata, Languages and Programming
- Black-box (and fast) non-malleable zero knowledge
- CDS composition of multi-round protocols
- Compact proofs of partial knowledge for overlapping CNF formulae
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- Constant-round interactive proofs for delegating computation
- Constant-Size Commitments to Polynomials and Their Applications
- DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF
- Designated verifier proofs and their applications
- Efficient concurrent zero-knowledge in the auxiliary string model
- Efficient proofs of knowledge for threshold relations
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Fiat-Shamir bulletproofs are non-malleable (in the Random Oracle Model)
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- Generalized special-sound interactive proofs and their knowledge soundness
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 4195166 (Why is no real title available?)
- scientific article; zbMATH DE number 4101089 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- scientific article; zbMATH DE number 1440068 (Why is no real title available?)
- Improved OR-composition of sigma-protocols
- Interactive oracle proofs
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Multilinear Schwartz-Zippel \(\operatorname{mod} \mathrm{N}\) and lattice-based succinct arguments
- Non-interactive composition of sigma-protocols via Share-then-Hash
- On knowledge-soundness of Plonk in ROM from falsifiable assumptions
- On soundness notions for interactive oracle proofs
- On the power of secure two-party computation
- Online-extractability in the quantum random-oracle model
- Online/offline OR composition of sigma protocols
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
- Plonk is simulation extractable in ROM under falsifiable assumptions
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Spartan and bulletproofs are simulation-extractable (for free!)
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
- Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
- Threshold ring signatures: new definitions and post-quantum security
- Transparent SNARKs from DARK compilers
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
This page was built for publication: Critical rounds in multi-round proofs: proof of partial knowledge and trapdoor commitments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7305301)
