Pages that link to "Item:Q4977994"
From MaRDI portal
The following pages link to Pseudorandomness of ring-LWE for any ring and modulus (Q4977994):
Displaying 50 items.
- Traitor-tracing from LWE made simple and attribute-based (Q1631335) (← links)
- Two-message statistically sender-private OT from LWE (Q1631337) (← links)
- Memory lower bounds of reductions revisited (Q1648781) (← links)
- On the ring-LWE and polynomial-LWE problems (Q1648786) (← links)
- Provably secure NTRUEncrypt over any cyclotomic field (Q1726689) (← links)
- NTRU prime: reducing attack surface at low cost (Q1746970) (← links)
- Candidate iO from homomorphic encryption schemes (Q2055602) (← links)
- MPSign: a signature from small-secret middle-product learning with errors (Q2055685) (← links)
- On the ideal shortest vector problem over random rational primes (Q2056701) (← links)
- On the integer polynomial learning with errors problem (Q2061918) (← links)
- LWE from non-commutative group rings (Q2068391) (← links)
- Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP (Q2096523) (← links)
- Rounding in the rings (Q2096527) (← links)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- Compact ring signatures from learning with errors (Q2120080) (← links)
- Impossibility of quantum virtual black-box obfuscation of classical circuits (Q2120091) (← links)
- Universal product learning with errors: a new variant of \textsf{LWE} for lattice-based cryptography (Q2143125) (← links)
- The matrix reloaded: multiplication strategies in FrodoKEM (Q2149815) (← links)
- Non-commutative ring learning with errors from cyclic algebras (Q2154559) (← links)
- Algebraically structured LWE. Revisited (Q2175901) (← links)
- Lattice trapdoors and IBE from middle-product LWE (Q2175903) (← links)
- Matrix PRFs: constructions, attacks, and applications to obfuscation (Q2175904) (← links)
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles (Q2175948) (← links)
- On the smoothing parameter and last minimum of random orthogonal lattices (Q2182065) (← links)
- On the RLWE/PLWE equivalence for cyclotomic number fields (Q2668220) (← 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)
- Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices (Q2692387) (← links)
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers (Q2692389) (← links)
- The round complexity of quantum zero-knowledge (Q2695629) (← links)
- Rate-1 quantum fully homomorphic encryption (Q2695630) (← links)
- Classical Homomorphic Encryption for Quantum Circuits (Q3387755) (← links)
- (Q4612477) (← links)
- Quantum Hardness of Learning Shallow Classical Circuits (Q4994987) (← links)
- Constraining and Watermarking PRFs from Milder Assumptions (Q5041166) (← links)
- Kissing Numbers and Transference Theorems from Generalized Tail Bounds (Q5232155) (← links)
- Candidate iO from homomorphic encryption schemes (Q6109075) (← links)
- mrNISC from LWE with polynomial modulus (Q6116180) (← links)
- Classical Homomorphic Encryption for Quantum Circuits (Q6139825) (← links)
- Subfield algorithms for ideal- and module-SVP based on the decomposition group (Q6196952) (← links)
- Hardness of (M)LWE with semi-uniform seeds (Q6204543) (← links)
- Hardness of entropic module-LWE (Q6496885) (← links)
- Concrete analysis of approximate ideal-SIVP to decision ring-LWE reduction (Q6584316) (← links)
- RLWE/PLWE equivalence for the maximal totally real subextension of the \(2^rpq\)-th cyclotomic field (Q6584323) (← links)
- On the multi-user security of LWE-based NIKE (Q6587945) (← links)
- Ideal-SVP is hard for small-norm uniform prime ideals (Q6587946) (← links)
- Algebraically structured LWE, revisited (Q6595844) (← links)
- On Gaussian sampling, smoothing parameter and application to signatures (Q6595917) (← links)
- Pseudorandomness of decoding, revisited: adapting OHCP to code-based cryptography (Q6595926) (← links)
- Too many hints -- when LLL breaks LWE (Q6604869) (← links)
