NDLI: Secure Distributed Multiplication of Two Polynomially Shared Values: Enhancing the Efficiency of the Protocol

Content Provider	IEEE Xplore Digital Library
Author	Lory, P.
Copyright Year	2009
Abstract	In view of practical applications, it is a high priority to optimize the efficiency of methods for secure multiparty computations. These techniques enable, for instance, truly practical double auctions and distributed signatures. The multiplication protocol for the secure multiparty multiplication of two polynomially shared values over Z_q with a public prime number q is an important module in these computations. The protocol of Gennaro, Rabin and Rabin (1998) is a well known and efficient protocol for this purpose. It requires one round of communication and O(n^2 k \log n + n k^2) bit-operations per player, where k is the bit size of the prime q and n is the number of players. In a previous paper (2007), the author has presented a modification of this protocol, that reduces its complexity to O(n^2k + nk^2). The present paper reduces this complexity further to O(n^2 k). This reduction is profitable in situations where n is smaller than k. The new protocol requires the same amount of communication as the original one and is unconditionally secure, as well.
Starting Page	286
Ending Page	291
File Size	233487
Page Count	6
File Format	PDF
ISBN	9780769536682
DOI	10.1109/SECURWARE.2009.51
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-06-18
Publisher Place	Greece
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Optimization methods Multiparty computations multiplication protocol Distributed computing Lagrangian functions divided differences Cryptographic protocols Interpolation Information security Polynomials Acceleration Cryptography secret sharing
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

Reducing the Complexity in the Distributed Multiplication Protocol of Two Polynomially Shared Values

The deterministic protocol for rational secret sharing

Unconditionally secure multi-secret sharing scheme

Multiparty Computation of Fixed-Point Multiplication and Reciprocal

Simplified VSS and Fast-track Multiparty Computations with Applications to Threshold Cryptography (1998)

Protocols for Getting Maximum Value for Multi-Party Computations

Simplified VSS and Fast-track Multiparty Computations with Applications to Threshold Cryptography (1998)

An entropy-based demonstration of the security of Shamir's secret sharing scheme

Enhancing the efficiency of (v, r, n)-fairness secret sharing scheme

Secure Distributed Multiplication of Two Polynomially Shared Values: Enhancing the Efficiency of the Protocol

Similar Documents

Reducing the Complexity in the Distributed Multiplication Protocol of Two Polynomially Shared Values

The deterministic protocol for rational secret sharing

Unconditionally secure multi-secret sharing scheme

Multiparty Computation of Fixed-Point Multiplication and Reciprocal

Simplified VSS and Fast-track Multiparty Computations with Applications to Threshold Cryptography (1998)

Protocols for Getting Maximum Value for Multi-Party Computations

Simplified VSS and Fast-track Multiparty Computations with Applications to Threshold Cryptography (1998)

An entropy-based demonstration of the security of Shamir's secret sharing scheme

Enhancing the efficiency of (v, r, n)-fairness secret sharing scheme

Secure Distributed Multiplication of Two Polynomially Shared Values: Enhancing the Efficiency of the Protocol