Results 1 to 10 of about 938 (179)
An efficient simulation for quantum secure multiparty computation [PDF]
Scientific Reports, 2021 The quantum secure multiparty computation is one of the important properties of secure quantum communication. In this paper, we propose a quantum secure multiparty summation (QSMS) protocol based on (t, n) threshold approach, which can be used in many ...
Kartick Sutradhar, Hari Om
doaj +2 more sources
Generation and Distribution of Quantum Oblivious Keys for Secure Multiparty Computation
Applied Sciences (Switzerland), 2020 The oblivious transfer primitive is sufficient to implement secure multiparty computation. However, secure multiparty computation based on public-key cryptography is limited by the security and efficiency of the oblivious transfer implementation.
Mariana Ramos +2 more
exaly +3 more sources
Scalable Secure Multiparty Computation [PDF]
Lecture Notes in Computer Science, 2006 We present the first general protocol for secure multiparty computation which is scalable, in the sense that the amortized work per player does not grow, and in some natural settings even vanishes, with the number of players. Our protocol is secure against an active adversary which may adaptively corrupt up to some constant fraction of the players. The
Ivan Damgård +2 more
exaly +3 more sources
Secure multiparty computation of a comparison problem. [PDF]
Springerplus, 2016 Private comparison is fundamental to secure multiparty computation. In this study, we propose novel protocols to privately determine [Formula: see text], or [Formula: see text] in one execution. First, a 0-1-vector encoding method is introduced to encode a number into a vector, and the Goldwasser-Micali encryption scheme is used to compare integers ...
Liu X, Li S, Liu J, Chen X, Xu G.
europepmc +4 more sources
Secure Multiparty Computation with Minimal Interaction [PDF]
Lecture Notes in Computer Science, 2010 We revisit the question of secure multiparty computation (MPC) with two rounds of interaction. It was previously shown by Gennaro et al. (Crypto 2002) that 3 or more communication rounds are necessary for general MPC protocols with guaranteed output delivery, assuming that there may be t ≥ 2 corrupted parties.
Eyal Kushilevitz +2 more
exaly +2 more sources
On 2-Round Secure Multiparty Computation [PDF]
Lecture Notes in Computer Science, 2002 Substantial efforts have been spent on characterizing the round complexity of various cryptographic tasks. In this work we study the round complexity of secure multiparty computation in the presence of an active (Byzantine) adversary, assuming the availability of secure point-to-point channels and a broadcast primitive.
Rosario Gennaro +2 more
exaly +2 more sources
Dynamic Decentralized Reputation System from Blockchain and Secure Multiparty Computation
Journal of Sensor and Actuator Networks, 2023 In decentralized environments, such as mobile ad hoc networks (MANETs) and wireless sensor networks (WSNs), traditional reputation management systems are not viable due to their dependence on a central authority that is both accessible and trustworthy ...
Faissal El Bouanani +2 more
exaly +3 more sources
Privacy-preserving record linkage in large databases using secure multiparty computation [PDF]
BMC Medical Genomics, 2018 Background Practical applications for data analysis may require combining multiple databases belonging to different owners, such as health centers. The analysis should be performed without violating privacy of neither the centers themselves, nor the ...
Peeter Laud, Alisa Pankova
doaj +2 more sources
A note on secure multiparty computation via higher residue symbols
Journal of Mathematical Cryptology, 2021 We generalize a protocol by Yu for comparing two integers with relatively small difference in a secure multiparty computation setting. Yu's protocol is based on the Legendre symbol.
Ignacio Cascudo, Reto Schnyder
exaly +2 more sources
Overcoming collaboration barriers in quantitative trait loci analysis [PDF]
Cell GenomicsIn this issue of Cell Genomics, Choi et al.1 report a novel approach, privateQTL, which leverages secure multiparty computation (MPC) to enable federated expression quantitative trait loci (eQTL) mapping across institutions without compromising data ...
Wen Zhang, Xiaohong Wu, Jing Gong
doaj +2 more sources