Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
2011
Abstract We initiate the study of secure multi-party computation (MPC) in a server-aided setting, where the parties have access to a single server that (1) does not have any input to the computation;(2) does not receive any output from the computation; but (3) has a vast (but bounded) amount of computational resources. In this setting, we are concerned with designing protocols that minimize the computation of the parties at the expense of the server.
2021 •
MPC (multi-party computation) is a comprehensive cryptographic concept that can be used to do computations while maintaining anonymity. MPC allows a group of people to work together on a function without revealing the plaintext's true input or output. Privacy-preserving voting, arithmetic calculation, and large-scale data processing are just a few of the applications of MPC. Each MPC party can run on a single computing node from a system perspective. Multiple parties' computing nodes could be homogenous or heterogeneous; nevertheless, MPC protocols' distributed workloads are always homogeneous (symmetric). We investigate the system performance of a representative MPC framework and a collection of MPC applications in this paper. On homogeneous and heterogeneous compute nodes, we describe the complete online calculation workflow of a state-of-the-art MPC protocol and examine the fundamental cause of its stall time and performance limitation.
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. This negative result holds regardless of the total number of parties, even if broadcast is allowed in each round, and even if only fairness is required. We complement this negative result by presenting matching positive results. Our first main result is that if only one party may be corrupted, then n ≥ 5 parties can securely compute any function of their inputs using only two rounds of interaction over secure point-to-point channels (without broadcast or any additional setup). The protocol makes a black-box use of a pseudorandom generator, or alternatively can offer unconditional security for functionalities in NC1. We also prove a similar result in a client-server setting, where there are m ≥ 2 clients who hold inputs and should receive outputs, and n additional servers with no inputs and outputs. For this setting, we obtain a general MPC protocol which requires a single message from each client to each server, followed by a single message from each server to each client. The protocol is secure against a single corrupted client and against coalitions of t < n/3 corrupted servers. The above protocols guarantee output delivery and fairness. Our second main result shows that under a relaxed notion of security, allowing the adversary to selectively decide (after learning its own outputs) which honest parties will receive their (correct) output, there is a general 2-round MPC protocol which tolerates t < n/3 corrupted parties. This protocol relies on the existence of a pseudorandom generator in NC1 (which is implied by standard cryptographic assumptions), or alternatively can offer unconditional security for functionalities in NC1.
Abstract We present a general-purpose protocol that enables a client to delegate the computation of any function to a cluster of n machines in such a way that no adversary that corrupts at most n− 1 machines can recover any information about the client's input or output. The protocol makes black-box use of multi-party computation (MPC) and secret sharing and inherits the security properties of the underlying MPC protocol (ie, passive vs. adaptive security and security in the presence of a semi-honest vs. malicious adversary).
2009 •
International Journal of Information Security
Efficient and verifiable algorithms for secure outsourcing of cryptographic computations2015 •
KSII Transactions on Internet and Information Systems
Semi-trusted Collaborative Framework for Multi-party Computation2010 •
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security
Fast Actively Secure Five-Party Computation with Security Beyond Abort2019 •
στο: Α. Μαζαράκης-Αινιάν (επιμ.), Αρχαιολογικό Έργο Θεσσαλίας και Στερεάς Ελλάδας 6, 2018, Πρακτικά επιστημονικής συνάντησης Βόλος 1-4.3.2018, Τόμος Ι: Θεσσαλία, Βόλος, 2022, 451-462.
Καραγιαννόπουλος X., Παλαιοθόδωρος Δ., 2022, Φάσεις κατοίκησης του οικισμού αρχαϊκών και κλασικών χρόνων στη Φίλια Καρδίτσας. Η μελέτη της στρωματογραφίας και της σκευής των οικιών 1 και 22018 •
Il tarlo dello storico. Studi di allievi e amici per Gabriella Piccinni, Arcidosso (Gr)
Mobilità sociale e beni comuni nei micro-villaggi tardomedievali: il caso di Montonero2021 •
Fiatal Műszakiak Tudományos Ülésszaka
Internetes lehetősegek szerszámfolyam tervezéséhez2002 •
Bab15 testing dan implementasi2024
Bab15 testing dan implementasi20242024 •
2022 •
1991 •
Scuola e Ricerca
IL DRAMMA STORICO OTTOCENTESCO NEL MERIDIONE D’ITALIA: IL CASO DI GIUSEPPE NICOLA D’AGNILLO2018 •
Diagnostic and Interventional Imaging
Feasibility of two-dimensional ultrasound shear wave elastography of human fetal lungs and liver: A pilot study2019 •
Frontiers in Endocrinology
Cryopreserved Rat Thyroid Autotransplantation in the Treatment of Postoperative HypothyroidismNephrologie & Therapeutique
IRA après méthotrexate à haute dose : incidence, facteurs prédictifs et place de la glucarpidase2019 •
Powder Diffraction
An investigation on the microstructure and defects in the mechanically milled Cu and Fe powders2014 •
Gestão & Regionalidade
Relação entre intangibilidade, desempenho econômico e social das empresas listadas na BM&Fbovespa2016 •
Ultrasound in Obstetrics & Gynecology
P25.13: First-trimester sonographic diagnosis of holoprosencephaly2008 •