NDLI: General Composition and Universal Composability in Secure Multiparty Computation

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

General Composition and Universal Composability in Secure Multiparty Computation

Content Provider	Springer Nature Link
Author	Lindell, Yehuda
Copyright Year	2008
Abstract	Concurrent general composition relates to a setting where a secure protocol is run in a network concurrently with other, arbitrary protocols. Clearly, security in such a setting is what is desired, or even needed, in modern computer networks where many different protocols are executed concurrently. Canetti (FOCS 2001) introduced the notion of universal composability and showed that security under this definition is sufficient for achieving concurrent general composition. However, it is not known whether or not the opposite direction also holds.Our main result is a proof that security under concurrent general composition, when interpreted in the natural way under the simulation paradigm, is equivalent to a variant of universal composability, where the only difference relates to the order of quantifiers in the definition. (In newer versions of universal composability, these variants are equivalent.) An important corollary of this theorem is that existing impossibility results for universal composability (for all its variants) are inherent for definitions that imply security under concurrent general composition, as formulated here. In particular, there are large classes of two-party functionalities for which it is impossible to obtain protocols (in the plain model) that remain secure under concurrent general composition. We stress that the impossibility results obtained are not “black-box,” and apply even to non-black-box simulation.Our main result also demonstrates that the definition of universal composability is somewhat “minimal” in that the composition guarantee provided by universal composability implies the definition itself. This indicates that the security definition of universal composability is not overly restrictive.
Starting Page	395
Ending Page	428
Page Count	34
File Format	PDF
ISSN	09332790
Journal	Journal of Cryptology
Volume Number	22
Issue Number	3
e-ISSN	14321378
Language	English
Publisher	Springer-Verlag
Publisher Date	2008-03-29
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Secure computation Concurrent general composition Universal composability Communications Engineering, Networks Probability Theory and Stochastic Processes Combinatorics Computational Mathematics and Numerical Analysis Coding and Information Theory
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

GNUC: A New Universal Composability Framework

Secure Computation Without Authentication

Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs

Polynomial Runtime and Composability

Resource Fairness and Composability of Cryptographic Protocols

On d-Multiplicative Secret Sharing

Long-Term Security and Universal Composability

Concurrent Composition of Secure Protocols in the Timing Model

A Full Proof of the BGW Protocol for Perfectly Secure Multiparty Computation

General Composition and Universal Composability in Secure Multiparty Computation

Similar Documents

GNUC: A New Universal Composability Framework

Secure Computation Without Authentication

Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs

Polynomial Runtime and Composability

Resource Fairness and Composability of Cryptographic Protocols

On d-Multiplicative Secret Sharing

Long-Term Security and Universal Composability

Concurrent Composition of Secure Protocols in the Timing Model

A Full Proof of the BGW Protocol for Perfectly Secure Multiparty Computation

General Composition and Universal Composability in Secure Multiparty Computation