The polynomial approximate common divisor problem and its application to the fully homomorphic encryption (Q1750401): 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.1016/j.ins.2015.07.021 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ins.2015.07.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1151877271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Homomorphism Becomes a Liability / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Leveled) fully homomorphic encryption without bootstrapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical hardness of learning with errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch Fully Homomorphic Encryption over the Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate common divisors via lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Small Root of a Univariate Modular Equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scale-Invariant Fully Homomorphic Encryption over the Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Homomorphic Encryption over the Integers with Shorter Public Keys / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Homomorphic Encryption over the Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modern Computer Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully homomorphic encryption using ideal lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast projection methods for minimal design problems in linear system theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of the Homomorphic Encryption Schemes FV and YASHE / 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-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice-based Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.INS.2015.07.021 / rank
 
Normal rank

Latest revision as of 08:09, 11 December 2024

scientific article
Language Label Description Also known as
English
The polynomial approximate common divisor problem and its application to the fully homomorphic encryption
scientific article

    Statements

    The polynomial approximate common divisor problem and its application to the fully homomorphic encryption (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 May 2018
    0 references
    polynomial approximate GCD problem
    0 references
    Chinese remainder theorem
    0 references
    fully homomorphic encryption
    0 references
    large integer arithmetic
    0 references
    SIMD operation
    0 references
    0 references

    Identifiers