• Title/Summary/Keyword: Attribute disclosure

Search Result 8, Processing Time 0.021 seconds

Limiting Attribute Disclosure in Randomization Based Microdata Release

  • Guo, Ling;Ying, Xiaowei;Wu, Xintao
    • Journal of Computing Science and Engineering
    • /
    • v.5 no.3
    • /
    • pp.169-182
    • /
    • 2011
  • Privacy preserving microdata publication has received wide attention. In this paper, we investigate the randomization approach and focus on attribute disclosure under linking attacks. We give efficient solutions to determine optimal distortion parameters, such that we can maximize utility preservation while still satisfying privacy requirements. We compare our randomization approach with l-diversity and anatomy in terms of utility preservation (under the same privacy requirements) from three aspects (reconstructed distributions, accuracy of answering queries, and preservation of correlations). Our empirical results show that randomization incurs significantly smaller utility loss.

Relationships Among User Group, Gender and Self-disclosure in Social Media

  • Jang, Phil-Sik
    • Journal of the Korea Society of Computer and Information
    • /
    • v.23 no.4
    • /
    • pp.25-31
    • /
    • 2018
  • In recent years the privacy issue on social media is often being discussed. The purpose of this study is to explore the relationships among user gender, user group according to user activity level (highly active vs less active) and self-disclosure in social media. We collected a total of 180 million tweets issued by 13 million twitter users for 12 months and investigated attributes of tweet (user's profile, profile image, description, geographic information, URL) which are related to self-disclosure and boundary impermeability. The results show there are significant (p<0.001) interactions between user gender, user group and each attribute of tweet that are related to self-disclosure and show that the patterns of self-disclosure are different across attributes. The results also show that the mean self-disclosure scores and boundary impermeability of top 10% highly active users are significantly higher than other less active users for all genders.

Black box-assisted fine-grained hierarchical access control scheme for epidemiological survey data

  • Xueyan Liu;Ruirui Sun;Linpeng Li;Wenjing Li;Tao Liu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.9
    • /
    • pp.2550-2572
    • /
    • 2023
  • Epidemiological survey is an important means for the prevention and control of infectious diseases. Due to the particularity of the epidemic survey, 1) epidemiological survey in epidemic prevention and control has a wide range of people involved, a large number of data collected, strong requirements for information disclosure and high timeliness of data processing; 2) the epidemiological survey data need to be disclosed at different institutions and the use of data has different permission requirements. As a result, it easily causes personal privacy disclosure. Therefore, traditional access control technologies are unsuitable for the privacy protection of epidemiological survey data. In view of these situations, we propose a black box-assisted fine-grained hierarchical access control scheme for epidemiological survey data. Firstly, a black box-assisted multi-attribute authority management mechanism without a trusted center is established to avoid authority deception. Meanwhile, the establishment of a master key-free system not only reduces the storage load but also prevents the risk of master key disclosure. Secondly, a sensitivity classification method is proposed according to the confidentiality degree of the institution to which the data belong and the importance of the data properties to set fine-grained access permission. Thirdly, a hierarchical authorization algorithm combined with data sensitivity and hierarchical attribute-based encryption (ABE) technology is proposed to achieve hierarchical access control of epidemiological survey data. Efficiency analysis and experiments show that the scheme meets the security requirements of privacy protection and key management in epidemiological survey.

Sharing and Privacy in PHRs: Efficient Policy Hiding and Update Attribute-based Encryption

  • Liu, Zhenhua;Ji, Jiaqi;Yin, Fangfang;Wang, Baocang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.1
    • /
    • pp.323-342
    • /
    • 2021
  • Personal health records (PHRs) is an electronic medical system that enables patients to acquire, manage and share their health data. Nevertheless, data confidentiality and user privacy in PHRs have not been handled completely. As a fine-grained access control over health data, ciphertext-policy attribute-based encryption (CP-ABE) has an ability to guarantee data confidentiality. However, existing CP-ABE solutions for PHRs are facing some new challenges in access control, such as policy privacy disclosure and dynamic policy update. In terms of addressing these problems, we propose a privacy protection and dynamic share system (PPADS) based on CP-ABE for PHRs, which supports full policy hiding and flexible access control. In the system, attribute information of access policy is fully hidden by attribute bloom filter. Moreover, data user produces a transforming key for the PHRs Cloud to change access policy dynamically. Furthermore, relied on security analysis, PPADS is selectively secure under standard model. Finally, the performance comparisons and simulation results demonstrate that PPADS is suitable for PHRs.

Classification of Consumer Review Information Based on Satisfaction/Dissatisfaction with Availability/Non-availability of Information (구매후기 정보의 충족/미충족에 따른 소비자의 만족/불만족 인식 및 구매후기 정보의 유형화)

  • Hong, Hee-Sook
    • Journal of the Korean Society of Clothing and Textiles
    • /
    • v.35 no.9
    • /
    • pp.1099-1111
    • /
    • 2011
  • This study identified the types of consumer review information about apparel products based on consumer satisfaction/dissatisfaction with the availability/non-availability of consumer review information for online stores. Data were collected from 318 females aged 20s' to 30s', who had significant experience in reading consumer reviews posted on online stores. Consumer satisfaction/dissatisfaction with availability or non-availability of review information on online stores is different for information in regards to apparel product attributes, product benefits, and store attributes. According to the concept of quality elements suggested by the Kano model, two types of consumer review information were determined: Must-have information (product attribute information about size, fabric, color and design of the apparel product; benefit information about washing & care and comport of the apparel product; store attribute information about responsiveness, disclosure, delivery and after service of the store) and attracting information (attribute information about price comparison; benefit information about coordination with other items, fashionability, price discounts, value for price, reaction from others, emotion experienced during transaction, symbolic features for status, health functionality, and eco-friendly feature; store attribute information about return/refund, damage compensation and reputation/credibility of online store and interactive and dynamic nature of reviews among customers). There were significant differences between the high and low involvement groups in their perceptions of consumer review information.

Privacy Disclosure and Preservation in Learning with Multi-Relational Databases

  • Guo, Hongyu;Viktor, Herna L.;Paquet, Eric
    • Journal of Computing Science and Engineering
    • /
    • v.5 no.3
    • /
    • pp.183-196
    • /
    • 2011
  • There has recently been a surge of interest in relational database mining that aims to discover useful patterns across multiple interlinked database relations. It is crucial for a learning algorithm to explore the multiple inter-connected relations so that important attributes are not excluded when mining such relational repositories. However, from a data privacy perspective, it becomes difficult to identify all possible relationships between attributes from the different relations, considering a complex database schema. That is, seemingly harmless attributes may be linked to confidential information, leading to data leaks when building a model. Thus, we are at risk of disclosing unwanted knowledge when publishing the results of a data mining exercise. For instance, consider a financial database classification task to determine whether a loan is considered high risk. Suppose that we are aware that the database contains another confidential attribute, such as income level, that should not be divulged. One may thus choose to eliminate, or distort, the income level from the database to prevent potential privacy leakage. However, even after distortion, a learning model against the modified database may accurately determine the income level values. It follows that the database is still unsafe and may be compromised. This paper demonstrates this potential for privacy leakage in multi-relational classification and illustrates how such potential leaks may be detected. We propose a method to generate a ranked list of subschemas that maintains the predictive performance on the class attribute, while limiting the disclosure risk, and predictive accuracy, of confidential attributes. We illustrate and demonstrate the effectiveness of our method against a financial database and an insurance database.

Internet Financial Reporting: Case of Iran

  • Shiri, Mahmoud Mousavi;Salehi, Mahdi;Bigmoradi, Nahid
    • Journal of Distribution Science
    • /
    • v.11 no.3
    • /
    • pp.49-62
    • /
    • 2013
  • Purpose - The purpose of this paper is has been to identify the information disclosed by Internet website companies listed in Tehran Stock Exchange. Research design, data, methodology - The list was prepared includes 84 attributes for financial information in two parts and 36 non-financial information attributes and with 48 attributes of listed companies in Tehran Stock Exchange. Results - The results show that Internet reporting in Iran has improved compared to previous research. However, the level of financial disclosure and accounting firms with the most important research in this area is weak and these companies are more willing to disclose non-financial information to disclose their financial information. In Iran has been little research on Internet financial reporting. Conclusions - Although this study has been to the best possible information is available on the website of each company covered and fully evaluated but May have some unwanted data hidden from view has been fulfilled and is missing. The attribute relating to support of other languages, in this study, only the presence or absence of links (other languages) and information disclosed is limited to languages have not been studied other than Persian.

  • PDF

Selection of Optimal Variables for Clustering of Seoul using Genetic Algorithm (유전자 알고리즘을 이용한 서울시 군집화 최적 변수 선정)

  • Kim, Hyung Jin;Jung, Jae Hoon;Lee, Jung Bin;Kim, Sang Min;Heo, Joon
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.22 no.4
    • /
    • pp.175-181
    • /
    • 2014
  • Korean government proposed a new initiative 'government 3.0' with which the administration will open its dataset to the public before requests. City of Seoul is the front runner in disclosure of government data. If we know what kind of attributes are governing factors for any given segmentation, these outcomes can be applied to real world problems of marketing and business strategy, and administrative decision makings. However, with respect to city of Seoul, selection of optimal variables from the open dataset up to several thousands of attributes would require a humongous amount of computation time because it might require a combinatorial optimization while maximizing dissimilarity measures between clusters. In this study, we acquired 718 attribute dataset from Statistics Korea and conducted an analysis to select the most suitable variables, which differentiate Gangnam from other districts, using the Genetic algorithm and Dunn's index. Also, we utilized the Microsoft Azure cloud computing system to speed up the process time. As the result, the optimal 28 variables were finally selected, and the validation result showed that those 28 variables effectively group the Gangnam from other districts using the Ward's minimum variance and K-means algorithm.