Public-key cryptosystems from the worst-case shortest vector problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1559544
- Shortest vector problems of \(p\)-adic random lattices and their application to a \(p\)-adic knapsack type cryptosystem
- scientific article; zbMATH DE number 1088230
- A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem
- New constructions of public-key encryption schemes from conjugacy search problems
- Foundations of Information and Knowledge Systems
- On the optimality of non-linear computations for symmetric key primitives
- Efficient public key encryption based on ideal lattices (extended abstract)
- From laconic zero-knowledge to public-key cryptography. Extended abstract
- Public-key cryptography from new multivariate quadratic assumptions
Cited in
(only showing first 100 items - show all)- Lattice-based key exchange on small integer solution problem
- Traitor-tracing from LWE made simple and attribute-based
- Two-message statistically sender-private OT from LWE
- Lattice-based certificateless encryption scheme
- A pseudorandom number generator based on worst-case lattice problems
- Hardness of \(k\)-LWE and applications in traitor tracing
- On the asymptotic complexity of solving LWE
- Efficient authentication from hard learning problems
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Minimal condition for shortest vectors in lattices of low dimension
- NTRU prime: reducing attack surface at low cost
- A lattice-based group signature scheme with verifier-local revocation
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- A lattice-based public-key cryptosystem
- Bonsai trees, or how to delegate a lattice basis
- More constructions of lossy and correlation-secure trapdoor functions
- A simple provably secure AKE from the LWE problem
- A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE
- Verifying solutions to LWE with implications for concrete security
- Collusion-resistant identity-based proxy re-encryption: lattice-based constructions in standard model
- Revocable attribute-based proxy re-encryption
- Verifiable single-server private information retrieval from LWE with binary errors
- Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}}
- New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts
- Multiparty reusable non-interactive secure computation from LWE
- Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption
- Identity-based encryption with security against the KGC: a formal model and its instantiations
- LWE from non-commutative group rings
- On the rejection rate of exact sampling algorithm for discrete Gaussian distributions over the integers
- Incompressible encodings
- Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP
- Slide reduction, revisited -- filling the gaps in SVP approximation
- Rounding in the rings
- An optimized GHV-type HE scheme: simpler, faster, and more versatile
- A new post-quantum multivariate polynomial public key encapsulation algorithm
- Hardness of LWE on general entropic distributions
- Key-homomorphic pseudorandom functions from LWE with small modulus
- Compact ring signatures from learning with errors
- A black-box approach to post-quantum zero-knowledge in constant rounds
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
- Universal product learning with errors: a new variant of \textsf{LWE} for lattice-based cryptography
- Attribute-based conditional proxy re-encryption in the standard model under LWE
- Lattice-based HRA-secure attribute-based proxy re-encryption in standard model
- Puncturable identity-based and attribute-based encryption from lattices
- Algebraically structured LWE. Revisited
- Matrix PRFs: constructions, attacks, and applications to obfuscation
- Generalized approach for analysing quantum key distribution experiments
- Improved broadcast attacks against subset sum problems via lattice oracle
- Lattice-based proxy-oriented identity-based encryption with keyword search for cloud storage
- Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more
- Computational fuzzy extractors
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Hardness of learning problems over Burnside groups of exponent 3
- Worst-case to average-case reductions for module lattices
- Survey of information security
- Comparison analysis of Ding's RLWE-based key exchange protocol and NewHope variants
- Estimation of the hardness of the learning with errors problem with a restricted number of samples
- A lattice-based signcryption scheme without random oracles
- An efficient CCA-secure cryptosystem over ideal lattices from identity-based encryption
- Toward non-interactive zero-knowledge proofs for NP from LWE
- Attribute-based proxy re-encryption from standard lattices
- Efficient and fully secure lattice-based IBE with equality test
- On the hardness of module learning with errors with short distributions
- On optimizing electricity markets performance
- Computational fuzzy extractor from LWE
- Improving convergence and practicality of slide-type reductions
- Adaptively secure inner product encryption from LWE
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
- Towards classical hardness of module-LWE: the linear rank case
- Succinct LWE sampling, random polynomials, and obfuscation
- Direct computation of branching programs and its applications to more efficient lattice-based cryptography
- On solving LPN using BKW and variants, Implementation and analysis
- Finding shortest lattice vectors in the presence of gaps
- Post-quantum forward-secure onion routing (future anonymity in today's budget)
- On the hardness of learning with rounding over small modulus
- Cryptographic assumptions: a position paper
- Adaptive security with quasi-optimal rate
- Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem
- A lattice-based group signature scheme with message-dependent opening
- Turing machines with shortcuts: efficient attribute-based encryption for bounded functions
- A novel fully homomorphic encryption scheme bsed on LWE
- How (not) to instantiate ring-LWE
- Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
- Circular Security Separations for Arbitrary Length Cycles from LWE
- Spooky Encryption and Its Applications
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Lattice-based fully dynamic multi-key FHE with short ciphertexts
- Cryptography from learning parity with noise
- Augmented Learning with Errors: The Untapped Potential of the Error Term
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Towards tightly secure lattice short signature and id-based encryption
- Preventing adaptive key recovery attacks on the GSW levelled homomorphic encryption scheme
- Encoding functions with constant online rate, or how to compress garbled circuit keys
- On error distributions in ring-based LWE
- Multi-bit leveled homomorphic encryption via dual LWE-based
- Lattice-based FHE as secure as PKE
- Cryptogenography
- Limits of random oracles in secure computation (extended abstract)
This page was built for publication: Public-key cryptosystems from the worst-case shortest vector problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5172727)
