How to Securely Collaborate on Data: Decentralized Threshold HE and Secure Key Update

  title={How to Securely Collaborate on Data: Decentralized Threshold HE and Secure Key Update},
  author={Eunkyung Kim and Jinhyuck Jeong and H. Yoon and Younghyun Kim and Jihoon Cho and J. Cheon},
  journal={IEEE Access},
Threshold homomorphic encryption (Threshold HE) schemes are modified homomorphic encryption schemes to be suitable for privacy-preserving data integration and analysis. In actual usage of it, one should take it care into consideration who manages secret keys. In Eurocrypt 2012, Asharov <italic>et al.</italic> proposed decentralized <inline-formula> <tex-math notation="LaTeX">$(n,n)$ </tex-math></inline-formula>-threshold HE schemes in bottom-up approach for which all <inline-formula> <tex-math… Expand
1 Citations
SoK: Privacy-Preserving Collaborative Tree-based Model Learning
This work surveys the literature on distributed and privacy-preserving training of tree-based models and systematizes its knowledge based on four axes: the learning algorithm, the collaborative model, the protection mechanism, and the threat model, to provide for the first time a framework analyzing the information leakage occurring in distributed tree- based model learning. Expand


Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
A somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security reduces to the worst-case hardness of problems on ideal lattices using the RLWE assumption, which allows us to completely abstract out the lattice interpretation. Expand
Threshold Cryptosystems From Threshold Fully Homomorphic Encryption
A general approach to adding a threshold functionality to a large class of (non-threshold) cryptographic schemes, and introduces a new concept, called a universal thresholdizer, from which many threshold systems are possible. Expand
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
This work constructs simple multiparty computation protocols secure against fully malicious attackers, tolerating any number of corruptions, and providing security in the universal composability framework. Expand
Efficient Multi-Key Homomorphic Encryption with Packed Ciphertexts with Application to Oblivious Neural Network Inference
This paper presents multi-key variants of two HE schemes with packed ciphertexts, and presents new relinearization algorithms which are simpler and faster than previous method by Chen et al. (TCC 2017). Expand
(Leveled) fully homomorphic encryption without bootstrapping
A novel approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions, using some new techniques recently introduced by Brakerski and Vaikuntanathan (FOCS 2011). Expand
Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
This paper constructs a new fully homomorphic encryption scheme from the Stehle and Steinfeld version based on standard lattice assumptions and a circular security assumption, which is scale-invariant and therefore avoids modulus switching and the size of ciphertexts is one ring element. Expand
How to share a secret
This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces. Expand
Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
A new tensoring technique for LWE-based fully homomorphic encryption that uses the same modulus throughout the evaluation process no need for "modulus switching", and this modulus can take arbitrary form. Expand
Better Bootstrapping for Approximate Homomorphic Encryption
This paper generalizes the Full-RNS variant of HEAAN proposed by Cheon et al. (SAC, 19) to reduce the number of temporary moduli used in key-switching and can support more depth computations without bootstrapping while ensuring the same level of security. Expand
Scale-Invariant Fully Homomorphic Encryption over the Integers
At Crypto 2012, Brakerski constructed a scale-invariant fully homomorphic encryption scheme based on the LWE problem, in which the same modulus is used throughout the evaluation process, instead of aExpand