Pages that link to "Item:Q2102078"
From MaRDI portal
The following pages link to Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics (Q2102078):
Displaying 28 items.
- On the compressed-oracle technique, and post-quantum security of proofs of sequential work (Q2056756) (← links)
- Efficient range proofs with transparent setup from bounded integer commitments (Q2056793) (← links)
- Zero-knowledge proofs for committed symmetric Boolean functions (Q2118554) (← links)
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
- Sumcheck arguments and their applications (Q2120101) (← links)
- A compressed \(\varSigma \)-protocol theory for lattices (Q2128575) (← links)
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge (Q2139628) (← links)
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions (Q2170057) (← links)
- An optimized inner product argument with more application scenarios (Q2673065) (← links)
- ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines (Q5087274) (← links)
- Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures (Q6041296) (← links)
- Zero-knowledge arguments for subverted RSA groups (Q6088994) (← links)
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version) (Q6134420) (← links)
- Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers (Q6134857) (← links)
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs (Q6155262) (← links)
- Proofs for inner pairing products and applications (Q6157545) (← links)
- Threshold signatures with private accountability (Q6166965) (← links)
- Quantum rewinding for many-round protocols (Q6169349) (← links)
- Fiat-Shamir transformation of multi-round interactive proofs (Q6169350) (← links)
- Vector commitments over rings and compressed \(\varSigma \)-protocols (Q6169352) (← links)
- Practical round-optimal blind signatures in the ROM from standard assumptions (Q6562573) (← links)
- Multilinear Schwartz-Zippel \(\operatorname{mod} \mathrm{N}\) and lattice-based succinct arguments (Q6582225) (← links)
- How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach (Q6582228) (← links)
- Succinct verification of compressed sigma protocols in the updatable SRS setting (Q6635775) (← links)
- On sigma-protocols and (packed) black-box secret sharing schemes (Q6635779) (← links)
- Bulletproofs++: next generation confidential transactions via reciprocal set membership arguments (Q6637547) (← links)
- An efficient ZK compiler from SIMD circuits to general circuits (Q6655875) (← links)
- Shuffle arguments based on subset-checking (Q6660397) (← links)
