Toward practical lattice-based proof of knowledge from Hint-MLWE
From MaRDI portal
Recommendations
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Short zero-knowledge proof of knowledge for lattice-based commitment
- Zero-knowledge proofs from spLWE-based commitments
- Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- An efficient and parallel Gaussian sampler for lattices
- Better zero-knowledge proofs for lattice encryption and their application to group signatures
- Bi-deniable public-key encryption
- BLOOM: bimodal lattice one-out-of-many proofs and applications
- Circular and KDM security for identity-based encryption
- Classical hardness of learning with errors
- Fine-Tuning Groth-Sahai Proofs
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Homomorphic Encryption Standard
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Lattice signatures without trapdoors
- Lattice-Based Secure Biometric Authentication for Hamming Distance
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Maliciously secure matrix multiplication with applications to private deep learning
- More efficient commitments from structured lattice assumptions
- Multiparty Computation from Somewhat Homomorphic Encryption
- Multiparty computation with low communication, computation and interaction via threshold FHE
- On lattices, learning with errors, random linear codes, and cryptography
- Overdrive: making SPDZ great again
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Practical product proofs for lattice commitments
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
- Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(23)- Threshold raccoon: practical threshold signatures from standard lattice assumptions
- \textsf{Plover}: masking-friendly hash-and-sign lattice signatures
- Raccoon: a masking-friendly signature proven in the probing model
- Two-round threshold signature from algebraic one-more learning with errors
- \textit{Flood and submerse}: distributed key generation and robust threshold signature from lattices
- Adaptively secure 5 round threshold signatures from \textsf{MLWE}/\textsf{MSIS} and \textsf{DL} with rewinding
- Concretely efficient lattice-based polynomial commitment from standard assumptions
- Rejection-free framework of zero-knowledge proof based on \textsf{Hint-MLWE}
- \textsf{OPA}: one-shot private aggregation with single client interaction and its applications to federated learning
- Willow: secure aggregation with one-shot clients
- Unmasking \textsf{TRaccoon}: a lattice-based threshold signature with an efficient identifiable abort protocol
- Triple Ratchet: a bandwidth efficient hybrid-secure signal protocol
- Snake-eye resistant PKE from LWE for oblivious message retrieval and robust encryption
- Two-round threshold signature from algebraic one-more learning with errors
- Revisiting the security of approximate FHE with noise-flooding countermeasures
- Module learning with errors with truncated matrices
- Lattice-based multi-message multi-recipient KEM/PKE with malicious security
- A lattice-based IND-CCA threshold KEM from the BCHK+ transform
- IND-CPA-D and KR-D security with reduced noise from the HintLWE problem
- On the security and privacy of CKKS-based homomorphic evaluation protocols
- \textsf{TalonG}: bandwidth-efficient two-round threshold signatures from lattices
- Simulation-secure threshold PKE from LWE with polynomial modulus
- More efficient lattice-based electronic voting from NTRU
This page was built for publication: Toward practical lattice-based proof of knowledge from Hint-MLWE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6190149)
