Coordination Approach to Mitigate Composition Attack

被引:0
|
作者
Wahida, Farah [1 ]
Sattar, A. H. M. Sarowar [1 ]
Hossain, Md Muktar [1 ]
机构
[1] Rajshahi Univ Engn & Technol, Dept Comp Sci & Engn, Rajshahi, Bangladesh
来源
2020 23RD INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY (ICCIT 2020) | 2020年
关键词
Privacy; Composition Attack; Coordination; Anonymization; PRIVACY;
D O I
10.1109/ICCIT51783.2020.9392661
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Data anonymization is one of the primary techniques, which is used in privacy preserving data publishing. Numerous methods have been proposed to anonymize data sets, that are used by different organizations to publish their data sets independently. However, in actuality, a data set is infrequently isolated, and data sets published by multiple organizations may obtain a record of the same person. An individually published data set may have a small privacy risk. However, the combination of two published data sets may breach individuals' privacy, who are common in both data sets by composition attack. A few researches have been carried out to prevent it without considering coordination among multiple organizations before data publishing. Though coordination is an excellent way to avoid such problems, organizations do not want to share their customer data sets with others. In this work, we introduce a coordination method where complete data sharing is not necessary. This will effectively overcome privacy concerns. It has been shown experimentally that the proposed technique anonymizes data set to satisfy the privacy requirement and preserves high data utility.
引用
收藏
页数:6
相关论文
共 50 条
  • [21] Smart Detection: An Online Approach for DoS/DDoS Attack Detection Using Machine Learning
    de Lima Filho, Francisco Sales
    Silveira, Frederico A. F.
    Brito Junior, Agostinho de Medeiros
    Vargas-Solar, Genoveva
    Silveira, Luiz F.
    SECURITY AND COMMUNICATION NETWORKS, 2019, 2019
  • [22] An RFID Search Protocol Secured Against Relay Attack Based on Distance Bounding Approach
    Jannati, Hoda
    Falahati, Abolfazl
    WIRELESS PERSONAL COMMUNICATIONS, 2015, 85 (03) : 711 - 726
  • [23] Investigating the Constrained Action Hypothesis: A Movement Coordination and Coordination Variability Approach
    Vidal, Anthony
    Wu, Will
    Nakajima, Mimi
    Becker, James
    JOURNAL OF MOTOR BEHAVIOR, 2018, 50 (05) : 528 - 537
  • [24] Real-Time DDoS Attack Detection System Using Big Data Approach
    Awan, Mazhar Javed
    Farooq, Umar
    Babar, Hafiz Muhammad Aqeel
    Yasin, Awais
    Nobanee, Haitham
    Hussain, Muzammil
    Hakeem, Owais
    Zain, Azlan Mohd
    SUSTAINABILITY, 2021, 13 (19)
  • [25] Dynamic Composition of Web Service Based on Coordination Model
    Shen, Limin
    Li, Feng
    Ren, Shangping
    Mu, Yunfeng
    ADVANCES IN WEB AND NETWORK TECHNOLOGIES, AND INFORMATION MANAGEMENT, PROCEEDINGS, 2007, 4537 : 317 - +
  • [26] A contingency approach to software project coordination
    Andres, HP
    Zmud, RW
    JOURNAL OF MANAGEMENT INFORMATION SYSTEMS, 2001, 18 (03) : 41 - 70
  • [27] A dynamical systems approach to movement coordination
    Van Den Berg, C
    NETHERLANDS JOURNAL OF ZOOLOGY, 2000, 50 (02): : 163 - 178
  • [28] MIA-BAD: An Approach for Enhancing Membership Inference Attack and its Mitigation with Federated Learning
    Banerjee, Soumya
    Roy, Sandip
    Ahamed, Sayyed Farid
    Quinn, Devin
    Vucovich, Marc
    Nandakumar, Dhruv
    Choi, Kevin
    Rahman, Abdul
    Bowen, Edward
    Shetty, Sachin
    2024 INTERNATIONAL CONFERENCE ON COMPUTING, NETWORKING AND COMMUNICATIONS, ICNC, 2024, : 635 - 640
  • [29] Redesigning Work With a Lightweight Approach to Coordination Technology
    Halvorsen, Marit R.
    Austad, Hanne O.
    Landmark, Andreas D.
    Ausen, Dag
    Svagard, Ingrid
    Tomasevic, Tanja
    Trondsen, Trond
    CIN-COMPUTERS INFORMATICS NURSING, 2019, 37 (03) : 124 - 132
  • [30] Expectations coordination on a sunspot equilibrium: An eductive approach
    Desgranges, G
    Negroni, G
    MACROECONOMIC DYNAMICS, 2003, 7 (01) : 7 - 41