Pages that link to "Item:Q5495828"

The following pages link to Classical hardness of learning with errors (Q5495828):

Displaying 50 items.

• On solving LPN using BKW and variants, Implementation and analysis (Q276557) (← links)
• On the hardness of module-LWE with binary secret (Q826282) (← links)
• SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions (Q831176) (← links)
• On basing search SIVP on \(\mathbf{NP}\)-hardness (Q1629401) (← links)
• Traitor-tracing from LWE made simple and attribute-based (Q1631335) (← links)
• Two-message statistically sender-private OT from LWE (Q1631337) (← links)
• On the ring-LWE and polynomial-LWE problems (Q1648786) (← links)
• Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
• Hardness of \(k\)-LWE and applications in traitor tracing (Q1688407) (← links)
• On the asymptotic complexity of solving LWE (Q1692148) (← links)
• Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption (Q1711842) (← links)
• The polynomial approximate common divisor problem and its application to the fully homomorphic encryption (Q1750401) (← links)
• Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance (Q1753174) (← 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)
• A framework for cryptographic problems from linear algebra (Q2023808) (← links)
• Verifying solutions to LWE with implications for concrete security (Q2025364) (← links)
• Towards a ring analogue of the leftover hash lemma (Q2027271) (← links)
• Collusion-resistant identity-based proxy re-encryption: lattice-based constructions in standard model (Q2031043) (← links)
• Limits on the efficiency of (ring) LWE-based non-interactive key exchange (Q2051406) (← links)
• Optimal broadcast encryption from pairings and LWE (Q2055600) (← links)
• Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes (Q2055683) (← links)
• Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}} (Q2056681) (← links)
• A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP (Q2056696) (← 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)
• On the integer polynomial learning with errors problem (Q2061918) (← links)
• Exact lattice sampling from non-Gaussian distributions (Q2061936) (← links)
• Round-optimal verifiable oblivious pseudorandom functions from ideal lattices (Q2061957) (← links)
• Identity-based encryption with security against the KGC: a formal model and its instantiations (Q2062134) (← links)
• Incompressible encodings (Q2096497) (← links)
• Rounding in the rings (Q2096527) (← links)
• A new post-quantum multivariate polynomial public key encapsulation algorithm (Q2102772) (← links)
• Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
• Quantum key search for ternary LWE (Q2118530) (← links)
• Hardness of LWE on general entropic distributions (Q2119024) (← links)
• Key-homomorphic pseudorandom functions from LWE with small modulus (Q2119025) (← links)
• Two-round oblivious transfer from CDH or LPN (Q2119032) (← links)
• Compact ring signatures from learning with errors (Q2120080) (← links)
• A black-box approach to post-quantum zero-knowledge in constant rounds (Q2120081) (← links)
• How to meet ternary LWE keys (Q2128581) (← links)
• Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (Q2129007) (← links)
• Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security (Q2132442) (← 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)
• On the higher-bit version of approximate inhomogeneous short integer solution problem (Q2149828) (← links)
• Puncturable identity-based and attribute-based encryption from lattices (Q2166727) (← links)
• On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography (Q2170105) (← links)