On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols
From MaRDI portal
Publication:5744697
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
Cites work
- scientific article; zbMATH DE number 5009195 (Why is no real title available?)
- scientific article; zbMATH DE number 1303114 (Why is no real title available?)
- scientific article; zbMATH DE number 2043334 (Why is no real title available?)
- scientific article; zbMATH DE number 195199 (Why is no real title available?)
- scientific article; zbMATH DE number 3195417 (Why is no real title available?)
- (Leveled) fully homomorphic encryption without bootstrapping
- A Property of Finite Simple Non-Abelian Groups
- A method for obtaining digital signatures and public-key cryptosystems
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A simple BGN-type cryptosystem from LWE
- Additively homomorphic encryption with \(d\)-operand multiplications
- Algorithms for black-box fields and their application to cryptography
- Communication Complexity
- Computing Algebraic Formulas Using a Constant Number of Registers
- Efficient fully homomorphic encryption from (standard) LWE
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Implementing Gentry's fully-homomorphic encryption scheme
- Information Security and Privacy
- Lattice-based FHE as secure as PKE
- Lower Bounds on Information Transfer in Distributed Computations
- Minimal-latency secure function evaluation
- Multi-bit Cryptosystems Based on Lattice Problems
- Private searching on streaming data
- Probabilistic encryption
- Public Key Encryption That Allows PIR Queries
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Realizing complex boolean functions with simple groups
- Solvability of groups of odd order
- Succinct non-interactive arguments via linear interactive proofs
- Theory of Cryptography
- Theory of Cryptography
Cited in
(5)- A black-box construction of non-malleable encryption from semantically secure encryption
- Towards constructing fully homomorphic encryption without ciphertext noise from group theory
- Applications of finite non-abelian simple groups to cryptography in the quantum era
- Communication Complexity in Algebraic Two-Party Protocols
- Black-box proof of knowledge of plaintext and multiparty computation with low communication overhead
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)
