Privacy-Preserving Cooperative Linear System of Equations Protocol and its Application

Yang, Xuan; Yu, Zhaoping; Kong, Bin

doi:10.1109/wicom.2008.1131

Cited by 1 publication

(3 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Existing literature shows that given a solution to PPC-LSE one can easily construct a solution to PPC-LLS. Another application of PPC-LSE is in privacypreserving polynomial interpolation (PPPI), see e.g., [7,19,20,35]. In PPPI, each party holds a point (x i , y i ) and wants to find the unique polynomial interpolating all points.…”

Section: This Workmentioning

confidence: 99%

“…All previously known solutions for PPC-LSE deal only with the two-party case [14,32,34,35], and it is unknown whether those protocols can be easily and efficiently upgraded to the multiparty scenario. The only exception is the work by Kang and Hong [25] who proposed a protocol for PPC-LSE in the multi-party case.…”

Section: Related Workmentioning

confidence: 99%

“…We compare the efficiency of our protocol with previous solutions for PPC-LSE. Given the twoparty protocols of [14,32,34,35], one can obtain a scheme for the case of parties by running the underlying two-party solution 2 times; this approach results in a high communication complexity due to the high number of OT executions. A related work [25] addresses PPC-LSE in the multiparty setting in the so-called "commodity-server model".…”

Section: Efficiency Considerationsmentioning

confidence: 99%

See 2 more Smart Citations

A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations

Dagdelen

Venturi

2015

Cryptography and Information Security in the Balkans

View full text Add to dashboard Cite

The privacy-preserving cooperative linear system of equations (PPC-LSE) problem is an important scientific problem whose solutions find applications in many real-word scenarios, such as banking, manufacturing, and telecommunications. Roughly speaking, in PPC-LSE a set of parties want to jointly compute the solution to a linear system of equations without disclosing their own inputs. The linear system is built through the parties' inputs.In this paper we design a novel protocol for PPC-LSE. Our protocol has simulation-based security in the semi-honest model, assuming that one of the participants is not willing to collude with other parties. Previously to our work, the only known solutions to PPC-LSE were for the two-party case, and the only known other protocol for the multi-party case was less efficient and proven secure in a weaker model.

show abstract

Section: This Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%