Movatterモバイル変換


[0]ホーム

URL:


Skip to main content
Cornell University
We gratefully acknowledge support from the Simons Foundation,member institutions, and all contributors.Donate
arxiv logo>cs> arXiv:2206.06650
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:2206.06650 (cs)
[Submitted on 14 Jun 2022 (v1), last revised 11 Apr 2023 (this version, v3)]

Title:Semi-Private Computation of Data Similarity with Applications to Data Valuation and Pricing

View PDF
Abstract:Consider two data providers that want to contribute data to a certain learning model. Recent works have shown that the value of the data of one of the providers is dependent on the similarity with the data owned by the other provider. It would thus be beneficial if the two providers can calculate the similarity of their data, while keeping the actual data private. In this work, we devise multiparty computation-protocols to compute similarity of two data sets based on correlation, while offering controllable privacy guarantees. We consider a simple model with two participating providers and develop methods to compute exact and approximate correlation, respectively, with controlled information leakage. Both protocols have computational and communication complexities that are linear in the number of data samples. We also provide general bounds on the maximal error in the approximation case, and analyse the resulting errors for practical parameter choices.
Comments:11 pages
Subjects:Information Theory (cs.IT); Cryptography and Security (cs.CR)
MSC classes:94A60, 68P27
Cite as:arXiv:2206.06650 [cs.IT]
 (orarXiv:2206.06650v3 [cs.IT] for this version)
 https://doi.org/10.48550/arXiv.2206.06650
arXiv-issued DOI via DataCite
Journal reference:IEEE Transactions on Information Forensics and Security (2023). Vol 18, pp. 1978-1988
Related DOI:https://doi.org/10.1109/TIFS.2023.3259879
DOI(s) linking to related resources

Submission history

From: René Bødker Christensen [view email]
[v1] Tue, 14 Jun 2022 07:32:02 UTC (127 KB)
[v2] Thu, 22 Sep 2022 07:06:56 UTC (131 KB)
[v3] Tue, 11 Apr 2023 07:00:43 UTC (135 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
Current browse context:
cs.IT
Change to browse by:
export BibTeX citation

Bookmark

BibSonomy logoReddit logo

Bibliographic and Citation Tools

Bibliographic Explorer(What is the Explorer?)
Connected Papers(What is Connected Papers?)
scite Smart Citations(What are Smart Citations?)

Code, Data and Media Associated with this Article

CatalyzeX Code Finder for Papers(What is CatalyzeX?)
Hugging Face(What is Huggingface?)
Papers with Code(What is Papers with Code?)

Demos

Hugging Face Spaces(What is Spaces?)

Recommenders and Search Tools

Influence Flower(What are Influence Flowers?)
CORE Recommender(What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community?Learn more about arXivLabs.

Which authors of this paper are endorsers? |Disable MathJax (What is MathJax?)

[8]ページ先頭

©2009-2025 Movatter.jp