Filters








3,840 Hits in 7.0 sec

Multi party computations

Shafi Goldwasser
1997 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97  
Ostrovsky and M. Yung, "How to withstand mobile virus attacks", Proceedings of the 101h Annual ACM Sgmposium on Principles oj Distributed Computing, 1991, pp 51-59.  ...  multi-party computation by Canetti and Genaro [CG] .  ...  80's the focus of research was to show the most general result possible yielding multi-party protocol solutions fo any probabilistic function, any adversary class, and any network constraints, the theme  ... 
doi:10.1145/259380.259405 dblp:conf/podc/Goldwasser97 fatcat:kwtjmcxirvaepeco4qxjrtq66e

Multi-Party Trust Computation in Decentralized Environments

Tassos Dimitriou, Antonis Michalas
2012 2012 5th International Conference on New Technologies, Mobility and Security (NTMS)  
Our protocol allows n participants to cast their votes in a way that preserves the privacy of individual values against both internal and external attacks.  ...  The behavior of our protocol is tested in a real P2P network by measuring its communication delay and processing overhead.  ...  As part of our future research, we intend to consider defense mechanisms that will effectively manage malicious adversaries, adversaries that deviate from the designated honestbut-curious behavior examined  ... 
doi:10.1109/ntms.2012.6208686 dblp:conf/ntms/DimitriouM12 fatcat:twxjyabz6fgjjjdft7qvgfzdjm

Secure multi-party computation made simple

Ueli Maurer
2006 Discrete Applied Mathematics  
Known secure multi-party computation protocols are quite complex, involving non-trivial mathematical structures and subprotocols.  ...  For specific tasks like collective contract signing, on-line auctions, or voting, there exist very efficient protocols.  ...  Acknowledgements The author would like to thank Matthias Fitzi and Martin Hirt for interesting discussions on secure multi-party computation which were the motivation for this work.  ... 
doi:10.1016/j.dam.2005.03.020 fatcat:rhgxrbszrne4xmlod4cwid3hm4

Secure Multi-party Computation Made Simple [chapter]

Ueli Maurer
2003 Lecture Notes in Computer Science  
Known secure multi-party computation protocols are quite complex, involving non-trivial mathematical structures and subprotocols.  ...  For specific tasks like collective contract signing, on-line auctions, or voting, there exist very efficient protocols.  ...  Acknowledgements The author would like to thank Matthias Fitzi and Martin Hirt for interesting discussions on secure multi-party computation which were the motivation for this work.  ... 
doi:10.1007/3-540-36413-7_2 fatcat:7umiln2scnaptd3d5xw6ho43ta

Constant-round Multi-party Quantum Computation for Constant Parties [article]

Zhu Cao
2020 arXiv   pre-print
In this work, we propose the first constant-round multi-party quantum computation protocol for a fixed number of parties against specious adversaries, thereby significantly reducing the required number  ...  The extension to the quantum regime was proposed in 2002, but despite two decades of research, the current state-of-the-art multi-party quantum computation protocol for a fixed number of parties (even  ...  SLH00202007 from East China University of Science and Technology. Note added.-After submission of the manuscript, we became aware of related works by Bartusek et al. [45] and Alon et al. [46] .  ... 
arXiv:2011.12061v1 fatcat:g2jczxv2efbq7ifbr5jkko6dia

Publicly Auditable Secure Multi-Party Computation [chapter]

Carsten Baum, Ivan Damgård, Claudio Orlandi
2014 Lecture Notes in Computer Science  
In the last few years, the efficiency of secure multi-party computation (MPC) increased in several orders of magnitudes.  ...  Applications such as voting and some auctions are perfect use-case for these protocols, as the parties usually know well in advance when the computation will take place, and using those protocols allows  ...  Acknowledgements We want to thank Benjamin Fuller for informing us about a bug in S OffFull in a previous version of this work, and the anonymous reviewers for their helpful comments.  ... 
doi:10.1007/978-3-319-10879-7_11 fatcat:fc5e6a5sj5avdl24f2dwbkwvgu

Enhancement of security in cloud computing with secure multi-party computation

A Vijaya Kumar, N J.V.Vineetha, P Sai Chakradar, K Kalyan Sai
2017 International Journal of Engineering & Technology  
The N sets of parties which are allowed by unconditionally the secure multiparty computation (MPC) for computing securely with a registered function f with the help of unbounded adversary computational  ...  Here one can corrupt t among n parties maliciously corrupt. The Protocols of MPC which are known and efficient are developed for online or offline framework.  ...  Multi-party computation security with cloud computing motivation The Computation of Secure multiparty algorithms are useful for data of the user privacy & security at the time of computation also.  ... 
doi:10.14419/ijet.v7i1.1.9848 fatcat:2c65v5o3yzc35gfirotmrr4hhy

Post-Quantum Multi-Party Computation [article]

Amit Agarwal, James Bartusek, Vipul Goyal, Dakshita Khurana, Giulio Malavolta
2020 arXiv   pre-print
We initiate the study of multi-party computation for classical functionalities (in the plain model) with security against malicious polynomial-time quantum adversaries.  ...  We observe that existing techniques readily give a polynomial-round protocol, but our main result is a construction of *constant-round* post-quantum multi-party computation.  ...  HR001120C0024 (for AA and DK) and HR001120C0025 (for VG).  ... 
arXiv:2005.12904v2 fatcat:bugyasoajrcv5obab4cdpu54su

Publicly Accountable Robust Multi-Party Computation [article]

Marc Rivinius, Pascal Reisert, Daniel Rausch, Ralf Küsters
2022 IACR Cryptology ePrint Archive  
In recent years, lattice-based secure multi-party computation (MPC) has seen a rise in popularity and is used more and more in large scale applications like privacy-preserving cloud computing, electronic  ...  , and a malicious party should not be able to corrupt the computation, force a protocol restart, or block honest parties or an honest third-party (client) that provided private inputs from receiving a  ...  ACKNOWLEDGMENT We thank Andrés Bruhn and Azin Jahedi from the Institute for Visualization and Interactive Systems at the University of Stuttgart for providing the computational resources and assistance  ... 
dblp:journals/iacr/RiviniusRRK22 fatcat:ta42s5ne2ra63dmompc7fu7wqu

Secure Multi-party Shuffling [chapter]

Mahnush Movahedi, Jared Saia, Mahdi Zamani
2015 Lecture Notes in Computer Science  
In this paper, we propose an unconditionally-secure protocol for multi-party shuffling that scales well with the number of parties and is load-balanced.  ...  For example, for one million parties, when compared to the state of the art, our protocol reduces the communication and computation costs by at least three orders of magnitude and slightly decreases the  ...  Acknowledgment The authors would like to acknowledge supports from NSF under grants CCF-1320994, CCR-0313160, and CAREER Award 644058.  ... 
doi:10.1007/978-3-319-25258-2_32 fatcat:ger7t4s6h5avjnnbeefg7sfv3i

Secure Multi-Party Computation without Agreement

Shafi Goldwasser, Yehuda Lindell
2005 Journal of Cryptology  
Furthermore, this is achieved by just replacing the broadcast channel in known protocols with a very simple and efficient echo-broadcast protocol.  ...  That is, we show that secure multi-party computation for this definition can be achieved for any number of corrupted parties and without a broadcast channel (or trusted preprocessing phase as required  ...  Acknowledgements We would like to thank Oded Goldreich for many helpful discussions, and Juan Garay for pointing out the appropriate reference to [5] .  ... 
doi:10.1007/s00145-005-0319-z fatcat:i2narlrnsjahplxte6po2wo4by

Graceful Degradation in Multi-Party Computation (Extended Abstract) [chapter]

Martin Hirt, Christoph Lucas, Ueli Maurer, Dominik Raub
2011 Lecture Notes in Computer Science  
The goal of Multi-Party Computation (MPC) is to perform an arbitrary computation in a distributed, private, and fault-tolerant way.  ...  The first general solution was provided in [GMW87], where, based on computational intractability assumptions, security against a passive adversary was achieved for t < n corruptions, and security against  ...  threshold and general adversaries.  ... 
doi:10.1007/978-3-642-20728-0_15 fatcat:3owrpabzsbgatcfqjn4vmsuaza

Passive Corruption in Statistical Multi-Party Computation [chapter]

Martin Hirt, Christoph Lucas, Ueli Maurer, Dominik Raub
2012 Lecture Notes in Computer Science  
The goal of Multi-Party Computation (MPC) is to perform an arbitrary computation in a distributed, private, and fault-tolerant way.  ...  An actively corrupted party is completely controlled by the adversary, and may deviate arbitrarily from the protocol.  ...  This constitutes a substantial step towards general adversaries without losing efficiency in the number of parties. Fig. 1 . 1 The IC-Sign protocol.  ... 
doi:10.1007/978-3-642-32284-6_8 fatcat:dnde4mdbana7pgbyjcuh53lw5y

A Pragmatic Introduction to Secure Multi-Party Computation

David Evans, Vladimir Kolesnikov, Mike Rosulek
2018 Foundations and Trends® in Privacy and Security  
realistic to think about building practical systems using general-purpose multi-party computation.  ...  Lecture Notes in Computer Science.Springer, : 10.1007/978-3-642-34961-4_41. Aumann, Y. and Y. Lindell. 2007 . "Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries".  ... 
doi:10.1561/3300000019 fatcat:igylrqmmijeoviw772oaiudvki

Cryptographic Asynchronous Multi-party Computation with Optimal Resilience [chapter]

Martin Hirt, Jesper Buus Nielsen, Bartosz Przydatek
2005 Lecture Notes in Computer Science  
We consider secure multi-party computation in the asynchronous model and present an efficient protocol with optimal resilience.  ...  For n parties, up to t < n/3 of them being corrupted, and security parameter κ, a circuit with c gates can be securely computed with communication complexity O(cn 3 κ) bits.  ...  Introduction Secure multi-party computation.  ... 
doi:10.1007/11426639_19 fatcat:l2qcmqk4pfg7lb63jlr56isa2a
« Previous Showing results 1 — 15 out of 3,840 results