Pages that link to "Item:Q1648788"
From MaRDI portal
The following pages link to Faster Gaussian sampling for trapdoor lattices with arbitrary modulus (Q1648788):
Displaying 29 items.
- Wildcarded identity-based encryption from lattices (Q2067630) (← links)
- Chosen-ciphertext lattice-based public key encryption with equality test in standard model (Q2072076) (← links)
- Rounding in the rings (Q2096527) (← links)
- Implementation of lattice trapdoors on modules and applications (Q2118540) (← links)
- Integral matrix Gram root and lattice Gaussian sampling without floats (Q2119026) (← links)
- Gadget-based iNTRU lattice trapdoors (Q2152053) (← links)
- Lattice-based public-key encryption with equality test supporting flexible authorization in standard model (Q2166741) (← links)
- Building an efficient lattice gadget toolkit: Subgaussian sampling and more (Q2292888) (← links)
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus (Q2329396) (← links)
- Simple Lattice Trapdoor Sampling from a Broad Class of Distributions (Q2941217) (← links)
- Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography (Q5041172) (← links)
- Isochronous Gaussian Sampling: From Inception to Implementation (Q5041213) (← links)
- Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy (Q5041224) (← links)
- Towards a Simpler Lattice Gadget Toolkit (Q5087269) (← links)
- Gaussian Sampling in Lattice Based Cryptography (Q5176890) (← links)
- Practical Applications of Improved Gaussian Sampling for Trapdoor Lattices (Q5228915) (← links)
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices (Q5918439) (← links)
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices (Q5918662) (← links)
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) (Q6104330) (← links)
- \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple (Q6133964) (← links)
- How to sample a discrete Gaussian (and more) from a random oracle (Q6169425) (← links)
- Scalable CCA-secure public-key authenticated encryption with keyword search from ideal lattices in cloud computing (Q6494637) (← links)
- Spherical Gaussian leftover hash lemma via the Rényi divergence (Q6535100) (← links)
- Identity-based encryption from lattices using approximate trapdoors (Q6535489) (← links)
- Practical randomized lattice gadget decomposition with application to FHE (Q6550632) (← links)
- Chainable functional commitments for unbounded-depth circuits (Q6582224) (← links)
- SoK: learning with errors, circular security, and fully homomorphic encryption (Q6635900) (← links)
- Batch signatures, revisited (Q6636110) (← links)
- Towards compact identity-based encryption on ideal lattices (Q6636118) (← links)
