- 标题
- 摘要
- 关键词
- 实验方案
- 产品
-
[IEEE 2019 IEEE 46th Photovoltaic Specialists Conference (PVSC) - Chicago, IL, USA (2019.6.16-2019.6.21)] 2019 IEEE 46th Photovoltaic Specialists Conference (PVSC) - Electron and hole partial specific resistances: a framework to understand contacts to solar cells
摘要： Several approaches have been proposed to anonymize relational databases using the criterion of k-anonymity, to avoid the disclosure of sensitive information by re-identification attacks. A relational database is said to meet the criterion of k-anonymity if each record is identical to at least (k ? 1) other records in terms of quasi-identifier attribute values. To anonymize a transactional database and satisfy the constraint of k-anonymity, each item must successively be considered as a quasi-identifier attribute. But this process greatly increases dimensionality, and thus also the computational complexity of anonymization, and information loss. In this paper, a novel efficient anonymization system called PTA is proposed to not only anonymize transactional data with a small information loss but also to reduce the computational complexity of the anonymization process. The PTA system consists of three modules, which are the Pre-processing module, the TSP module, and the Anonymity model, to anonymize transactional data and guarantees that at least k-anonymity is achieved: a pre-processing module, a traveling salesman problem module, and an anonymization module. Extensive experiments have been carried to compare the efficiency of the designed approach with the state-of-the-art anonymization algorithms in terms of scalability, runtime, and information loss. Results indicate that the proposed PTA system outperforms the compared algorithms in all respects.
关键词： Anonymity,privacy preserving data mining,TSP,divide-and-conquer,Gray sort
更新于2025-09-23 15:19:57
-
[IEEE 2019 IEEE 46th Photovoltaic Specialists Conference (PVSC) - Chicago, IL, USA (2019.6.16-2019.6.21)] 2019 IEEE 46th Photovoltaic Specialists Conference (PVSC) - Predicting Open-Circuit Voltages in Atomically-Thin Monolayer Transition Metal Dichalcogenides-Based Solar Cells
摘要： District-wide real-time information sharing provides new opportunities to optimize infrastructures and, for example, the energy consumption of smart cities. However, information collection introduces new privacy threats that must be addressed. Existing anonymization solutions are not sufficient for the brokering of streaming real-time measurements. Advanced adversaries may utilize information available from different sources and correlation analyses to reveal a measurement’s actual source. We analyze security and privacy requirements and design a privacy-enhancing architecture for an information brokering platform. We propose an adaptive pseudonymization framework to make privacy attacks harder and to gain real-time awareness of the robustness of the privacy protection of platforms. Finally, we present an initial evaluation of the proposal using real-world energy consumption measurements.
关键词： authentication,privacy,real-time,smart city,Access control,anonymity,security,information sharing
更新于2025-09-23 15:19:57
-
[IEEE 2019 21st International Conference on Transparent Optical Networks (ICTON) - Angers, France (2019.7.9-2019.7.13)] 2019 21st International Conference on Transparent Optical Networks (ICTON) - Compact and Tunable Room Temperature THz Source from Quantum Dot Based Ultrafast Photoconductive Antennae
摘要： Several approaches have been proposed to anonymize relational databases using the criterion of k-anonymity, to avoid the disclosure of sensitive information by re-identification attacks. A relational database is said to meet the criterion of k-anonymity if each record is identical to at least (k ? 1) other records in terms of quasi-identifier attribute values. To anonymize a transactional database and satisfy the constraint of k-anonymity, each item must successively be considered as a quasi-identifier attribute. But this process greatly increases dimensionality, and thus also the computational complexity of anonymization, and information loss. In this paper, a novel efficient anonymization system called PTA is proposed to not only anonymize transactional data with a small information loss but also to reduce the computational complexity of the anonymization process. The PTA system consists of three modules, which are the Pre-processing module, the TSP module, and the Anonymity model, to anonymize transactional data and guarantees that at least k-anonymity is achieved: a pre-processing module, a traveling salesman problem module, and an anonymization module. Extensive experiments have been carried to compare the efficiency of the designed approach with the state-of-the-art anonymization algorithms in terms of scalability, runtime, and information loss. Results indicate that the proposed PTA system outperforms the compared algorithms in all respects.
关键词： Anonymity,privacy preserving data mining,TSP,divide-and-conquer,Gray sort
更新于2025-09-23 15:19:57