On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols

DOI10.1137/110858835zbMath1360.94311OpenAlexW2323987218WikidataQ122261958 ScholiaQ122261958MaRDI QIDQ5744697

William E. Skeith, Nirattaya Khamsemanan, Rafail Ostrovsky

Publication date: 19 February 2016

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/77ef8c342490f5303a944ac4b3958a1a0747737d

zbMATH Keywords

communication complexityhomomorphic encryptionprivate information retrieval

Mathematics Subject Classification ID

Cryptography (94A60) Information storage and retrieval of data (68P20)

Related Items

Towards Constructing Fully Homomorphic Encryption without Ciphertext Noise from Group Theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic encryption
• Solvability of groups of odd order
• Private searching on streaming data
• (Leveled) fully homomorphic encryption without bootstrapping
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Lattice-based FHE as secure as PKE
• Implementing Gentry’s Fully-Homomorphic Encryption Scheme
• Algorithms for Black-Box Fields and their Application to Cryptography
• Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
• Fully Homomorphic Encryption over the Integers
• A Simple BGN-Type Cryptosystem from LWE
• Additively Homomorphic Encryption with d-Operand Multiplications
• Public Key Encryption That Allows PIR Queries
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Lower Bounds on Information Transfer in Distributed Computations
• Computing Algebraic Formulas Using a Constant Number of Registers
• A method for obtaining digital signatures and public-key cryptosystems
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Communication Complexity
• Succinct Non-interactive Arguments via Linear Interactive Proofs
• Fully homomorphic encryption using ideal lattices
• Information Security and Privacy
• A Property of Finite Simple Non-Abelian Groups
• Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
• Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
• Realizing complex boolean functions with simple groups
• Theory of Cryptography
• Theory of Cryptography
• Multi-bit Cryptosystems Based on Lattice Problems