Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
From MaRDI portal
Publication:2102078
DOI10.1007/978-3-030-56877-1_18zbMath1504.94095OpenAlexW3013005985MaRDI QIDQ2102078
Publication date: 7 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56877-1_18
zero-knowledgeverifiable computationplug-and-play\(\varSigma\)-protocolsbulletproofssecure algorithmicsZK-SNARKS
Related Items (22)
\textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments ⋮ Sumcheck arguments and their applications ⋮ A compressed \(\varSigma \)-protocol theory for lattices ⋮ Compressing proofs of \(k\)-out-of-\(n\) partial knowledge ⋮ Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions ⋮ ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines ⋮ An optimized inner product argument with more application scenarios ⋮ Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures ⋮ Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions ⋮ Zero-knowledge arguments for subverted RSA groups ⋮ Fiat-Shamir transformation of multi-round interactive proofs (Extended version) ⋮ Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers ⋮ Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs ⋮ Proofs for inner pairing products and applications ⋮ Threshold signatures with private accountability ⋮ Quantum rewinding for many-round protocols ⋮ Fiat-Shamir transformation of multi-round interactive proofs ⋮ Vector commitments over rings and compressed \(\varSigma \)-protocols ⋮ \textsf{Orbweaver}: succinct linear functional commitments from lattices ⋮ Algebraic reductions of knowledge ⋮ Efficient range proofs with transparent setup from bounded integer commitments ⋮ Zero-knowledge proofs for committed symmetric Boolean functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel coin-tossing and constant-round secure two-party computation
- Transparent SNARKs from DARK compilers
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Linear Algebra with Sub-linear Zero-Knowledge Arguments
- Designated Confirmer Signatures Revisited
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Quadratic Span Programs and Succinct NIZKs without PCPs
- On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations
- On the existence of extractable one-way functions
- Advances in Cryptology - CRYPTO 2003
- Secure Multiparty Computation and Secret Sharing
- On the Size of Pairing-Based Non-interactive Arguments
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- Efficient verifiable delay functions
This page was built for publication: Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
