Details

Autor(en) / Beteiligte

• Chiang, Yi-Ting
• Wang, Da-Wei
• Liau, Churn-Jung
• Hsu, Tsan-sheng
• Jajodia, Sushil
• Wijesekera, Duminda

Titel

Secrecy of Two-Party Secure Computation

Ist Teil von

• Data and Applications Security XIX, 2005, p.114-123

Ort / Verlag

Berlin, Heidelberg: Springer Berlin Heidelberg

Erscheinungsjahr

2005

Quelle

Alma/SFX Local Collection

Beschreibungen/Notizen

• Privacy protection has become one of the most important issues in the information era. Thus, many protocols have been developed to achieve the goal of cooperatively accomplishing a computational task without revealing the participants’ private data. Practical protocols, however, do not guarantee perfect privacy protection, as some degree of privacy leakage is allowed during the computation process for the sake of efficient resource consumption, e.g., the number of random bits required and the computation time. Although there are metrics for measuring the amount of resource consumption, as far as we know, there are no effective metrics that measure the degree of privacy leakage. Without such metrics, however, it is difficult to compare protocols fairly. In this paper, we propose a framework based on linear algebra and information theory to measure the amount of privacy leakage in protocols. This framework can be used to analyze protocols that satisfy certain algebraic properties. We use it to analyze three two-party scalar product protocols. The framework might also be extendable to the analysis of other protocols.