NDLI: Secure Multi-Party Computation without Agreement

Please wait, while we are loading the content...

Secure Multi-Party Computation without Agreement

Content Provider	Springer Nature Link
Author	Goldwasser, Shafi Lindell, Yehuda
Copyright Year	2005
Abstract	It has recently been shown that authenticated Byzantine agreement, in which more than a third of the parties are corrupted, cannot be securely realized under concurrent or parallel (stateless) composition. This result puts into question any usage of authenticated Byzantine agreement in a setting where many executions take place. In particular, this is true for the whole body of work of secure multi-party protocols in the case that a third or more of the parties are corrupted. This is because these protocols strongly rely on the extensive use of a broadcast channel, which is in turn realized using authenticated Byzantine agreement. We remark that it was accepted folklore that the use of a broadcast channel (or authenticated Byzantine agreement) is actually essential for achieving meaningful secure multi-party computation whenever a third or more of the parties are corrupted. In this paper we show that this folklore is false. We present a mild relaxation of the definition of secure computation allowing abort. Our new definition captures all the central security issues of secure computation, including privacy, correctness and independence of inputs. However, the novelty of the definition is in decoupling the issue of agreement from these issues. We then show that this relaxation suffices for achieving secure computation in a point-to-point network. 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 pre-processing phase as required for running authenticated Byzantine agreement). Furthermore, this is achieved by just replacing the broadcast channel in known protocols with a very simple and efficient echo-broadcast protocol. An important corollary of our result is the ability to obtain multi-party protocols that remain secure under composition, without assuming a broadcast channel.
Starting Page	247
Ending Page	287
Page Count	41
File Format	PDF
ISSN	09332790
Journal	Journal of Cryptology
Volume Number	18
Issue Number	3
e-ISSN	14321378
Language	English
Publisher	Springer-Verlag
Publisher Date	2005-05-20
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Coding and Information Theory Computational Mathematics and Numerical Analysis Combinatorics Probability Theory and Stochastic Processes Communications Engineering, Networks
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Computer Science Applications Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Partial Fairness in Secure Two-Party Computation

Completeness in Two-Party Secure Computation: A Computational View

Efficient One-Sided Adaptively Secure Computation

Minimal Complete Primitives for Secure Multi-Party Computation

Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer

Almost-Everywhere Secure Computation with Edge Corruptions

Secure Computation of the Median (and Other Elements of Specified Ranks)

Toward a Game Theoretic View of Secure Computation

On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions

Secure Multi-Party Computation without Agreement

Similar Documents

Partial Fairness in Secure Two-Party Computation

Completeness in Two-Party Secure Computation: A Computational View

Efficient One-Sided Adaptively Secure Computation

Minimal Complete Primitives for Secure Multi-Party Computation

Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer

Almost-Everywhere Secure Computation with Edge Corruptions

Secure Computation of the Median (and Other Elements of Specified Ranks)

Toward a Game Theoretic View of Secure Computation

On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions

Secure Multi-Party Computation without Agreement