Combinatorially homomorphic encryption

DOI10.1007/978-3-031-48618-0_9MaRDI QIDQ6582175zbMATH OpenFDO

Authors Yuval Ishai, Eyal Kushnir, Ron D. Rothblum

Publication date 2 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-48618-0_9

zbMATH Keywords

collision-resistant hash functionsprivate information retrieval schemes

Mathematics Subject Classification ID

Communication theory (94A05) Cryptography (94A60)

Recommendations

• Homomorphic Encryption with CCA Security
• How to compute on encrypted data
• Fully homomorphic encryption using ideal lattices
• Homomorphic encryption: from private-key to public-key
• Reconciling non-malleability with homomorphic encryption

Cites work

• scientific article; zbMATH DE number 1618044 (Why is no real title available?)
• scientific article; zbMATH DE number 1670848 (Why is no real title available?)
• scientific article; zbMATH DE number 5009196 (Why is no real title available?)
• scientific article; zbMATH DE number 177818 (Why is no real title available?)
• scientific article; zbMATH DE number 1302806 (Why is no real title available?)
• scientific article; zbMATH DE number 1394292 (Why is no real title available?)
• A Framework for Efficient and Composable Oblivious Transfer
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A simple BGN-type cryptosystem from LWE
• Advances in Cryptology - EUROCRYPT 2004
• Collision resistant hashing from sub-exponential learning parity with noise
• Communication Complexity
• Communication Complexity
• Efficient fully homomorphic encryption from (standard) LWE
• Efficient non-interactive secure computation
• Evaluating Branching Programs on Encrypted Data
• Fully homomorphic encryption using ideal lattices
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• Homomorphic encryption: from private-key to public-key
• Information Security
• Limits of provable security for homomorphic encryption
• Lossy encryption: Constructions from general assumptions and efficient selective opening chosen ciphertext security
• Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols
• Minicrypt primitives with algebraic structure and applications
• On basing private information retrieval on NP-hardness
• On lattices, learning with errors, random linear codes, and cryptography
• One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• Probabilistic encryption
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Statistically sender-private OT from LPN and derandomization
• Symmetric primitives with structured secrets
• Theory of Cryptography
• Theory of Cryptography
• Universally-Composable Two-Party Computation in Two Rounds
• Worst-case hardness for LPN and cryptographic hashing via code smoothing
• \(i\)-hop homomorphic encryption and rerandomizable Yao circuits

Cited in

(1)

• Somewhat homomorphic encryption from linear homomorphism and sparse LPN

This page was built for publication: Combinatorially homomorphic encryption

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