Dynamic publishing of social network graphs offers insights into user behavior but brings privacy risks, notably re-identification attacks on evolving data snapshots. Existing methods based on -anonymity can mitigate ...Dynamic publishing of social network graphs offers insights into user behavior but brings privacy risks, notably re-identification attacks on evolving data snapshots. Existing methods based on -anonymity can mitigate these attacks but are cumbersome, neglect dynamic protection of community structure, and lack precise utility measures. To address these challenges, we present a dynamic social network graph anonymity scheme with community structure protection (DSNGA-CSP), which achieves the dynamic anonymization process by incorporating community detection. First, DSNGA-CSP categorizes communities of the original graph into three types at each timestamp, and only partitions community subgraphs for a specific category at each updated timestamp. Then, DSNGA-CSP achieves intra-community and inter-community anonymization separately to retain more of the community structure of the original graph at each timestamp. It anonymizes community subgraphs by the proposed novel -composition method and anonymizes inter-community edges by edge isomorphism. Finally, a novel information loss metric is introduced in DSNGA-CSP to precisely capture the utility of the anonymized graph through original information preservation and anonymous information changes. Extensive experiments conducted on five real-world datasets demonstrate that DSNGA-CSP consistently outperforms existing methods, providing a more effective balance between privacy and utility. Specifically, DSNGA-CSP shows an average utility improvement of approximately 30% compared to TAKG and CTKGA for three dynamic graph datasets, according to the proposed information loss metric IL.展开更多
With the increase in IoT(Internet of Things)devices comes an inherent challenge of security.In the world today,privacy is the prime concern of every individual.Preserving one’s privacy and keeping anonymity throughou...With the increase in IoT(Internet of Things)devices comes an inherent challenge of security.In the world today,privacy is the prime concern of every individual.Preserving one’s privacy and keeping anonymity throughout the system is a desired functionality that does not come without inevitable trade-offs like scalability and increased complexity and is always exceedingly difficult to manage.The challenge is keeping confidentiality and continuing to make the person innominate throughout the system.To address this,we present our proposed architecture where we manage IoT devices using blockchain technology.Our proposed architecture works on and off blockchain integrated with the closed-circuit television(CCTV)security camera fixed at the rental property.In this framework,the CCTV security camera feed is redirected towards the owner and renter based on the smart contract conditions.One entity(owner or renter)can see the CCTV security camera feed at one time.There is no third-party dependence except for the CCTV security camera deployment phase.Our contributions include the proposition of framework architecture,a novel smart contract algorithm,and the modification to the ring signatures leveraging an existing cryptographic technique.Analyses are made based on different systems’security and key management areas.In an empirical study,our proposed algorithm performed better in key generation,proof generation,and verification times.By comparing similar existing schemes,we have shown the proposed architectures’advantages.Until now,we have developed this system for a specific area in the real world.However,this system is scalable and applicable to other areas like healthcare monitoring systems,which is part of our future work.展开更多
This paper proposes a clustered trajectories anonymity scheme （CTA） that enhances the kano nymity scheme to provide the intended level of source location privacy in mobile event monitoring when a global attacker is ...This paper proposes a clustered trajectories anonymity scheme （CTA） that enhances the kano nymity scheme to provide the intended level of source location privacy in mobile event monitoring when a global attacker is assumed. CTA applies isomorphic property of rotation to create traces of the fake sources distributions which are similar to those of the real sources. Thus anonymity of each trajectory and that of the clustered is achieved. In addition, location kdiversity is achieved by dis tributing fake sources around the base station. To reduce the time delay, tree rooted at the base sta tion is constructed to overlap part of the beacon interval of the nodes in the hierarchy. Both the ana lytical analysis and the simulation results prove that proved energy overhead and time delay. our scheme provides perfect anonymity with improved energy overhead and time delay.展开更多
In cyberspace security,the privacy in location-based services(LBSs) becomes more critical. In previous solutions,a trusted third party(TTP) was usually employed to provide disturbance or obfuscation,but it may become ...In cyberspace security,the privacy in location-based services(LBSs) becomes more critical. In previous solutions,a trusted third party(TTP) was usually employed to provide disturbance or obfuscation,but it may become the single point of failure or service bottleneck. In order to cope with this drawback,we focus on another important class,establishing anonymous group through short-range communication to achieve k-anonymity with collaborative users. Along with the analysis of existing algorithms,we found users in the group must share the same maximum anonymity degree,and they could not ease the process of preservation in a lower one. To cope with this problem,we proposed a random-QBE algorithm to put up with personalized anonymity in user collaboration algorithms,and this algorithm could preserve both query privacy and location privacy. Then we studied the attacks from passive and active adversaries and used entropy to measure user's privacy level. Finally,experimental evaluations further verify its effectiveness and efficiency.展开更多
Privacy-preserving data publishing （PPDP） is one of the hot issues in the field of the network security. The existing PPDP technique cannot deal with generality attacks, which explicitly contain the sensitivity atta...Privacy-preserving data publishing （PPDP） is one of the hot issues in the field of the network security. The existing PPDP technique cannot deal with generality attacks, which explicitly contain the sensitivity attack and the similarity attack. This paper proposes a novel model, （w,γ, k）-anonymity, to avoid generality attacks on both cases of numeric and categorical attributes. We show that the optimal （w, γ, k）-anonymity problem is NP-hard and conduct the Top-down Local recoding （TDL） algorithm to implement the model. Our experiments validate the improvement of our model with real data.展开更多
The aim of this paper is to focus on the ethical issues raised by the removal of anonymity from sperm donors. The increasing currency of a ＇right to genetic truth＇ is clearly visible in the drive to revise the legis...The aim of this paper is to focus on the ethical issues raised by the removal of anonymity from sperm donors. The increasing currency of a ＇right to genetic truth＇ is clearly visible in the drive to revise the legislation on donor anonymity in Western and European countries. The ethical debate is polarized between the ＇right to privacy＇ of the donor or parent and the ＇right to know＇ of the prospective child. However, it is evident that religious, social and cultural attitudes have an overarching impact on attitudes towards sperm donation generally and anonymity specifically. In Asian countries, the social and cultural heritage is hugely diverse and different from those of the West. This review considers the research exploring the complexity of ethical issues informing this debate, and argues that parent＇s decisions to reveal donor insemination origins to their children are highly complex and relate to a range of social and cultural attitudes that have not been addressed within the policy to remove anonymity from sperm donors.展开更多
Blockchain is a technology that uses community validation to keep synchronized the content of ledgers replicated across multiple users,which is the underlying technology of digital currency like bitcoin.The anonymity ...Blockchain is a technology that uses community validation to keep synchronized the content of ledgers replicated across multiple users,which is the underlying technology of digital currency like bitcoin.The anonymity of blockchain has caused widespread concern.In this paper,we put forward AABN,an Anonymity Assessment model based on Bayesian Network.Firstly,we investigate and analyze the anonymity assessment techniques,and focus on typical anonymity assessment schemes.Then the related concepts involved in the assessment model are introduced and the model construction process is described in detail.Finally,the anonymity in the MIX anonymous network is quantitatively evaluated using the methods of accurate reasoning and approximate reasoning respectively,and the anonymity assessment experiments under different output strategies of the MIX anonymous network are analyzed.展开更多
Security problem is an important issue for Wireless Sensor Network.The paper focuses on the privacy protection of WSN applications.An anonymity enhancement tactic based on pseudonym mechanism is presented for clustere...Security problem is an important issue for Wireless Sensor Network.The paper focuses on the privacy protection of WSN applications.An anonymity enhancement tactic based on pseudonym mechanism is presented for clustered Wireless Sensor Network,which provides anonymity for both the sensors within a cluster and the cluster head nodes.Simulation experiments are launched through NS2 platform to validate the anonymity performance.The theoretical analysis and empirical study imply that the proposed scheme based on pseudonym can protect the privacies of both the sensor nodes and the cluster head nodes.The work is valuable and the experimental results are convincible.展开更多
The frequent use of location query services in location-based services will come out a large amount of space-time data related to users. Attackers infer information of location or track based on these rich background ...The frequent use of location query services in location-based services will come out a large amount of space-time data related to users. Attackers infer information of location or track based on these rich background knowledge. Therefore, aiming at the problem of trajectory privacy, the context adds instant traffic monitoring based on user behavior patterns, trajectory similarity and other background information. According to the idea of k anonymity, proposed a method combined with traffic condition to protect the trajectory privacy. First, the user randomly selects a time point of the real trajectory to rotate to generate dummy trajectory, and then repeat the above process on the real trajectory and dummy trajectory. Up to the generation of k −1 dummy trajectory, and according to the actual road conditions and trajectory leakage probability, traversing dummy trajectory to adjust. Finally, it is further proved through experiments that the method will be more efficient and protect privacy well.展开更多
When accessing remote services over public networks, a user authentication mechanism is required because these activities are executed in an insecure communication environment. Recently, Wang et al. proposed an authen...When accessing remote services over public networks, a user authentication mechanism is required because these activities are executed in an insecure communication environment. Recently, Wang et al. proposed an authentication and key agreement scheme preserving the privacy of secret keys and providing user anonymity. Later, Chang et al. indicated that their scheme suffers from two security flaws. First, it cannot resist DoS （denial-of-service） attack because the indicators for the next session are not consistent. Second, the user password may be modified by a malicious attacker because no authentication mechanism is applied before the user password is updated. To eliminate the security flaws and preserve the advantages of Wang et aL＇s scheme, we propose an improvement in this paper.展开更多
In this paper, we proposed an anonymity scheme based on pseudonym where peers are motivated not to share their identity. Compared with precious scheme such as RuP （Reputation using Pseudonyms）, our scheme can reduce...In this paper, we proposed an anonymity scheme based on pseudonym where peers are motivated not to share their identity. Compared with precious scheme such as RuP （Reputation using Pseudonyms）, our scheme can reduce its overhead and minimize the trusted center＇s involvement.展开更多
E-cash is a type of very important electronic payment systems. The complete anonymity of E-cash can be used for criminal activities, so E-cash should be anonymity controlled.Moreover, Elliptic Curve Cryptography(ECC) ...E-cash is a type of very important electronic payment systems. The complete anonymity of E-cash can be used for criminal activities, so E-cash should be anonymity controlled.Moreover, Elliptic Curve Cryptography(ECC) has been regard as the mainstream of current public cryptography . In this paper, a new anonymity controlled E-cash scheme based on ECC for the first time and using a new technology-one-time key pairs digital signature is designed, and its security and efficiency are analyzed. In our scheme, the coin tracing and owner tracing can be implemented.展开更多
A fully distributed exchange-based anonymity P2P reputation system--EARep was proposed. EARep can provide all the peer＇s anonymity in a fully distributed structured manner. In EARep, each peer＇s anonymity is achieve...A fully distributed exchange-based anonymity P2P reputation system--EARep was proposed. EARep can provide all the peer＇s anonymity in a fully distributed structured manner. In EARep, each peer＇s anonymity is achieved by changing pseudonyms. Analysis and simulation results showed that compared with DARep, which is an existing representative scheme, our system has two main features. First, EARep increased anonymity degree （measured by linkage probability） and was much more scalable than DARep. Specifically, with the same message overhead, EARep reduced the linkage probability by more than 50% compared with DARep. Alternatively, to achieve the same anonymity degree, the message overhead in EARep was less than 25% of that in DARep. Second, the service selection success , tio of EARep was greater than 90% even when the percentage of malicious peers was up to 70%, which makes our system robust to malicious behaviors of peers.展开更多
The user anonymity mechanism provided in GSM and UMTS network is analyzed,and a new approach to solve the anonymity of mobile subscriber is proposed in this paper.Using the ciphering algorithm with a dynamic key and a...The user anonymity mechanism provided in GSM and UMTS network is analyzed,and a new approach to solve the anonymity of mobile subscriber is proposed in this paper.Using the ciphering algorithm with a dynamic key and a static key,the method allows mobile subscribers to connect network with user anonymity,and it can be seamlessly integrated with the existing authentication algorithms.The analyses reveal that the proposed scheme can provide the integrity protection of messages,prevent the replay attacks,and be implemented easily.展开更多
In peer-to-peer (P2P) reputation systems,each peer's trustworthiness is evaluated based on its pseudonym's rating values given by other peers. Since it is assumed that each peer has a long lived pseudonym,all ...In peer-to-peer (P2P) reputation systems,each peer's trustworthiness is evaluated based on its pseudonym's rating values given by other peers. Since it is assumed that each peer has a long lived pseudonym,all the transactions conducted by the same peer may be linked by its pseudonym. Therefore,one of the fundamental challenges in P2P reputation systems is to protect peers' identity privacy. In this paper,we present two independent anonymity protocols to achieve all the peers' anonymity by changing pseudonym with the help of a trusted third party (TTP) server. Compared with RuP (Reputation using Pseudonym),an existing representative scheme,our protocols reduce the server's cost in two different ways. First,we propose a protocol using blind signature scheme as in RuP. The protocol improves the blind signature scheme and assessment of macro-node values,and reduces the server's cost by half in terms of encryption and decryption operations and message overhead. Second,we propose another protocol,group-confusion protocol,to further reduce the server's cost.展开更多
Internet of Things(IoT)applications can be found in various industry areas,including critical infrastructure and healthcare,and IoT is one of several technological developments.As a result,tens of billions or possibly...Internet of Things(IoT)applications can be found in various industry areas,including critical infrastructure and healthcare,and IoT is one of several technological developments.As a result,tens of billions or possibly hundreds of billions of devices will be linked together.These smart devices will be able to gather data,process it,and even come to decisions on their own.Security is the most essential thing in these situations.In IoT infrastructure,authenticated key exchange systems are crucial for preserving client and data privacy and guaranteeing the security of data-in-transit(e.g.,via client identification and provision of secure communication).It is still challenging to create secure,authenticated key exchange techniques.The majority of the early authenticated key agreement procedure depended on computationally expensive and resource-intensive pairing,hashing,or modular exponentiation processes.The focus of this paper is to propose an efficient three-party authenticated key exchange procedure(AKEP)using Chebyshev chaotic maps with client anonymity that solves all the problems mentioned above.The proposed three-party AKEP is protected from several attacks.The proposed three-party AKEP can be used in practice for mobile communications and pervasive computing applications,according to statistical experiments and low processing costs.To protect client identification when transferring data over an insecure public network,our three-party AKEP may also offer client anonymity.Finally,the presented procedure offers better security features than the procedures currently available in the literature.展开更多
An outsource database is a database service provided by cloud computing companies.Using the outsource database can reduce the hardware and software＇s cost and also get more efficient and reliable data processing capa...An outsource database is a database service provided by cloud computing companies.Using the outsource database can reduce the hardware and software＇s cost and also get more efficient and reliable data processing capacity.However,the outsource database still has some challenges.If the service provider does not have sufficient confidence,there is the possibility of data leakage.The data may has user＇s privacy,so data leakage may cause data privacy leak.Based on this factor,to protect the privacy of data in the outsource database becomes very important.In the past,scholars have proposed k-anonymity to protect data privacy in the database.It lets data become anonymous to avoid data privacy leak.But k-anonymity has some problems,it is irreversible,and easier to be attacked by homogeneity attack and background knowledge attack.Later on,scholars have proposed some studies to solve homogeneity attack and background knowledge attack.But their studies still cannot recover back to the original data.In this paper,we propose a data anonymity method.It can be reversible and also prevent those two attacks.Our study is based on the proposed r-transform.It can be used on the numeric type of attributes in the outsource database.In the experiment,we discussed the time required to anonymize and recover data.Furthermore,we investigated the defense against homogeneous attack and background knowledge attack.At the end,we summarized the proposed method and future researches.展开更多
The Internet of Things (IoT) and Cloud computing are gaining popularity due to their numerous advantages, including the efficient utilization of internetand computing resources. In recent years, many more IoT applicat...The Internet of Things (IoT) and Cloud computing are gaining popularity due to their numerous advantages, including the efficient utilization of internetand computing resources. In recent years, many more IoT applications have beenextensively used. For instance, Healthcare applications execute computations utilizing the user’s private data stored on cloud servers. However, the main obstaclesfaced by the extensive acceptance and usage of these emerging technologies aresecurity and privacy. Moreover, many healthcare data management system applications have emerged, offering solutions for distinct circumstances. But still, theexisting system has issues with specific security issues, privacy-preserving rate,information loss, etc. Hence, the overall system performance is reduced significantly. A unique blockchain-based technique is proposed to improve anonymityin terms of data access and data privacy to overcome the above-mentioned issues.Initially, the registration phase is done for the device and the user. After that, theGeo-Location and IP Address values collected during registration are convertedinto Hash values using Adler 32 hashing algorithm, and the private and publickeys are generated using the key generation centre. Then the authentication is performed through login. The user then submits a request to the blockchain server,which redirects the request to the associated IoT device in order to obtain thesensed IoT data. The detected data is anonymized in the device and stored inthe cloud server using the Linear Scaling based Rider Optimization algorithmwith integrated KL Anonymity (LSR-KLA) approach. After that, the Time-stamp-based Public and Private Key Schnorr Signature (TSPP-SS) mechanismis used to permit the authorized user to access the data, and the blockchain servertracks the entire transaction. The experimental findings showed that the proposedLSR-KLA and TSPP-SS technique provides better performance in terms of higherprivacy-preserving rate, lower information loss, execution time, and Central Processing Unit (CPU) usage than the existing techniques. Thus, the proposed method allows for better data privacy in the smart healthcare network.展开更多
Electronic check systems, as one of electronic payment systems, are more desirable than other electronic cash systems. In the system, only a single cheek is used to pay any price that is not more than the face value. ...Electronic check systems, as one of electronic payment systems, are more desirable than other electronic cash systems. In the system, only a single cheek is used to pay any price that is not more than the face value. The main problem in check systems is to design an efficient refund mechanism that makes refired cheeks undistinguished from initial checks during payment and deposit. The problem of anonymity control also called fairmess is also an important issue in check systelns. All check systems yet are unconditional anonymity that opens the door to misuse for crime such as laundering and blackmailing. In this paper, the notion of anonylnity revocation is introduced to electronic check system for the fitst thne, and a model of fair electronic check system is proposed. An effieient fair online electronic check system with reusable refund is presented. In the system, a passive trustee is elnployed to revoke the anonymity of unhonest users. Moreover, the system solves the reusability problem of refunds thanks to the RSA-based partially signature. The system is efficient and meets all basic security requirements.展开更多
Anonymity, an important feature of computer-mediated communication (CMC), is embedded in this new technology. With the penetration of the Internet in society, many daily activities involve online interactions. Anonymi...Anonymity, an important feature of computer-mediated communication (CMC), is embedded in this new technology. With the penetration of the Internet in society, many daily activities involve online interactions. Anonymity affects both the task and social aspects of online communication including information exchange, decision making, and relationship development. This review examines the effects of anonymity on human behavior. It outlines how the prior literature has attempted to address this issue and how the Social Identity Deindividuation (SIDE) model has developed as an attempt to tackle this question. More importantly, it discusses a framework describing the multidimensions of anonymity in CMC [1], and subsequently raised five propositions inspired by this framework. Furthermore, using McLeod’s framework, this review evaluates SIDE studies with regard to their anonymity manipulations. This critique reveals possible future research directions for refining the SIDE model and better studying the effect of anonymity in virtual environment.展开更多
基金supported by the Natural Science Foundation of China(No.U22A2099)the Innovation Project of Guangxi Graduate Education(YCBZ2023130).
文摘Dynamic publishing of social network graphs offers insights into user behavior but brings privacy risks, notably re-identification attacks on evolving data snapshots. Existing methods based on -anonymity can mitigate these attacks but are cumbersome, neglect dynamic protection of community structure, and lack precise utility measures. To address these challenges, we present a dynamic social network graph anonymity scheme with community structure protection (DSNGA-CSP), which achieves the dynamic anonymization process by incorporating community detection. First, DSNGA-CSP categorizes communities of the original graph into three types at each timestamp, and only partitions community subgraphs for a specific category at each updated timestamp. Then, DSNGA-CSP achieves intra-community and inter-community anonymization separately to retain more of the community structure of the original graph at each timestamp. It anonymizes community subgraphs by the proposed novel -composition method and anonymizes inter-community edges by edge isomorphism. Finally, a novel information loss metric is introduced in DSNGA-CSP to precisely capture the utility of the anonymized graph through original information preservation and anonymous information changes. Extensive experiments conducted on five real-world datasets demonstrate that DSNGA-CSP consistently outperforms existing methods, providing a more effective balance between privacy and utility. Specifically, DSNGA-CSP shows an average utility improvement of approximately 30% compared to TAKG and CTKGA for three dynamic graph datasets, according to the proposed information loss metric IL.
基金This work was supported by Institute of Information&Communications Technology Planning&Evaluation(IITP)under the Artificial Intelligence Convergence Innovation Human Resources Development(IITP-2023-RS-2023-00255968)Grantthe ITRC(Information Technology Research Center)Support Program(IITP-2021-0-02051)funded by theKorea government(MSIT).
文摘With the increase in IoT(Internet of Things)devices comes an inherent challenge of security.In the world today,privacy is the prime concern of every individual.Preserving one’s privacy and keeping anonymity throughout the system is a desired functionality that does not come without inevitable trade-offs like scalability and increased complexity and is always exceedingly difficult to manage.The challenge is keeping confidentiality and continuing to make the person innominate throughout the system.To address this,we present our proposed architecture where we manage IoT devices using blockchain technology.Our proposed architecture works on and off blockchain integrated with the closed-circuit television(CCTV)security camera fixed at the rental property.In this framework,the CCTV security camera feed is redirected towards the owner and renter based on the smart contract conditions.One entity(owner or renter)can see the CCTV security camera feed at one time.There is no third-party dependence except for the CCTV security camera deployment phase.Our contributions include the proposition of framework architecture,a novel smart contract algorithm,and the modification to the ring signatures leveraging an existing cryptographic technique.Analyses are made based on different systems’security and key management areas.In an empirical study,our proposed algorithm performed better in key generation,proof generation,and verification times.By comparing similar existing schemes,we have shown the proposed architectures’advantages.Until now,we have developed this system for a specific area in the real world.However,this system is scalable and applicable to other areas like healthcare monitoring systems,which is part of our future work.
基金Supported by the National Natural Science Foundation of China(No.60903157)the Fundamental Research funds for the Central Universities of China(No.ZYGX2011J066)the Sichuan Science and Technology Support Project(No.2013GZ0022)
文摘This paper proposes a clustered trajectories anonymity scheme （CTA） that enhances the kano nymity scheme to provide the intended level of source location privacy in mobile event monitoring when a global attacker is assumed. CTA applies isomorphic property of rotation to create traces of the fake sources distributions which are similar to those of the real sources. Thus anonymity of each trajectory and that of the clustered is achieved. In addition, location kdiversity is achieved by dis tributing fake sources around the base station. To reduce the time delay, tree rooted at the base sta tion is constructed to overlap part of the beacon interval of the nodes in the hierarchy. Both the ana lytical analysis and the simulation results prove that proved energy overhead and time delay. our scheme provides perfect anonymity with improved energy overhead and time delay.
基金supported by the National Natural Science Foundation of China (Grant No.61472097)the Specialized Research Fund for the Doctoral Program of Higher Education(Grant No.20132304110017)+1 种基金the Natural Science Foundation of Heilongjiang Province of China (Grant No.F2015022)the Fujian Provincial Key Laboratory of Network Security and Cryptology Research Fund (Fujian Normal University) (No.15003)
文摘In cyberspace security,the privacy in location-based services(LBSs) becomes more critical. In previous solutions,a trusted third party(TTP) was usually employed to provide disturbance or obfuscation,but it may become the single point of failure or service bottleneck. In order to cope with this drawback,we focus on another important class,establishing anonymous group through short-range communication to achieve k-anonymity with collaborative users. Along with the analysis of existing algorithms,we found users in the group must share the same maximum anonymity degree,and they could not ease the process of preservation in a lower one. To cope with this problem,we proposed a random-QBE algorithm to put up with personalized anonymity in user collaboration algorithms,and this algorithm could preserve both query privacy and location privacy. Then we studied the attacks from passive and active adversaries and used entropy to measure user's privacy level. Finally,experimental evaluations further verify its effectiveness and efficiency.
基金supported in part by Research Fund for the Doctoral Program of Higher Education of China(No.20120009110007)Program for Innovative Research Team in University of Ministry of Education of China (No.IRT201206)+3 种基金Program for New Century Excellent Talents in University(NCET-110565)the Fundamental Research Funds for the Central Universities(No.2012JBZ010)the Open Project Program of Beijing Key Laboratory of Trusted Computing at Beijing University of TechnologyBeijing Higher Education Young Elite Teacher Project(No. YETP0542)
文摘Privacy-preserving data publishing （PPDP） is one of the hot issues in the field of the network security. The existing PPDP technique cannot deal with generality attacks, which explicitly contain the sensitivity attack and the similarity attack. This paper proposes a novel model, （w,γ, k）-anonymity, to avoid generality attacks on both cases of numeric and categorical attributes. We show that the optimal （w, γ, k）-anonymity problem is NP-hard and conduct the Top-down Local recoding （TDL） algorithm to implement the model. Our experiments validate the improvement of our model with real data.
文摘The aim of this paper is to focus on the ethical issues raised by the removal of anonymity from sperm donors. The increasing currency of a ＇right to genetic truth＇ is clearly visible in the drive to revise the legislation on donor anonymity in Western and European countries. The ethical debate is polarized between the ＇right to privacy＇ of the donor or parent and the ＇right to know＇ of the prospective child. However, it is evident that religious, social and cultural attitudes have an overarching impact on attitudes towards sperm donation generally and anonymity specifically. In Asian countries, the social and cultural heritage is hugely diverse and different from those of the West. This review considers the research exploring the complexity of ethical issues informing this debate, and argues that parent＇s decisions to reveal donor insemination origins to their children are highly complex and relate to a range of social and cultural attitudes that have not been addressed within the policy to remove anonymity from sperm donors.
基金supported by the following grants:the National Natural Science Foundation of China under Grant No.61170273the China Scholarship Council under Grant No.[2013]3050+1 种基金CCF-Tencent Open Fund WeBank Special Fuding(CCF-WebankRAGR20180104)the Beijing Natural Science Foundation(4194086)
文摘Blockchain is a technology that uses community validation to keep synchronized the content of ledgers replicated across multiple users,which is the underlying technology of digital currency like bitcoin.The anonymity of blockchain has caused widespread concern.In this paper,we put forward AABN,an Anonymity Assessment model based on Bayesian Network.Firstly,we investigate and analyze the anonymity assessment techniques,and focus on typical anonymity assessment schemes.Then the related concepts involved in the assessment model are introduced and the model construction process is described in detail.Finally,the anonymity in the MIX anonymous network is quantitatively evaluated using the methods of accurate reasoning and approximate reasoning respectively,and the anonymity assessment experiments under different output strategies of the MIX anonymous network are analyzed.
基金the National Natural Science Foundation of China (NSFC) under grant No.61309024,the National Key Basic Research Program of China (973) under Grant No.2013CB834204,the Fundamental Research Funds for the Central Universities under grant No.14CX06009A at China University of Petroleum
文摘Security problem is an important issue for Wireless Sensor Network.The paper focuses on the privacy protection of WSN applications.An anonymity enhancement tactic based on pseudonym mechanism is presented for clustered Wireless Sensor Network,which provides anonymity for both the sensors within a cluster and the cluster head nodes.Simulation experiments are launched through NS2 platform to validate the anonymity performance.The theoretical analysis and empirical study imply that the proposed scheme based on pseudonym can protect the privacies of both the sensor nodes and the cluster head nodes.The work is valuable and the experimental results are convincible.
文摘The frequent use of location query services in location-based services will come out a large amount of space-time data related to users. Attackers infer information of location or track based on these rich background knowledge. Therefore, aiming at the problem of trajectory privacy, the context adds instant traffic monitoring based on user behavior patterns, trajectory similarity and other background information. According to the idea of k anonymity, proposed a method combined with traffic condition to protect the trajectory privacy. First, the user randomly selects a time point of the real trajectory to rotate to generate dummy trajectory, and then repeat the above process on the real trajectory and dummy trajectory. Up to the generation of k −1 dummy trajectory, and according to the actual road conditions and trajectory leakage probability, traversing dummy trajectory to adjust. Finally, it is further proved through experiments that the method will be more efficient and protect privacy well.
基金supported by National Science Council under Grant No. 98-2221-E-025-007- and 99-2410-H-025-010-MY2
文摘When accessing remote services over public networks, a user authentication mechanism is required because these activities are executed in an insecure communication environment. Recently, Wang et al. proposed an authentication and key agreement scheme preserving the privacy of secret keys and providing user anonymity. Later, Chang et al. indicated that their scheme suffers from two security flaws. First, it cannot resist DoS （denial-of-service） attack because the indicators for the next session are not consistent. Second, the user password may be modified by a malicious attacker because no authentication mechanism is applied before the user password is updated. To eliminate the security flaws and preserve the advantages of Wang et aL＇s scheme, we propose an improvement in this paper.
文摘In this paper, we proposed an anonymity scheme based on pseudonym where peers are motivated not to share their identity. Compared with precious scheme such as RuP （Reputation using Pseudonyms）, our scheme can reduce its overhead and minimize the trusted center＇s involvement.
基金Supported by the National Natural Science Foundation of China(No.60073052)
文摘E-cash is a type of very important electronic payment systems. The complete anonymity of E-cash can be used for criminal activities, so E-cash should be anonymity controlled.Moreover, Elliptic Curve Cryptography(ECC) has been regard as the mainstream of current public cryptography . In this paper, a new anonymity controlled E-cash scheme based on ECC for the first time and using a new technology-one-time key pairs digital signature is designed, and its security and efficiency are analyzed. In our scheme, the coin tracing and owner tracing can be implemented.
基金Supported by the National Natural Science Foundation of China (60773008)
文摘A fully distributed exchange-based anonymity P2P reputation system--EARep was proposed. EARep can provide all the peer＇s anonymity in a fully distributed structured manner. In EARep, each peer＇s anonymity is achieved by changing pseudonyms. Analysis and simulation results showed that compared with DARep, which is an existing representative scheme, our system has two main features. First, EARep increased anonymity degree （measured by linkage probability） and was much more scalable than DARep. Specifically, with the same message overhead, EARep reduced the linkage probability by more than 50% compared with DARep. Alternatively, to achieve the same anonymity degree, the message overhead in EARep was less than 25% of that in DARep. Second, the service selection success , tio of EARep was greater than 90% even when the percentage of malicious peers was up to 70%, which makes our system robust to malicious behaviors of peers.
基金Supported by the National Natural Science Foundation of China (71101152)
文摘The user anonymity mechanism provided in GSM and UMTS network is analyzed,and a new approach to solve the anonymity of mobile subscriber is proposed in this paper.Using the ciphering algorithm with a dynamic key and a static key,the method allows mobile subscribers to connect network with user anonymity,and it can be seamlessly integrated with the existing authentication algorithms.The analyses reveal that the proposed scheme can provide the integrity protection of messages,prevent the replay attacks,and be implemented easily.
基金the National High Technology Research and Development Program (863) of China(No. 07QA14033)the National Natural Science Foundation of China(No.60702047)
文摘In peer-to-peer (P2P) reputation systems,each peer's trustworthiness is evaluated based on its pseudonym's rating values given by other peers. Since it is assumed that each peer has a long lived pseudonym,all the transactions conducted by the same peer may be linked by its pseudonym. Therefore,one of the fundamental challenges in P2P reputation systems is to protect peers' identity privacy. In this paper,we present two independent anonymity protocols to achieve all the peers' anonymity by changing pseudonym with the help of a trusted third party (TTP) server. Compared with RuP (Reputation using Pseudonym),an existing representative scheme,our protocols reduce the server's cost in two different ways. First,we propose a protocol using blind signature scheme as in RuP. The protocol improves the blind signature scheme and assessment of macro-node values,and reduces the server's cost by half in terms of encryption and decryption operations and message overhead. Second,we propose another protocol,group-confusion protocol,to further reduce the server's cost.
文摘Internet of Things(IoT)applications can be found in various industry areas,including critical infrastructure and healthcare,and IoT is one of several technological developments.As a result,tens of billions or possibly hundreds of billions of devices will be linked together.These smart devices will be able to gather data,process it,and even come to decisions on their own.Security is the most essential thing in these situations.In IoT infrastructure,authenticated key exchange systems are crucial for preserving client and data privacy and guaranteeing the security of data-in-transit(e.g.,via client identification and provision of secure communication).It is still challenging to create secure,authenticated key exchange techniques.The majority of the early authenticated key agreement procedure depended on computationally expensive and resource-intensive pairing,hashing,or modular exponentiation processes.The focus of this paper is to propose an efficient three-party authenticated key exchange procedure(AKEP)using Chebyshev chaotic maps with client anonymity that solves all the problems mentioned above.The proposed three-party AKEP is protected from several attacks.The proposed three-party AKEP can be used in practice for mobile communications and pervasive computing applications,according to statistical experiments and low processing costs.To protect client identification when transferring data over an insecure public network,our three-party AKEP may also offer client anonymity.Finally,the presented procedure offers better security features than the procedures currently available in the literature.
文摘An outsource database is a database service provided by cloud computing companies.Using the outsource database can reduce the hardware and software＇s cost and also get more efficient and reliable data processing capacity.However,the outsource database still has some challenges.If the service provider does not have sufficient confidence,there is the possibility of data leakage.The data may has user＇s privacy,so data leakage may cause data privacy leak.Based on this factor,to protect the privacy of data in the outsource database becomes very important.In the past,scholars have proposed k-anonymity to protect data privacy in the database.It lets data become anonymous to avoid data privacy leak.But k-anonymity has some problems,it is irreversible,and easier to be attacked by homogeneity attack and background knowledge attack.Later on,scholars have proposed some studies to solve homogeneity attack and background knowledge attack.But their studies still cannot recover back to the original data.In this paper,we propose a data anonymity method.It can be reversible and also prevent those two attacks.Our study is based on the proposed r-transform.It can be used on the numeric type of attributes in the outsource database.In the experiment,we discussed the time required to anonymize and recover data.Furthermore,we investigated the defense against homogeneous attack and background knowledge attack.At the end,we summarized the proposed method and future researches.
文摘The Internet of Things (IoT) and Cloud computing are gaining popularity due to their numerous advantages, including the efficient utilization of internetand computing resources. In recent years, many more IoT applications have beenextensively used. For instance, Healthcare applications execute computations utilizing the user’s private data stored on cloud servers. However, the main obstaclesfaced by the extensive acceptance and usage of these emerging technologies aresecurity and privacy. Moreover, many healthcare data management system applications have emerged, offering solutions for distinct circumstances. But still, theexisting system has issues with specific security issues, privacy-preserving rate,information loss, etc. Hence, the overall system performance is reduced significantly. A unique blockchain-based technique is proposed to improve anonymityin terms of data access and data privacy to overcome the above-mentioned issues.Initially, the registration phase is done for the device and the user. After that, theGeo-Location and IP Address values collected during registration are convertedinto Hash values using Adler 32 hashing algorithm, and the private and publickeys are generated using the key generation centre. Then the authentication is performed through login. The user then submits a request to the blockchain server,which redirects the request to the associated IoT device in order to obtain thesensed IoT data. The detected data is anonymized in the device and stored inthe cloud server using the Linear Scaling based Rider Optimization algorithmwith integrated KL Anonymity (LSR-KLA) approach. After that, the Time-stamp-based Public and Private Key Schnorr Signature (TSPP-SS) mechanismis used to permit the authorized user to access the data, and the blockchain servertracks the entire transaction. The experimental findings showed that the proposedLSR-KLA and TSPP-SS technique provides better performance in terms of higherprivacy-preserving rate, lower information loss, execution time, and Central Processing Unit (CPU) usage than the existing techniques. Thus, the proposed method allows for better data privacy in the smart healthcare network.
基金国家高技术研究发展计划(863计划)，the National Natural Science Foundation of China
文摘Electronic check systems, as one of electronic payment systems, are more desirable than other electronic cash systems. In the system, only a single cheek is used to pay any price that is not more than the face value. The main problem in check systems is to design an efficient refund mechanism that makes refired cheeks undistinguished from initial checks during payment and deposit. The problem of anonymity control also called fairmess is also an important issue in check systelns. All check systems yet are unconditional anonymity that opens the door to misuse for crime such as laundering and blackmailing. In this paper, the notion of anonylnity revocation is introduced to electronic check system for the fitst thne, and a model of fair electronic check system is proposed. An effieient fair online electronic check system with reusable refund is presented. In the system, a passive trustee is elnployed to revoke the anonymity of unhonest users. Moreover, the system solves the reusability problem of refunds thanks to the RSA-based partially signature. The system is efficient and meets all basic security requirements.
文摘Anonymity, an important feature of computer-mediated communication (CMC), is embedded in this new technology. With the penetration of the Internet in society, many daily activities involve online interactions. Anonymity affects both the task and social aspects of online communication including information exchange, decision making, and relationship development. This review examines the effects of anonymity on human behavior. It outlines how the prior literature has attempted to address this issue and how the Social Identity Deindividuation (SIDE) model has developed as an attempt to tackle this question. More importantly, it discusses a framework describing the multidimensions of anonymity in CMC [1], and subsequently raised five propositions inspired by this framework. Furthermore, using McLeod’s framework, this review evaluates SIDE studies with regard to their anonymity manipulations. This critique reveals possible future research directions for refining the SIDE model and better studying the effect of anonymity in virtual environment.
