NDLI: Black-Box, Round-Efficient Secure Computation via Non-malleability Amplification

Content Provider	IEEE Xplore Digital Library
Author	Wee, H.
Copyright Year	2010
Abstract	We present round-efficient protocols for secure multi-party computation with a dishonest majority that rely on black-box access to the underlying primitives. Our main contributions are as follows: * a O(log^∗ n)-round protocol that relies on black-box access to dense cryptosystems, homomorphic encryption schemes, or lossy encryption schemes. This improves upon the recent O(1)^{log∗ n} -round protocol of Lin, Pass and Venkitasubramaniam (STOC 2009) that relies on non-black-box access to a smaller class of primitives. * a O(1)-round protocol requiring in addition, black-box access to a one-way function with sub-exponential hardness, improving upon the recent work of Pass and Wee (Euro crypt 2010). These are the first black-box constructions for secure computation with sub linear round complexity. Our constructions build on and improve upon the work of Lin and Pass (STOC 2009) on non-malleability amplification, as well as that of Ishai et al. (STOC 2006) on black-box secure computation. In addition to the results on secure computation, we also obtain a simple construction of a O(log^∗ n)-round non-malleable commitment scheme based on one-way functions, improving upon the recent O(1)^{log∗ n}-round protocol of Lin and Pass (STOC 2009). Our construction uses a novel transformation for handling arbitrary man-in-the-middle scheduling strategies which improves upon a previous construction of Barak (FOCS 2002).
Starting Page	531
Ending Page	540
File Size	519282
Page Count	10
File Format	PDF
ISBN	9781424485253
ISSN	02725428
DOI	10.1109/FOCS.2010.87
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-10-23
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Protocols Complexity theory Receivers Additives Robustness Encryption non-malleable commitments secure multi-party computation round complexity black-box constructions
Content Type	Text
Resource Type	Article

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

Constructing Non-malleable Commitments: A Black-Box Approach

New and improved constructions of non-malleable cryptographic protocols

Constant round non-malleable protocols using one way functions

Constant-round non-malleable commitments from any one-way function

On the Round Complexity of Covert Computation

Constant-round non-malleable commitments from any one-way function (2011)

Black-Box Constructions of Protocols for Secure Computation

Constant-Round Non-Malleable Commitments from Any One-Way Function (2011)

Constant-round non-malleable commitments from any one-way function (2011)

Black-Box, Round-Efficient Secure Computation via Non-malleability Amplification

Similar Documents

Constructing Non-malleable Commitments: A Black-Box Approach

New and improved constructions of non-malleable cryptographic protocols

Constant round non-malleable protocols using one way functions

Constant-round non-malleable commitments from any one-way function

On the Round Complexity of Covert Computation

Constant-round non-malleable commitments from any one-way function (2011)

Black-Box Constructions of Protocols for Secure Computation

Constant-Round Non-Malleable Commitments from Any One-Way Function (2011)

Constant-round non-malleable commitments from any one-way function (2011)

Black-Box, Round-Efficient Secure Computation via Non-malleability Amplification