privacy preserving
Recently Published Documents


TOTAL DOCUMENTS

9974
(FIVE YEARS 5766)

H-INDEX

98
(FIVE YEARS 50)

2022 ◽  
Vol 98 ◽  
pp. 107692
Author(s):  
Azeem Irshad ◽  
Shehzad Ashraf Chaudhry ◽  
Anwar Ghani ◽  
Ghulam Ali Mallah ◽  
Muhammad Bilal ◽  
...  

2022 ◽  
Vol 27 (2) ◽  
pp. 244-256
Author(s):  
Kainan Zhang ◽  
Zhi Tian ◽  
Zhipeng Cai ◽  
Daehee Seo

2022 ◽  
Vol 16 (4) ◽  
pp. 1-21
Author(s):  
Honghui Xu ◽  
Zhipeng Cai ◽  
Wei Li

Multi-label image recognition has been an indispensable fundamental component for many real computer vision applications. However, a severe threat of privacy leakage in multi-label image recognition has been overlooked by existing studies. To fill this gap, two privacy-preserving models, Privacy-Preserving Multi-label Graph Convolutional Networks (P2-ML-GCN) and Robust P2-ML-GCN (RP2-ML-GCN), are developed in this article, where differential privacy mechanism is implemented on the model’s outputs so as to defend black-box attack and avoid large aggregated noise simultaneously. In particular, a regularization term is exploited in the loss function of RP2-ML-GCN to increase the model prediction accuracy and robustness. After that, a proper differential privacy mechanism is designed with the intention of decreasing the bias of loss function in P2-ML-GCN and increasing prediction accuracy. Besides, we analyze that a bounded global sensitivity can mitigate excessive noise’s side effect and obtain a performance improvement for multi-label image recognition in our models. Theoretical proof shows that our two models can guarantee differential privacy for model’s outputs, weights and input features while preserving model robustness. Finally, comprehensive experiments are conducted to validate the advantages of our proposed models, including the implementation of differential privacy on model’s outputs, the incorporation of regularization term into loss function, and the adoption of bounded global sensitivity for multi-label image recognition.


2022 ◽  
Vol 13 (1) ◽  
pp. 1-17
Author(s):  
Gamal Elkoumy ◽  
Stephan A. Fahrenkrog-Petersen ◽  
Mohammadreza Fani Sani ◽  
Agnes Koschmider ◽  
Felix Mannhardt ◽  
...  

Privacy and confidentiality are very important prerequisites for applying process mining to comply with regulations and keep company secrets. This article provides a foundation for future research on privacy-preserving and confidential process mining techniques. Main threats are identified and related to a motivation application scenario in a hospital context as well as to the current body of work on privacy and confidentiality in process mining. A newly developed conceptual model structures the discussion that existing techniques leave room for improvement. This results in a number of important research challenges that should be addressed by future process mining research.


2022 ◽  
Vol 65 ◽  
pp. 103103
Author(s):  
Xiaohan Yue ◽  
Shuaishuai Zeng ◽  
Xibo Wang ◽  
Lixin Yang ◽  
Shi Bai ◽  
...  

2022 ◽  
Vol 127 ◽  
pp. 362-372
Author(s):  
Xiang Wu ◽  
Yongting Zhang ◽  
Minyu Shi ◽  
Pei Li ◽  
Ruirui Li ◽  
...  

2022 ◽  
Vol 22 (1) ◽  
Author(s):  
Sean Randall ◽  
Helen Wichmann ◽  
Adrian Brown ◽  
James Boyd ◽  
Tom Eitelhuber ◽  
...  

Abstract Background Privacy preserving record linkage (PPRL) methods using Bloom filters have shown promise for use in operational linkage settings. However real-world evaluations are required to confirm their suitability in practice. Methods An extract of records from the Western Australian (WA) Hospital Morbidity Data Collection 2011–2015 and WA Death Registrations 2011–2015 were encoded to Bloom filters, and then linked using privacy-preserving methods. Results were compared to a traditional, un-encoded linkage of the same datasets using the same blocking criteria to enable direct investigation of the comparison step. The encoded linkage was carried out in a blinded setting, where there was no access to un-encoded data or a ‘truth set’. Results The PPRL method using Bloom filters provided similar linkage quality to the traditional un-encoded linkage, with 99.3% of ‘groupings’ identical between privacy preserving and clear-text linkage. Conclusion The Bloom filter method appears suitable for use in situations where clear-text identifiers cannot be provided for linkage.


Sign in / Sign up

Export Citation Format

Share Document