On Extension of Evaluation Algorithms in Keyed-Homomorphic Encryption

DOI10.1007/978-3-031-15255-9_10MaRDI QIDQ6487418zbMATH OpenFDO

Authors Koji Nuida

Publication date 18 January 2023

Full work available at URL https://doi.org/10.1007/978-3-031-15255-9_10

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Keyed-fully homomorphic encryption without indistinguishability obfuscation
• CCA-secure keyed-fully homomorphic encryption
• Chosen ciphertext secure keyed-homomorphic public-key encryption
• Chosen ciphertext secure keyed-homomorphic public-key cryptosystems
• On CCA-Secure Somewhat Homomorphic Encryption

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A method for obtaining digital signatures and public-key cryptosystems
• A new public-key cryptosystem as secure as factoring
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Authenticated encryption: Relations among notions and analysis of the generic composition paradigm
• CCA-secure keyed-fully homomorphic encryption
• Chosen ciphertext attacks against protocols based on the RSA encryption standard PKCS\#1
• Chosen ciphertext secure keyed-homomorphic public-key cryptosystems
• Chosen ciphertext secure keyed-homomorphic public-key encryption
• Chosen-Ciphertext Secure Fully Homomorphic Encryption
• Converting pairing-based cryptosystems from composite-order groups to prime-order groups
• Dual-system simulation-soundness with applications to UC-PAKE and more
• Evaluating 2-DNF formulas on ciphertexts
• Fully homomorphic encryption from ring-LWE and security for key dependent messages
• Fully homomorphic encryption over the integers
• Fully homomorphic encryption using ideal lattices
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• Keyed-fully homomorphic encryption without indistinguishability obfuscation
• Non-malleability from malleability: simulation-sound quasi-adaptive NIZK proofs and CCA2-secure encryption from homomorphic signatures
• On the (im)possibility of obfuscating programs (extended abstract)
• Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations
• Probabilistic encryption
• Public-key cryptosystems based on composite degree residuosity classes
• Relations among notions of security for public-key encryption schemes
• Short group signatures

Cited in

(5)

• Chosen ciphertext secure keyed-homomorphic public-key cryptosystems
• Keyed-fully homomorphic encryption without indistinguishability obfuscation
• CCA-secure keyed-fully homomorphic encryption
• Chosen ciphertext secure keyed-homomorphic public-key encryption
• Chosen ciphertext secure keyed two-level homomorphic encryption

This page was built for publication: On Extension of Evaluation Algorithms in Keyed-Homomorphic Encryption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487418)