Vector commitments over rings and compressed -protocols
From MaRDI portal
(Redirected from Publication:6169352)
Vector commitments over rings and compressed \(\varSigma \)-protocols
Vector commitments over rings and compressed \(\varSigma \)-protocols
Recommendations
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- A compressed \(\varSigma \)-protocol theory for lattices
- Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
Cites work
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 5485522 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1302863 (Why is no real title available?)
- scientific article; zbMATH DE number 1303131 (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?)
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- A compressed \(\varSigma \)-protocol theory for lattices
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Aurora: transparent succinct arguments for R1CS
- Boosting verifiable computation on encrypted data
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Flexible and efficient verifiable computation on encrypted data
- Foundations of Cryptography
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \)
- More efficient commitments from structured lattice assumptions
- Non-interactive verifiable computing: outsourcing computation to untrusted workers
- On the size of pairing-based non-interactive arguments
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Semi-homomorphic encryption and multiparty computation
- The knowledge complexity of interactive proof-systems
- Time- and space-efficient arguments from groups of unknown order
- Transparent SNARKs from DARK compilers
- Vector commitments and their applications
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
Cited in
(8)- A compressed \(\varSigma \)-protocol theory for lattices
- Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
- Inner-product commitments over integers with applications to succinct arguments
- \textsf{Zinc}: succinct arguments with small arithmetization overheads from IOPs of proximity to the integers
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- On sigma-protocols and (packed) black-box secret sharing schemes
- I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups
- Hybrid zero-knowledge from garbled circuits
This page was built for publication: Vector commitments over rings and compressed \(\varSigma \)-protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169352)
