Batch bootstrapping. II: Bootstrapping in polynomial modulus only requires \(\tilde{O}(1)\) FHE multiplications in amortization (Q6063524): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Faster Bootstrapping with Polynomial Error / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large FHE gates from tensored homomorphic accumulator / 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: FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully homomorphic encryption using ideal lattices / 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: On Ideal Lattices and Learning with Errors over Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Toolkit for Ring-LWE Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ring Packing and Amortized FHEW Bootstrapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank

Latest revision as of 11:53, 21 August 2024

scientific article; zbMATH DE number 7776107
Language Label Description Also known as
English
Batch bootstrapping. II: Bootstrapping in polynomial modulus only requires \(\tilde{O}(1)\) FHE multiplications in amortization
scientific article; zbMATH DE number 7776107

    Statements

    Identifiers