Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems (Q2161427): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10623-022-01083-7 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10623-022-01083-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4285091843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimate all the {LWE, NTRU} schemes! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovering Short Generators of Principal Ideals in Cyclotomic Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Stickelberger Class Relations and Application to Ideal-SVP / rank
 
Normal rank
Property / cites work
 
Property / cites work: LWE with side information: attacks and concrete security estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: NTRU Fatigue: How Stretched is Overstretched? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoors for hard lattices and new cryptographic constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coding theory: the unit-derived methodology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Signatures from the Partial Fourier Recovery Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: PASS-encrypt: a public key cryptosystem based on partial evaluation of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Compact Knapsacks Are Collision Resistant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Key Sizes (and Attacks) for LWE-Based Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Ideal Lattices and Learning with Errors over Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Ideal Lattices and Learning with Errors over Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical signatures from the Partial Fourier Recovery problem revisited: a provably-secure and Gaussian-distributed construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice-based Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decade of Lattice Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approx-SVP in ideal lattices with pre-processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ideal shortest vector problem over random rational primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Coding Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making NTRU as Secure as Worst-Case Problems over Ideal Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Public Key Encryption Based on Ideal Lattices / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10623-022-01083-7 / rank
 
Normal rank

Latest revision as of 07:40, 17 December 2024

scientific article
Language Label Description Also known as
English
Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
scientific article

    Statements

    Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems (English)
    0 references
    0 references
    0 references
    0 references
    4 August 2022
    0 references
    lattice-based cryptography
    0 references
    public key encryption
    0 references
    partial Vandermonde problem
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers