A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Constant Rounds Almost Linear Complexity Multi-party Computation for Prefix Sum
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
One of research goals on multi-party computation (MPC) is to achieve both perfectly secure and efficient protocols for basic functions or operations (e.g., equality, comparison, bit decomposition, and ...
Recently, for many basic operations, MPC protocols with constant rounds and linear communication cost (in the input size) are proposed. ...
Introduction Multi-party computation (MPC) protocols for general circuits have been studied in many researches [13, 14, 7, 2, 5] . ...
doi:10.1007/978-3-319-06734-6_18
fatcat:2semie5mgbgs3dlqamwexcekly
Security against the business partner
2008
Proceedings of the 2008 ACM workshop on Secure web services - SWS '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
With it a new threat is emerging: security against the business partner. A possible solution is secure multi-party computation (SMC) and we give examples of its usefulness. ...
We give a detailed study and analysis of multi-party permutation and show the relations of the different theoretical complexities in this case. ...
CONCLUSION We argued that there is a growing trend towards security against the business partner. So far, only secure multi-party computation, seems to provide security guarantees. ...
doi:10.1145/1456492.1456493
dblp:conf/sws/KerschbaumD08
fatcat:7c4t6atrzjgnfmryxo6sfchplu
How Fair is Your Protocol?
2015
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing - PODC '15
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We also show optimal protocols with respect to our notion, in both the two-party and multiparty settings. ...
Security of distributed cryptographic protocols usually requires privacy (inputs of the honest parties remain hidden), correctness (the adversary cannot improperly affect the outcome), and fairness (if ...
Comparing 1/p-security with our notion. ...
doi:10.1145/2767386.2767431
dblp:conf/podc/GarayKTZ15
fatcat:okwufn66evasblgy7md2yitat4
Lightweight Self-Bootstrapping Multiparty Computations of Time-Series Data with Custom Collusion Tolerance
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Both protocols allow multiple rounds of aggregation from the same set of public keys generated by parties in an initial stage. ...
We prove that both protocols remain secure with this technique, and evaluate its impact on collusion tolerance and the number of rounds supported. ...
Since the latter might not be an acceptable option, given the sensitivity of the submitted information, there has been much research effort in the area of secure multi-party computation (MPC). ...
arXiv:1402.7118v1
fatcat:zahpok5iozhvfn6b5iypufza3y
Multi-valued Byzantine Broadcast: The t < n Case
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Examples of such applications are general purpose multi-party computation protocols and specific tasks like voting. Such a broadcast of long values is called multi-valued broadcast. ...
In particular, we are interested in optimizing their communication complexity. ...
Basically, this list can be continued with all protocols for secure multi-party computation as defined by Yao [Yao82, GMW87] . ...
doi:10.1007/978-3-662-45608-8_24
fatcat:54x33ihpo5dank62piq7rr5fdq
Behavioral Identification of Trusted Third Party in Secure Multiparty Computing Protocol
2012
International Journal of Security Privacy and Trust Management
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Also, single and multi trusted third party model is compared and the probabilistic evidences for them have been analyzed with security analysis graphs. ...
We present a solution for identification and reduction of malicious conduct by Trusted Third parties (TTPs) in Secure Multiparty Computing Protocol. ...
Secure multi-party computation (SMC) problem [3] is the problem of n parties to compute a private function of their inputs. ...
doi:10.5121/ijsptm.2012.1306
fatcat:nn5o4qxyebdk3avqcdbybzuvxa
Multi-objective optimization based privacy preserving distributed data mining in Peer-to-Peer networks
2010
Peer-to-Peer Networking and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Since distributed sum computation is a frequently used primitive, the proposed approach is likely to have significant impact on many data mining tasks such as multi-party privacy-preserving clustering, ...
Unlike most multi-party privacy-preserving data mining algorithms, this approach works in an asynchronous manner through local interactions and it is highly scalable. ...
Unlike most secure multi-party computation protocols, our algorithm does not assume semi-honest adversary [5] . ...
doi:10.1007/s12083-010-0075-1
fatcat:q5c7tpckxbc47kq4ixkglingg4
Efficient Secure Multi-party Computation
[chapter]
2000
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Since the introduction of secure multi-party computation, all proposed protocols that provide security against cheating players suffer from very high communication complexities. ...
Furthermore, we show that a sub-protocol proposed in [GRR98] for improving the efficiency of unconditionally secure multi-party computation is insecure. ...
Introduction
Secure Multi-party Computation The goal of secure multi-party computation, as introduced by Yao [Yao82] , is to enable a set of n players to compute an arbitrary agreed function of their ...
doi:10.1007/3-540-44448-3_12
fatcat:6cnw5u2bd5fhrg4v6wyicyy3u4
Parallelizing secure linear programming
2009
Concurrency and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Hence, from a business perspective there is a special need for privacy when solving such optimization problems. Secure multi-party computation (SMC) [14, 33] can help. ...
Secure multi-party computation can help by realizing protocols with guaranteed security. However, efficiency is a major concern. ...
The BSP-model is suitable for general secure multi-party computation (details on how to apply this model to SMC are described on Section 3.2). ...
doi:10.1002/cpe.1424
fatcat:xaf2wzc2vngc7jzbhx5xir3khe
Multi Decryption Key Agreement in Dynamic Peer Group
2017
DEStech Transactions on Computer Science and Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Two novel and practical protocols are put forwards and are compared with the exiting protocols, the proposed protocols are optimal with respect to protocol security and efficiency. ...
In this paper, we consider a class of protocols that we call natural extensions of multi decryption key to the n-party case for distributed networks. ...
The 2-party multi encryption key is extended to n parties. ...
doi:10.12783/dtcse/cnsce2017/8881
fatcat:6vujrvs42bf7ddtbdhwn7xunuy
Round-Optimal Secure Multiparty Computation with Honest Majority
[chapter]
2018
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We study the exact round complexity of secure multiparty computation (MPC) in the honest majority setting. We construct several round-optimal n-party protocols, tolerating any t < n 2 corruptions. 1. ...
In three rounds, however, we can achieve security assuming only one-way functions. ...
Since a multi-party OT can be represented as a degree 2 polynomial computation, a two-round multi-party OT protocol achieving this weaker security notion can be obtained from [26] . ...
doi:10.1007/978-3-319-96881-0_14
fatcat:6onhsimquzggniastap5bnweiq
CrypTen: Secure Multi-Party Computation Meets Machine Learning
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Secure multi-party computation (MPC) allows parties to perform computations on data while keeping that data private. ...
For example, two parties using CrypTen can securely predict phonemes in speech recordings using Wav2Letter faster than real-time. ...
Note that each party involved in the multi-party computation executes the same code. ...
arXiv:2109.00984v1
fatcat:vozpjrqnknanjnevo2tkxsttni
Multi party computations
1997
Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Yung, "How to withstand mobile virus attacks", Proceedings of the 101h Annual ACM Sgmposium on Principles oj Distributed Computing, 1991, pp 51-59. ...
Most importantly, se- cret sharing and computing with shares of a se- cret is fundamental to achieving secure multi- party computation. ...
multi-party protocol for j, as long as the number of total users n, and users in a faulty colition obey n z ct + 1 for optimal values of c z 2. ...
doi:10.1145/259380.259405
dblp:conf/podc/Goldwasser97
fatcat:kwtjmcxirvaepeco4qxjrtq66e
Design and implementation of privacy-preserving reconciliation protocols
2013
Proceedings of the Joint EDBT/ICDT 2013 Workshops on - EDBT '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Privacy-preserving reconciliation protocols on ordered sets are protocols that solve a particular subproblem of secure multiparty computation. ...
We implement and evaluate our protocols as well as two previously published multi-party reconciliation protocols. ...
In each round, the parties have to compute an element reduction and a set intersection. ...
doi:10.1145/2457317.2457339
dblp:conf/edbt/NeugebauerBMW13
fatcat:olcpz3kf2vg4jh6vwuhwu4sv3i
PICCO
2013
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Secure computation on private data has been an active area of research for many years and has received a renewed interest with the emergence of cloud computing. ...
The available tools, however, lacked a convenient mechanism for implementing a general-purpose program in a secure computation framework suitable for execution in not fully trusted environments. ...
In the multi-party setting, the results are available for 3 computational parties on a LAN. ...
doi:10.1145/2508859.2516752
dblp:conf/ccs/ZhangSB13
fatcat:3ejptqtoajcmdlzqgga3gpamk4
« Previous
Showing results 1 — 15 out of 31,675 results