Short discrete log proofs for FHE and ring-LWE ciphertexts
From MaRDI portal
Publication:2289214
DOI10.1007/978-3-030-17253-4_12zbMath1465.94067OpenAlexW2919746912MaRDI QIDQ2289214
Vadim Lyubashevsky, Rafael del Pino, Gregor Seiler
Publication date: 28 January 2020
Full work available at URL: https://zenodo.org/record/3355457
arithmetic circuitzero-knowledge argumentdiscrete logarithm assumptionsigma-protocolfully-homomorphic encryption
Related Items (13)
Sumcheck arguments and their applications ⋮ Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography ⋮ Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions ⋮ Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices ⋮ A compressed \(\varSigma \)-protocol theory for lattices ⋮ More efficient amortization of exact zero-knowledge proofs for LWE ⋮ Gemini: elastic SNARKs for diverse environments ⋮ Fiat-Shamir transformation of multi-round interactive proofs (Extended version) ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ Fiat-Shamir transformation of multi-round interactive proofs ⋮ Succinct Diophantine-satisfiability arguments ⋮ Practical exact proofs from lattices: new techniques to exploit fully-splitting rings ⋮ Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
This page was built for publication: Short discrete log proofs for FHE and ring-LWE ciphertexts
