Dataset Similarity Detection for Reuse Protection in Federated Data Spaces with Privacy Considerations
Source abstract
Abstract
Federated data spaces, established through initiatives such as IDSA and GAIA-X, enable organizations to share and monetize datasets under contractual terms. However, enforcing these contracts—particularly detecting unauthorized reuse or modification of datasets—remains an open challenge. We present the Off-Platform Contract Inspector, a component of the PISTIS framework, that implements a modular similarity-detection pipeline combining path-value Jaccard similarity, field-aware type-specific comparisons, and sentence-embedding-based semantic analysis across structured, semi-structured, and unstructured datasets. This contributes as follows: (i) an Inverse Document Frequency (IDF)-weighted structural similarity mechanism that discounts common domain vocabulary via Inverse Document Frequency weighting over the data space catalog, combined with a schema-evidence-gated fusion that reduces false positives from domain vocabulary overlap; (ii) an adaptive threshold optimization mechanism that learns modality-specific fusion weights and decision thresholds via cross-validated grid search; and (iii) a privacy-preserving similarity layer based on MinHash Locality-Sensitive Hashing signatures, Bloom filters with OR folding alignment, and Laplace noise for differential privacy, enabling cross-organizational dataset comparison without exposing raw data. Further, we contribute a threat taxonomy of seven dataset modification types ordered by detection difficulty, and evaluate the system on dataset pairs derived from real-world datasets across three smart-city application domains (Mobility, Energy, Automotive), with controlled augmentations applied to model adversarial behaviors. The IDF-weighted pipeline achieves high precision on intra-domain hard negatives—pairs of different tables from the same data space that share domain vocabulary—where text-similarity baselines produce false positives. The adaptive scheme learns per-modality fusion weights via cross-validated grid search. The privacy-preserving mode operates without accessing raw data and runs noticeably faster than the full pipeline, enabling screening while preserving data confidentiality.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Privacy-Preserving Technologies in Data · Data Quality and Management · Advanced Graph Neural Networks
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Industrial Systems Institute, Athena Research Center, PSP Building, Stadiou Str., Platani, 26504 Patras, Greece
Funding
European Commission
References (35)
Show source-provided references
1. European Commission (2022). Regulation
2. (EU) 2022/868 of the European Parliament and of the Council on European Data Governance (Data Governance Act). Off. J. Eur. Union, OJ L152, 1-44.
3. European Commission (2023). Regulation10.12968/S0306-3747(23)70110-3 ↗
4. (EU) 2023/2854 of the European Parliament and of the Council on Harmonised Rules on Fair Access to and Use of Data (Data Act). Off. J. Eur. Union, OJ L, 1-71.
5. Pettenpohl, H., Spiekermann, M., and Both, J.R. (2022). International data spaces in a nutshell. Designing Data Spaces: The Ecosystem Approach to Competitive Advantage, Springer.10.1007/978-3-030-93975-5_3 ↗
6. Otto, B., Steinbuß, S., Teuscher, A., and Lohmann, S. (2022). GAIA-X: Technical Architecture, GAIA-X European Association for Data and Cloud AISBL.
7. Curry, E., Scerri, S., and Tuikka, T. (2022). Data Spaces: Design, Deployment and Future Directions, Springer.10.1007/978-3-030-98636-0 ↗
8. Doukas, T., Hadjipavlis, G., Tsougiannis, E., Fokeas, K., Krikochoriti, M., Antonakopoulou, A., Sourlas, V., and Amditis, A. (2025). A Secure Approach on Data Trading: How the PISTIS Monetary Ledger Supports Digital Transactions. Proceedings of the 2025 6th International Conference in Electronic Engineering & Information Technology (EEITE), IEEE.10.1109/EEITE65381.2025.11166346 ↗
9. Blockchain challenges and opportunities: A survey10.1504/IJWGS.2018.095647 ↗
10. Blockchains and Smart Contracts for the Internet of Things10.1109/ACCESS.2016.2566339 ↗
11. PISTIS Project Consortium (2026, May 28). Pistis: Promoting and Incentivising Self-Sovereign Data Sharing Through Trust-Based Data Monetisation. Available online: https://cordis.europa.eu/project/id/101093016.
12. Panagiotou, C., and Stefanidis, K. (2024). Battling Data Counterfeiting in Industrial Data Trading Environments. Proceedings of the 2024 IEEE 29th International Conference on Emerging Technologies and Factory Automation (ETFA), IEEE.10.1109/ETFA61755.2024.10711059 ↗
13. Panagiotou, C., and Stefanidis, K. (2025). Detecting Dataset Reuse and Modification in Data Spaces via Structure-Aware Similarity Analysis. Proceedings of the 11th IEEE International Smart Cities Conference (ISC2), IEEE.10.1109/ISC266238.2025.11293312 ↗
14. MISP Project (2026, June 07). MISP 2.4.140 Released (OpenID Support, Cross Object References in Extended Events and Many Improvements). Available online: https://www.misp-project.org/2021/03/10/MISP.2.4.140.released.html.
15. Giel, A., Hupperz, M., Schoormann, T., and Möller, F. (2024, January 3–6). What does it take to connect? Unveiling characteristics of data space connectors. Proceedings of the 57th Annual Hawaii International Conference on System Sciences, Hawaii, HI, USA.
16. Broder, A.Z. (1997, January 11–13). On the resemblance and containment of documents. Proceedings of the Compression and Complexity of Sequences, Salerno, Italy.
17. Min-wise independent permutations10.1006/jcss.1999.1690 ↗
18. Manku, G.S., Jain, A., and Das Sarma, A. (2007, January 8–12). Detecting near-duplicates for web crawling. Proceedings of the 16th International Conference on World Wide Web, Banff, AB, Canada.10.1145/1242572.1242592 ↗
19. Henzinger, M. (2006, January 6–11). Finding near-duplicate web pages: A large-scale evaluation of algorithms. Proceedings of the 29th Annual International ACM SIGIR Conference, Seattle, WA, USA.10.1145/1148170.1148222 ↗
20. Charikar, M.S. (2002, January 19–21). Similarity estimation techniques from rounding algorithms. Proceedings of the 34th Annual ACM Symposium on Theory of Computing, Montreal, QC, Canada.10.1145/509907.509965 ↗
21. Reimers, N., and Gurevych, I. (2019, January 3–7). Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks. Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing (EMNLP), Hong Kong, China.10.18653/v1/D19-1410 ↗
22. Wang, L., Yang, N., Huang, X., Jiao, B., Yang, L., Jiang, D., Majumder, R., and Wei, F. (2022). Text Embeddings by Weakly-Supervised Contrastive Pre-training. arXiv.
23. Billion-scale similarity search with GPUs10.1109/TBDATA.2019.2921572 ↗
24. Buneman, P., Khanna, S., and Tan, W.C. (2001). Why and where: A characterization of data provenance. Proceedings of the 8th International Conference on Database Theory (ICDT), Springer.10.1007/3-540-44503-X_20 ↗
25. A survey on provenance: What for? What form? What from?10.1007/s00778-017-0486-1 ↗
26. A Survey on Homomorphic Encryption Schemes: Theory and Implementation
27. Lindell, Y. (2017). How to Simulate It—A Tutorial on the Simulation Proof Technique. Tutorials on the Foundations of Cryptography, Springer.10.1007/978-3-319-57048-8_6 ↗
28. Pinkas, B., Schneider, T., Weinert, C., and Wieder, U. (2018). Efficient Circuit-Based PSI via Cuckoo Hashing. Proceedings of the Advances in Cryptology—EUROCRYPT 2018, Springer.10.1007/978-3-319-78372-7_5 ↗
29. Indyk, P., and Motwani, R. (1998, January 24–26). Approximate nearest neighbors: Towards removing the curse of dimensionality. Proceedings of the 30th Annual ACM Symposium on Theory of Computing, Dallas, TX, USA.10.1145/276698.276876 ↗
30. Datar, M., Immorlica, N., Indyk, P., and Mirrokni, V.S. (2004, January 8–11). Locality-sensitive hashing scheme based on p-stable distributions. Proceedings of the 20th Annual Symposium on Computational Geometry, Brooklyn, NY, USA.10.1145/997817.997857 ↗
31. Space/time trade-offs in hash coding with allowable errors10.1145/362686.362692 ↗
32. The Algorithmic Foundations of Differential Privacy10.1561/0400000042 ↗
33. Binary codes capable of correcting deletions, insertions, and reversals
34. Probable inference, the law of succession, and statistical inference10.1080/01621459.1927.10502953 ↗
35. Chicco, D., and Jurman, G. (2020). The advantages of the Matthews correlation coefficient (MCC) over F1 score and accuracy in binary classification evaluation. BMC Genom., 21.10.1186/s12864-019-6413-7 ↗