Pages that link to "Item:Q5172727"
From MaRDI portal
The following pages link to Public-key cryptosystems from the worst-case shortest vector problem (Q5172727):
Displaying 50 items.
- (Leveled) Fully Homomorphic Encryption without Bootstrapping (Q92720) (← links)
- On solving LPN using BKW and variants, Implementation and analysis (Q276557) (← links)
- Strongly secure authenticated key exchange from factoring, codes, and lattices (Q494585) (← links)
- Generating shorter bases for hard random lattices (Q537918) (← links)
- On the hardness of module-LWE with binary secret (Q826282) (← links)
- Lattice-based key exchange on small integer solution problem (Q1616180) (← links)
- Traitor-tracing from LWE made simple and attribute-based (Q1631335) (← links)
- Two-message statistically sender-private OT from LWE (Q1631337) (← links)
- Lattice-based certificateless encryption scheme (Q1633051) (← links)
- A pseudorandom number generator based on worst-case lattice problems (Q1675485) (← links)
- Hardness of \(k\)-LWE and applications in traitor tracing (Q1688407) (← links)
- On the asymptotic complexity of solving LWE (Q1692148) (← links)
- Efficient authentication from hard learning problems (Q1698400) (← links)
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption (Q1711842) (← links)
- Minimal condition for shortest vectors in lattices of low dimension (Q1739940) (← links)
- NTRU prime: reducing attack surface at low cost (Q1746970) (← links)
- A lattice-based group signature scheme with verifier-local revocation (Q1749538) (← links)
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance (Q1753174) (← links)
- Bonsai trees, or how to delegate a lattice basis (Q1928766) (← links)
- More constructions of lossy and correlation-secure trapdoor functions (Q1946593) (← links)
- A simple provably secure AKE from the LWE problem (Q1992397) (← links)
- A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE (Q2001181) (← links)
- On the structure of Boolean functions with small spectral norm (Q2012184) (← links)
- Verifying solutions to LWE with implications for concrete security (Q2025364) (← links)
- Collusion-resistant identity-based proxy re-encryption: lattice-based constructions in standard model (Q2031043) (← links)
- Revocable attribute-based proxy re-encryption (Q2048189) (← links)
- Verifiable single-server private information retrieval from LWE with binary errors (Q2055570) (← links)
- Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}} (Q2056681) (← links)
- New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts (Q2056698) (← links)
- Multiparty reusable non-interactive secure computation from LWE (Q2056764) (← links)
- Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption (Q2057139) (← links)
- Identity-based encryption with security against the KGC: a formal model and its instantiations (Q2062134) (← links)
- LWE from non-commutative group rings (Q2068391) (← links)
- On the rejection rate of exact sampling algorithm for discrete Gaussian distributions over the integers (Q2095466) (← links)
- Incompressible encodings (Q2096497) (← links)
- Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP (Q2096523) (← links)
- Slide reduction, revisited -- filling the gaps in SVP approximation (Q2096526) (← links)
- Rounding in the rings (Q2096527) (← links)
- An optimized GHV-type HE scheme: simpler, faster, and more versatile (Q2096603) (← links)
- A new post-quantum multivariate polynomial public key encapsulation algorithm (Q2102772) (← links)
- Hardness of LWE on general entropic distributions (Q2119024) (← links)
- Key-homomorphic pseudorandom functions from LWE with small modulus (Q2119025) (← links)
- Compact ring signatures from learning with errors (Q2120080) (← links)
- A black-box approach to post-quantum zero-knowledge in constant rounds (Q2120081) (← links)
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance (Q2128583) (← links)
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (Q2129007) (← links)
- Universal product learning with errors: a new variant of \textsf{LWE} for lattice-based cryptography (Q2143125) (← links)
- Attribute-based conditional proxy re-encryption in the standard model under LWE (Q2148755) (← links)
- Lattice-based HRA-secure attribute-based proxy re-encryption in standard model (Q2148757) (← links)
- Puncturable identity-based and attribute-based encryption from lattices (Q2166727) (← links)
