Combinatorially homomorphic encryption

DOI10.1007/978-3-031-48618-0_9zbMATH Open1544.94254MaRDI QIDQ6582175FDOQ6582175

Authors: Yuval Ishai, Eyal Kushnir, Ron D. Rothblum 

Publication date: 2 August 2024

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

zbMATH Keywords

collision-resistant hash functionsprivate information retrieval schemes

Mathematics Subject Classification ID

Communication theory (94A05) Cryptography (94A60)

Cites Work

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

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)