Results 151 to 160 of about 938 (179)

Absentia: Secure Multiparty Computation on Ethereum

2021
This paper describes a blockchain-based approach for secure function evaluation (SFE) in the setting where multiple participants have private inputs (multiparty computation) that no other individual should learn. The emphasis of Absentia is reducing the participants’ work to a bare minimum, where they can effectively have the computation performed in ...
Didem Demirag, Jeremy Clark
openaire   +1 more source

Trust Enabled Secure Multiparty Computation

2010 14th International Conference Information Visualisation, 2010
Hamiltonian cycles play an important role in graph theory and data mining applications. Two Hamiltonian cycles that don’t have an edge in common are known as edge-disjoint Hamiltonian cycles (EDHCs). EDHCs are useful in computer networks. They have found applications in improving network capacity, fault-tolerance and collusion resistant mining ...
Renren Dong, Ray Kresman
openaire   +1 more source

Basic Constructions of Secure Multiparty Computation

2015
In this chapter, we formally define multiparty computation tasks and the security of protocols realizing them. We give a broad presentation of the existing constructions of secure multiparty computation (SMC) protocols and explain why they are correct and secure.
Laud, P., Pankova, A., Kamm, L., Veeningen, M.G.   +3 more
openaire   +1 more source

Coding for Private and Secure Multiparty Computing

2018 IEEE Information Theory Workshop (ITW), 2018
We consider the problem of secure and private multiparty computation (MPC), in which the goal is to compute a general polynomial function distributedly over several workers, while keeping them oblivious to the content of the dataset, and preventing them from maliciously affecting the computation result.
Yu, Qian, Raviv, Netanel, Avestimehr, A. Salman   +2 more
openaire   +2 more sources

Global-Scale Secure Multiparty Computation

Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017
We propose a new, constant-round protocol for multi-party computation of boolean circuits that is secure against an arbitrary number of malicious corruptions. At a high level, we extend and generalize recent work of Wang et al. in the two-party setting. Namely, we design an efficient preprocessing phase that allows the parties to generate authenticated
Xiao Wang 0012, Samuel Ranellucci, Jonathan Katz   +2 more
openaire   +1 more source

Knowledge-oriented secure multiparty computation

Proceedings of the 7th Workshop on Programming Languages and Analysis for Security, 2012
Protocols for secure multiparty computation (SMC) allow a set of mutually distrusting parties to compute a function f of their private inputs while revealing nothing about their inputs beyond what is implied by the result. Depending on f, however, the result itself may reveal more information than parties are comfortable with.
Piotr Mardziel, Michael Hicks 0001, Jonathan Katz, Mudhakar Srivatsa   +3 more
openaire   +1 more source

Assessment of Two Privacy Preserving Authentication Methods Using Secure Multiparty Computation Based on Secret Sharing

Symmetry, 2021
Kinga Marton, Alin Suciu
exaly  

Secure Multiparty Computation in arbitrary rings

2021 23rd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2021
openaire   +1 more source

Efficient Decision-Making Scheme Using Secure Multiparty Computation with Correctness Validation

Electronics (Switzerland), 2023
Zhusen Liu, Zhaoyang Han
exaly  

Secure computation of multiparty data

2021
KUMAR AMBUJ, KASHYAP ANAND, BANDI NEHAL
openaire   +2 more sources