Vector commitments over rings and compressed -protocols

DOI10.1007/978-3-031-22318-1_7zbMATH Open1519.94038MaRDI QIDQ6169352FDOQ6169352

Authors: Thomas Attema, Ignacio Cascudo, Ronald Cramer, Ivan B. Damgård, Daniel E. Escudero 

Publication date: 14 August 2023

Published in: Theory of Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

arithmetic circuits modulo any numberverifiable computation on homomorphically encrypted data

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• A public key cryptosystem and a signature scheme based on discrete logarithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• The knowledge complexity of interactive proof-systems
• Title not available (Why is that?)
• Foundations of Cryptography
• Title not available (Why is that?)
• Title not available (Why is that?)
• Semi-homomorphic encryption and multiparty computation
• Non-interactive verifiable computing: outsourcing computation to untrusted workers
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
• \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
• More efficient commitments from structured lattice assumptions
• Aurora: transparent succinct arguments for R1CS
• Vector commitments and their applications
• Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
• Libra: succinct zero-knowledge proofs with optimal prover computation
• Flexible and efficient verifiable computation on encrypted data
• On the Size of Pairing-Based Non-interactive Arguments
• Efficient cryptosystems from \(2^k\)-th power residue symbols
• Transparent SNARKs from DARK compilers
• Boosting verifiable computation on encrypted data
• Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \)
• Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
• Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
• Time- and space-efficient arguments from groups of unknown order
• Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
• A compressed \(\varSigma \)-protocol theory for lattices

Cited In (4)

• Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
• On sigma-protocols and (packed) black-box secret sharing schemes
• Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
• I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups

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)