Pages that link to "Item:Q2475579"
From MaRDI portal
The following pages link to Generalized compact knapsacks, cyclic lattices, and efficient one-way functions (Q2475579):
Displaying 38 items.
- (Leveled) Fully Homomorphic Encryption without Bootstrapping (Q92720) (← links)
- Tightly secure signatures from lossy identification schemes (Q315555) (← links)
- Restricted linear congruences (Q331108) (← links)
- On the geometry of cyclic lattices (Q464733) (← links)
- LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme (Q498985) (← links)
- On the hardness of module-LWE with binary secret (Q826282) (← links)
- Memory lower bounds of reductions revisited (Q1648781) (← links)
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus (Q1648788) (← links)
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs (Q1648790) (← links)
- A pseudorandom number generator based on worst-case lattice problems (Q1675485) (← links)
- Security analysis of cryptosystems using short generators over ideal lattices (Q1756730) (← links)
- Bonsai trees, or how to delegate a lattice basis (Q1928766) (← links)
- A framework for cryptographic problems from linear algebra (Q2023808) (← links)
- Towards a ring analogue of the leftover hash lemma (Q2027271) (← links)
- On the ideal shortest vector problem over random rational primes (Q2056701) (← links)
- On the security of homomorphic encryption on approximate numbers (Q2056709) (← links)
- Random self-reducibility of ideal-SVP via Arakelov random walks (Q2096524) (← links)
- Covert authentication from lattices (Q2096622) (← links)
- Cyclic and well-rounded lattices (Q2121980) (← links)
- The Modular Subset-Sum Problem and the size of deletion correcting codes (Q2161417) (← links)
- A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme (Q2168799) (← links)
- Algebraically structured LWE. Revisited (Q2175901) (← links)
- An efficient and batch verifiable conditional privacy-preserving authentication scheme for VANETs using lattice (Q2218485) (← links)
- A verifiable threshold secret sharing scheme based on lattices (Q2224837) (← links)
- Tightly secure signature schemes from the LWE and subset sum assumptions (Q2330120) (← links)
- Permutation invariant lattices (Q2342643) (← links)
- Worst-case to average-case reductions for module lattices (Q2345928) (← links)
- Asymptotically efficient lattice-based digital signatures (Q2413615) (← links)
- An efficient CCA-secure cryptosystem over ideal lattices from identity-based encryption (Q2629405) (← links)
- On the hardness of module learning with errors with short distributions (Q2677644) (← links)
- Towards classical hardness of module-LWE: the linear rank case (Q2692385) (← links)
- An Efficient Post-Quantum One-Time Signature Scheme (Q2807220) (← links)
- Better Key Sizes (and Attacks) for LWE-Based Encryption (Q3073715) (← links)
- The Geometry of Lattice Cryptography (Q3092183) (← links)
- A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes (Q3540050) (← links)
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems (Q3600386) (← links)
- (Q4612477) (← links)
- Hardness of (M)LWE with semi-uniform seeds (Q6204543) (← links)
