Toward practical lattice-based proof of knowledge from Hint-MLWE
From MaRDI portal
Publication:6190149
DOI10.1007/978-3-031-38554-4_18OpenAlexW4385654365MaRDI QIDQ6190149
Duhyeong Kim, Dongwon Lee, Yongsoo Song, Jinyeong Seo
Publication date: 6 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38554-4_18
Cites Work
- Unnamed Item
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
- Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Overdrive: making SPDZ great again
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- More efficient commitments from structured lattice assumptions
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- Practical product proofs for lattice commitments
- SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
- Maliciously secure matrix multiplication with applications to private deep learning
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Lattice Signatures without Trapdoors
- Circular and KDM Security for Identity-Based Encryption
- Multiparty Computation from Somewhat Homomorphic Encryption
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
- An Efficient and Parallel Gaussian Sampler for Lattices
- Homomorphic Encryption Standard
- Bi-Deniable Public-Key Encryption
- Fine-Tuning Groth-Sahai Proofs
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Classical hardness of learning with errors
- On lattices, learning with errors, random linear codes, and cryptography
- Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- BLOOM: bimodal lattice one-out-of-many proofs and applications
This page was built for publication: Toward practical lattice-based proof of knowledge from Hint-MLWE
