Pages that link to "Item:Q5454252"
From MaRDI portal
The following pages link to Worst‐Case to Average‐Case Reductions Based on Gaussian Measures (Q5454252):
Displaying 50 items.
- Implementation of lattice trapdoors on modules and applications (Q2118540) (← links)
- Short identity-based signatures with tight security from lattices (Q2118556) (← links)
- Secure hybrid encryption in the standard model from hard learning problems (Q2118559) (← links)
- On the quantum complexity of the continuous hidden subgroup problem (Q2119017) (← links)
- Hardness of LWE on general entropic distributions (Q2119024) (← links)
- Integral matrix Gram root and lattice Gaussian sampling without floats (Q2119026) (← links)
- A tighter proof for CCA secure inner product functional encryption: genericity meets efficiency (Q2124234) (← links)
- Counterexamples to new circular security assumptions underlying iO (Q2128580) (← links)
- Lower bounds on lattice sieving and information set decoding (Q2128585) (← links)
- Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security (Q2132442) (← links)
- An improved exact sampling algorithm for the standard normal distribution (Q2135885) (← links)
- On the higher-bit version of approximate inhomogeneous short integer solution problem (Q2149828) (← links)
- Gadget-based iNTRU lattice trapdoors (Q2152053) (← links)
- Lattice-based IBE with equality test supporting flexible authorization in the standard model (Q2152055) (← links)
- Non-commutative ring learning with errors from cyclic algebras (Q2154559) (← links)
- Lattice-based public-key encryption with equality test supporting flexible authorization in standard model (Q2166741) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Batch-OT with optimal rate (Q2170043) (← links)
- Quantum algorithms for variants of average-case lattice problems via filtering (Q2170094) (← links)
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography (Q2170105) (← links)
- Lattice trapdoors and IBE from middle-product LWE (Q2175903) (← links)
- On the smoothing parameter and last minimum of random orthogonal lattices (Q2182065) (← links)
- An efficient and batch verifiable conditional privacy-preserving authentication scheme for VANETs using lattice (Q2218485) (← links)
- Trapdoor delegation and HIBE from middle-product LWE in standard model (Q2229268) (← links)
- Efficient public-key encryption with equality test from lattices (Q2235763) (← links)
- On a certain class of positive definite functions and measures on locally compact abelian groups and inner-product spaces (Q2243155) (← links)
- Modular lattice signatures, revisited (Q2302153) (← links)
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus (Q2329396) (← links)
- Lattice-based revocable certificateless signature (Q2333434) (← links)
- Strongly unforgeable ring signature scheme from lattices in the standard model (Q2336385) (← links)
- Worst-case to average-case reductions for module lattices (Q2345928) (← links)
- Post-quantum cryptography: lattice signatures (Q2390954) (← links)
- Asymptotically efficient lattice-based digital signatures (Q2413615) (← links)
- On the probability of generating a lattice (Q2437315) (← links)
- Identity-based proxy re-signatures from lattices (Q2512816) (← links)
- A lattice-based signcryption scheme without random oracles (Q2515427) (← links)
- Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions (Q2661695) (← links)
- Scalable revocable identity-based signature over lattices in the standard model (Q2662710) (← links)
- Discrete Gaussian measures and new bounds of the smoothing parameter for lattices (Q2666966) (← links)
- More efficient construction of anonymous signatures (Q2673068) (← links)
- On the hardness of module learning with errors with short distributions (Q2677644) (← links)
- Non-committing encryption with constant ciphertext expansion from standard assumptions (Q2692376) (← links)
- Towards classical hardness of module-LWE: the linear rank case (Q2692385) (← links)
- Incremental symmetric puncturable encryption with support for unbounded number of punctures (Q2697484) (← links)
- Vector and functional commitments from lattices (Q2697903) (← links)
- Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling (Q2701491) (← links)
- How (Not) to Instantiate Ring-LWE (Q2827731) (← links)
- FHE Circuit Privacy Almost for Free (Q2829211) (← links)
- Circular Security Separations for Arbitrary Length Cycles from LWE (Q2829235) (← links)
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes (Q2829951) (← links)
