Compressed -protocol theory and practical application to plug \& play secure algorithmics
From MaRDI portal
Publication:2102078
Recommendations
- Vector commitments over rings and compressed -protocols
- A compressed \(\varSigma \)-protocol theory for lattices
- Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
Cites work
- A non-PCP approach to succinct quantum-safe zero-knowledge
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Advances in Cryptology - CRYPTO 2003
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- Designated Confirmer Signatures Revisited
- Efficient verifiable delay functions
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- General secure multi-party computation from any linear secret-sharing scheme
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1088224 (Why is no real title available?)
- scientific article; zbMATH DE number 1162684 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Linear Algebra with Sub-linear Zero-Knowledge Arguments
- On the amortized complexity of zero knowledge protocols for multiplicative relations
- On the existence of extractable one-way functions
- On the size of pairing-based non-interactive arguments
- Parallel coin-tossing and constant-round secure two-party computation
- Quadratic span programs and succinct NIZKs without PCPs
- Secure multiparty computation and secret sharing
- Short pairing-based non-interactive zero-knowledge arguments
- Transparent SNARKs from DARK compilers
Cited in
(40)- On the compressed-oracle technique, and post-quantum security of proofs of sequential work
- Efficient range proofs with transparent setup from bounded integer commitments
- Zero-knowledge proofs for committed symmetric Boolean functions
- \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
- An optimized inner product argument with more application scenarios
- \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
- 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 -protocols
- \textsf{Orbweaver}: succinct linear functional commitments from lattices
- Algebraic reductions of knowledge
- Sigma protocols from verifiable secret sharing and their applications
- Practical round-optimal blind signatures in the ROM from standard assumptions
- Multilinear Schwartz-Zippel \(\operatorname{mod} \mathrm{N}\) and lattice-based succinct arguments
- How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach
- Succinct verification of compressed sigma protocols in the updatable SRS setting
- On sigma-protocols and (packed) black-box secret sharing schemes
- Bulletproofs++: next generation confidential transactions via reciprocal set membership arguments
- An efficient ZK compiler from SIMD circuits to general circuits
- Shuffle arguments based on subset-checking
- Universally composable SNARKs with transparent setup without programmable random oracle
- Straight-line knowledge extraction for multi-round protocols
- Hybrid zero-knowledge from garbled circuits
- Untangling the security of Kilian's protocol: upper and lower bounds
- The power of NAPs: compressing OR-proofs via collision-resistant hashing
- Verifiable secret sharing from symmetric key cryptography with improved optimistic complexity
- Compute, but verify: efficient multiparty computation over authenticated inputs
- Everlasting anonymous rate-limited tokens
This page was built for publication: Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102078)
