Privacy-preserving formal concept analysis: A homomorphic encryption-based concept construction
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915640484298752 |
|---|---|
| author | Chen, Qiangqiang Ke, Yunfeng Li, Shen Li, Jinhai |
| author_facet | Chen, Qiangqiang Ke, Yunfeng Li, Shen Li, Jinhai |
| contents | Formal Concept Analysis (FCA) is extensively used in knowledge extraction, cognitive concept learning, and data mining. However, its computational demands on large-scale datasets often require outsourcing to external computing services, raising concerns about the leakage of sensitive information. To address this challenge, we propose a novel approach to enhance data security and privacy in FCA-based computations. Specifically, we introduce a Privacy-preserving Formal Context Analysis (PFCA) framework that combines binary data representation with homomorphic encryption techniques. This method enables secure and efficient concept construction without revealing private data. Experimental results and security analysis confirm the effectiveness of our approach in preserving privacy while maintaining computational performance. These findings have important implications for privacy-preserving data mining and secure knowledge discovery in large-scale FCA applications. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_22117 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Privacy-preserving formal concept analysis: A homomorphic encryption-based concept construction Chen, Qiangqiang Ke, Yunfeng Li, Shen Li, Jinhai Cryptography and Security Computational Complexity Formal Concept Analysis (FCA) is extensively used in knowledge extraction, cognitive concept learning, and data mining. However, its computational demands on large-scale datasets often require outsourcing to external computing services, raising concerns about the leakage of sensitive information. To address this challenge, we propose a novel approach to enhance data security and privacy in FCA-based computations. Specifically, we introduce a Privacy-preserving Formal Context Analysis (PFCA) framework that combines binary data representation with homomorphic encryption techniques. This method enables secure and efficient concept construction without revealing private data. Experimental results and security analysis confirm the effectiveness of our approach in preserving privacy while maintaining computational performance. These findings have important implications for privacy-preserving data mining and secure knowledge discovery in large-scale FCA applications. |
| title | Privacy-preserving formal concept analysis: A homomorphic encryption-based concept construction |
| topic | Cryptography and Security Computational Complexity |
| url | https://arxiv.org/abs/2511.22117 |