Efficient homomorphic comparison methods with optimal complexity (Q2692383): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: AS 136 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FHEW / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TFHE / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GitHub / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-64834-3_8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2990280959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the concrete hardness of learning with errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial approximation of piecewise analytic functions on a compact subset of the real line / 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: (Leveled) fully homomorphic encryption without bootstrapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bootstrapping for approximate homomorphic encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bootstrapping for approximate homomorphic encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphic encryption for arithmetic of approximate numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical method for comparison on homomorphically encrypted numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerically stable improved Chebyshev-Halley type schemes for matrix sign function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Support-vector networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform approximation of \(\text{sgn} (x)\) by polynomials and entire functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy function approximation: A gradient boosting machine. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic gradient boosting. / 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: Algorithm AS 136: A K-Means Clustering Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functions of Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Wallis' formula / rank
 
Normal rank
Property / cites work
 
Property / cites work: The matrix sign function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on margin-based loss functions in classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Approximation of Piecewise Analytic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast convergent numerical method for matrix sign function with application in SDEs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5805320 / rank
 
Normal rank

Latest revision as of 18:08, 31 July 2024

scientific article
Language Label Description Also known as
English
Efficient homomorphic comparison methods with optimal complexity
scientific article

    Statements

    Efficient homomorphic comparison methods with optimal complexity (English)
    0 references
    0 references
    0 references
    0 references
    21 March 2023
    0 references
    homomorphic encryption
    0 references
    composite polynomial approximation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers