Achievable \textsf{CCA2} relaxation for homomorphic encryption (Q6114265): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-031-22365-5_3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4312321890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achievable \textsf{CCA2} relaxation for homomorphic encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: FHE Circuit Privacy Almost for Free / 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: Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chosen-Ciphertext Secure Fully Homomorphic Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Definitions and Separations for Circular Security / 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: TFHE: fast fully homomorphic encryption over the torus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuit-Private Multi-key FHE / 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: Sanitization of FHE Ciphertexts / 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: Privacy-preserving ridge regression with only linearly-homomorphic encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient secure two-party protocols. Techniques and constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating Branching Programs on Encrypted Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: CCA-Secure Keyed-Fully Homomorphic Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: On CCA-Secure Somewhat Homomorphic Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maliciously Circuit-Private FHE / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decade of Lattice Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations / 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: Must You Know the Code of f to Securely Compute f? / rank
 
Normal rank

Latest revision as of 14:06, 2 August 2024

scientific article; zbMATH DE number 7726490
Language Label Description Also known as
English
Achievable \textsf{CCA2} relaxation for homomorphic encryption
scientific article; zbMATH DE number 7726490

    Statements

    Achievable \textsf{CCA2} relaxation for homomorphic encryption (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 August 2023
    0 references
    CPA-secure encryption scheme
    0 references
    circular security
    0 references

    Identifiers