Combinatorially homomorphic encryption
From MaRDI portal
Publication:6582175
DOI10.1007/978-3-031-48618-0_9zbMATH Open1544.94254MaRDI QIDQ6582175
Eyal Kushnir, Yuval Ishai, Ron D. Rothblum
Publication date: 2 August 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Probabilistic encryption
- Collision resistant hashing from sub-exponential learning parity with noise
- Symmetric primitives with structured secrets
- Worst-case hardness for LPN and cryptographic hashing via code smoothing
- On Basing Private Information Retrieval on NP-Hardness
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Limits of Provable Security for Homomorphic Encryption
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Homomorphic Encryption: From Private-Key to Public-Key
- Efficient Non-interactive Secure Computation
- Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
- A Simple BGN-Type Cryptosystem from LWE
- i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
- Evaluating Branching Programs on Encrypted Data
- A Framework for Efficient and Composable Oblivious Transfer
- Universally-Composable Two-Party Computation in Two Rounds
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Communication Complexity
- Fully homomorphic encryption using ideal lattices
- Communication Complexity
- Advances in Cryptology - EUROCRYPT 2004
- One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
- Information Security
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- Theory of Cryptography
- Theory of Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- Minicrypt primitives with algebraic structure and applications
- Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols
- Statistically sender-private OT from LPN and derandomization
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)
