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.
Filters
Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
However, in the multi-party setting, all concretely efficient fully-secure protocols, such as SPDZ, require many rounds of communication. ...
In this paper, we present a constant-round multiparty secure computation protocol that is fully-secure in the presence of malicious adversaries and for any number of corrupted parties. ...
The basic idea behind the construction is to use an efficient (either constant or non-constant round) protocol, with security for malicious adversaries, to compute the gate tables of the BMR garbled circuit ...
doi:10.1007/978-3-662-48000-7_16
fatcat:3u4ajyjz4vhydgm2v2umvkhkxa
Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ
2019
Journal of Cryptology
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.
In this paper, we present a constant-round multi-party secure computation protocol that is fully secure in the presence of malicious adversaries and for any number of corrupted parties. ...
However, in the multi-party setting, all concretely efficient fully secure protocols, such as SPDZ, require many rounds of communication. ...
Acknowledgements The first and fourth authors were supported in part by the European Research ...
doi:10.1007/s00145-019-09322-2
fatcat:lxeqssqwtbdpref5f4qxq4t2ui
More Efficient Constant-Round Multi-party Computation from BMR and SHE
[chapter]
2016
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 2016; you can also visit the original URL.
The file type is application/pdf.
We present a multi-party computation protocol in the case of dishonest majority which has very low round complexity. ...
Whilst in comparison to the SPDZ-BMR protocol we require only a quadratic complexity in the number of players (as opposed to cubic), we have fewer rounds, and we require less proofs of correctness of ciphertexts ...
parties choose which ciphertexts to open, and in the third round the ciphertexts are opened and combined. 3 Thus, overall, three rounds suffice. ...
doi:10.1007/978-3-662-53641-4_21
fatcat:syycakbu7remhmxoo2npju4zzi
Zaphod
2019
Proceedings of the 7th ACM Workshop on Encrypted Computing & Applied Homomorphic Cryptography - WAHC'19
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.
(Asiacrypt 2017) (to enable it to support reactive computation), and combine different aspects of their pre-processing phase with those of Wang et al. ...
We also give a more efficient method for producing daBits (double authenticated Bits) than that presented in the work of Rotaru and Wood (ePrint 2019). ...
In this case, the total amount of communication depends on the number of AND gates, but the round complexity is constant. ...
doi:10.1145/3338469.3358943
dblp:conf/ccs/AlyORS019
fatcat:dn3ukdlgibfr5g6whtrc2arlbu
Global-Scale Secure Multiparty Computation
2017
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security - CCS '17
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 propose a new, constant-round protocol for multi-party computation of boolean circuits that is secure against an arbitrary number of malicious corruptions. ...
We validate these claims via several experiments demonstrating both the efficiency and scalability of our protocol: • Efficiency: For three-party computation over a LAN, our protocol requires only 95 ms ...
The author would like to thank Roberto Trifiletti, Yan Huang and Ruiyu Zhu for their helpful comments. ...
doi:10.1145/3133956.3133979
dblp:conf/ccs/WangRK17a
fatcat:geqdfp7oybhk5mt6ln55rtcm4y
Low Cost Constant Round MPC Combining BMR and Oblivious Transfer
[chapter]
2017
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 2017; you can also visit the original URL.
The file type is application/pdf.
In this work, we present two new universally composable, actively secure, constant round multi-party protocols for generating BMR garbled circuits with free-XOR and reduced costs. 1. ...
We demonstrate the practicality of our second protocol with an implementation, and perform experiments with up to 9 parties securely computing the AES and SHA-256 circuits. ...
Acknowledgements We are grateful to Moriya Farbstein and Lior Koskas for their valuable assistance with implementation and experiments. We also thank Yehuda Lindell for helpful feedback. ...
doi:10.1007/978-3-319-70694-8_21
fatcat:ebby445msfh4zorzucibmalelq
Raziel: Private and Verifiable Smart Contracts on Blockchains
[article]
2020
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.
Other Versions
Raziel combines secure multi-party computation and proof-carrying code to provide privacy, correctness and verifiability guarantees for smart contracts on blockchains. ...
Finally, we show how miners could get rewarded for generating pre-processing data for secure multi-party computation. ...
Acknowledgments I would like to thank David Evans and Jonathan Katz for helpful comments on the paper. ...
arXiv:1807.09484v2
fatcat:ksncs6sm4bclfkhw6vhmfeqbdu
ABG: A Multi-Party Mixed Protocol Framework for Privacy-Preserving Cooperative Learning
[article]
2022
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 2022; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2022 pre-print arXiv:2202.02928v1 fatcat:yzbxngkvardq3la6lspsohabla
In this work, we propose a multi-party mixed protocol framework, ABG^n, which effectively implements arbitrary conversion between Arithmetic sharing (A), Boolean sharing (B) and Garbled-Circuits sharing ...
Based on ABG^n, we design a privacy-preserving multi-party cooperative learning system, which allows different data owners to cooperate in machine learning in terms of data security and privacy-preserving ...
It adapts the main idea of Yao's Garbled Circuits protocol (GC) to a multi-party setting, and it runs in a constant (in the depth of the circuit) number of rounds while achieving security in against any ...
arXiv:2202.02928v2
fatcat:oup6mqpk2zcyrkj7q2etphllzm
Outsourcing Private Machine Learning via Lightweight Secure Arithmetic Computation
[article]
2018
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.
In this work, we propose an actively secure protocol for outsourcing secure and private machine learning computations. ...
We showcase the efficiency of our protocol by applying it to real-world instances of arithmetized neural network computations, including a network trained to perform collaborative disease prediction. ...
Smart, and Avishay Yanai. Efficient constant round multi-party computation
combining BMR and SPDZ. In CRYPTO, pages 319-338, 2015.
[LSSS14]
Roi Livni, Shai Shalev-Shwartz, and Ohad Shamir. ...
arXiv:1812.01372v1
fatcat:tdxijdfz2vei3hefs2lolyubyq
Towards Practical Lattice-Based One-Time Linkable Ring Signatures
[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 2017; you can also visit the original URL.
The file type is application/pdf.
Our construction is statistically hiding as well as computationally binding and allows to commit to a vector of ring elements at once. ...
We show how to instantiate efficient zero-knowledge protocols that can be used to prove a number of relations among these commitments, and apply these in the context of lattice-based threshold cryptosystems ...
Smart, and Eduardo Soria-Vazquez. More efficient constant-round multi-party computation from BMR and SHE. In Advances
in Cryptology -EUROCRYPT 2012, pages 483-501, 2012.
Ajt96.
Miklós Ajtai. ...
doi:10.1007/978-3-030-01950-1_18
fatcat:ymdodcwgvzeutgenjzqi4g4omu
Input Secrecy & Output Privacy: Efficient Secure Computation of Differential Privacy Mechanisms
2021
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.
., by Google, Apple, and Microsoft. Additionally, cryptographic tools, namely, secure multi-party computation (MPC), protect the data during processing. ...
In this thesis, we present efficient MPC protocols for distributed parties to collaboratively compute D [...] ...
[WLJ19] to make the secure multi-party computation efficient. ...
doi:10.5445/ir/1000141098
fatcat:o5ff2uye2be7th6dwlvaohldnq
Efficient Private Function Evaluation
2021
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.
Private function evaluation (PFE) allows two or more parties to jointly compute a private function of one of the parties on the private inputs of the other parties securely. ...
We improve their concrete size by providing optimizations and show that PFE with UCs is efficient for realistic circuit sizes with hundreds of thousands of gates. ...
This work has been co-funded by the German Federal Ministry of Education and Research (BMBF) and the Hessen State Ministry for Higher Education, Research and the Arts (HMWK) within CRISP and by the DFG ...
doi:10.26083/tuprints-00017496
fatcat:nvvgirlijzg6venax5znicrkeq