On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols

DOI10.1137/110858835zbMATH Open1360.94311OpenAlexW2323987218WikidataQ122261958 ScholiaQ122261958MaRDI QIDQ5744697FDOQ5744697

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

Recommendations

• Communication Complexity in Algebraic Two-Party Protocols
• Black-box proof of knowledge of plaintext and multiparty computation with low communication overhead
• Multiparty Computation from Somewhat Homomorphic Encryption
• Towards practical private information retrieval from homomorphic encryption
• Black-box constructions for secure computation

zbMATH Keywords

communication complexityhomomorphic encryptionprivate information retrieval

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Applications of finite non-abelian simple groups to cryptography in the quantum era
• Communication Complexity in Algebraic Two-Party Protocols
• Towards Constructing Fully Homomorphic Encryption without Ciphertext Noise from Group Theory
• A black-box construction of non-malleable encryption from semantically secure encryption

This page was built for publication: On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols

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