Secure Multi-pArty Computation Grid LOgistic REgression (SMAC-GLORE)
نویسندگان
چکیده
منابع مشابه
Secure Multi-pArty Computation Grid LOgistic REgression (SMAC-GLORE)
BACKGROUND In biomedical research, data sharing and information exchange are very important for improving quality of care, accelerating discovery, and promoting the meaningful secondary use of clinical data. A big concern in biomedical data sharing is the protection of patient privacy because inappropriate information leakage can put patient privacy at risk. METHODS In this study, we deployed...
متن کاملRegression on Distributed Databases via Secure Multi-Party Computation
We present a method for performing linear regression on the union of distributed databases that does not entail constructing an integrated database, and therefore preserves confidentiality of the individual databases. The method can be used by statistical agencies to share information from their individual databases, or to make such information available to others.
متن کاملUnconditionally Secure Multi-Party Computation
The most general type of multi-party computation involves n participants. Participant i supplies private data xi and obtains an output function fi(x1, . . . , xn). The computation is said to be unconditionally secure if each participant can verify, with probability arbitrarily close to one, that every other participant obtains arbitrarily little information beyond their agreed output fi. We giv...
متن کاملHeterogeneous Secure Multi-Party Computation
The increased processing power and storage capacity of inhome and mobile computing devices has motivated their inclusion in distributed and cloud computing systems. The resulting diverse environment creates a strong requirement for secure computations, which can be realised by Secure Multi-Party Computation (MPC). However, MPC most commonly assumes that parties performing the secure computation...
متن کاملEfficient Secure Multi-party Computation
Since the introduction of secure multi-party computation, all proposed protocols that provide security against cheating players suffer from very high communication complexities. The most efficient unconditionally secure protocols among n players, tolerating cheating by up to t < n/3 of them, require communicating O(n6) field elements for each multiplication of two elements, even if only one pla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Medical Informatics and Decision Making
سال: 2016
ISSN: 1472-6947
DOI: 10.1186/s12911-016-0316-1