Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
From MaRDI portal
Publication:5097051
DOI10.1007/978-3-319-24174-6_16zbMath1499.68113OpenAlexW2291524553MaRDI QIDQ5097051
Krzysztof Pietrzak, Stephan Krenn, Fabrice Benhamouda, Vadim Lyubashevsky
Publication date: 19 August 2022
Published in: Computer Security -- ESORICS 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-24174-6_16
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Communication complexity, information complexity (68Q11)
Related Items
Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment ⋮ Lattice-based zero-knowledge arguments for additive and multiplicative relations ⋮ Efficient lattice-based polynomial evaluation and batch ZK arguments ⋮ Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs ⋮ Asymptotically quasi-optimal cryptography ⋮ Message-Restriction-Free Commitment Scheme Based on Lattice Assumption ⋮ Lattice-Based Proof of a Shuffle ⋮ Vector commitments over rings and compressed \(\varSigma \)-protocols ⋮ Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption ⋮ Unnamed Item ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ Practical product proofs for lattice commitments ⋮ Covert authentication from lattices ⋮ Improved lattice-based mix-nets for electronic voting ⋮ QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge
