摘要 :
Anonymity is an important issue in information security, which its main goal is to protect entities privacy in the systems. Different methods and protocols (with different types of anonymity services) have been developed so far to...
展开
Anonymity is an important issue in information security, which its main goal is to protect entities privacy in the systems. Different methods and protocols (with different types of anonymity services) have been developed so far to provide special anonymity requirements of applications. Each of these systems has been developed with different ad hoc approaches. In this paper we present a conceptual framework that makes specification, analysis and design of anonymity applications more systematic. To do this, first we go toward presenting a conceptual model of anonymity which can be used in clear description of different aspects of anonymity. Then we extract a list of anonymity primitives from the existing anonymity providing methods. These primitives are base functions which can be composed to form anonymity services to provide specified anonymity requirements of the system.
收起
摘要 :
Anonymity is an important issue in information security, which its main goal is to protect entities privacy in the systems. Different methods and protocols (with different types of anonymity services) have been developed so far to...
展开
Anonymity is an important issue in information security, which its main goal is to protect entities privacy in the systems. Different methods and protocols (with different types of anonymity services) have been developed so far to provide special anonymity requirements of applications. Each of these systems has been developed with different ad hoc approaches. In this paper we present a conceptual framework that makes specification, analysis and design of anonymity applications more systematic. To do this, first we go toward presenting a conceptual model of anonymity which can be used in clear description of different aspects of anonymity. Then we extract a list of anonymity primitives from the existing anonymity providing methods. These primitives are base functions which can be composed to form anonymity services to provide specified anonymity requirements of the system.
收起
摘要 :
Anonymous communication in sensor networks is an important security tool. A major sensornet security issue is to anonymize sources and sinks in sensor networks despite the inability to hide wireless transmissions. However, none of...
展开
Anonymous communication in sensor networks is an important security tool. A major sensornet security issue is to anonymize sources and sinks in sensor networks despite the inability to hide wireless transmissions. However, none of the existing anonymous communication schemes provide complete protection against attacks posed by different types of adversaries. In this paper, we propose a novel and scalable anonymous communication scheme Randomized Message Forwarding with Equalized Incoming/Outgoing Traffic Rate (RMFETR) which resists all known eavesdrop attacks. A further modification of this scheme Destination First Randomized Message Forwarding with Equalized Incoming/Outgoing Traffic Rate (DFRMFETR) improves message delivery time significantly. We present security analysis and performance analysis of these two schemes. While both RMFETR and DFRMFETR have the same security benefits against eavesdrop attacks as the randomized Buses protocol, they are more flexible and easy to implement. The expected message delivery time under RMFETR is same as that under the randomized Buses, while DFRMFETR induces a smaller delivery time.
收起
摘要 :
Anonymous communication in sensor networks is an important security tool. A major sensornet security issue is to anonymize sources and sinks in sensor networks despite the inability to hide wireless transmissions. However, none of...
展开
Anonymous communication in sensor networks is an important security tool. A major sensornet security issue is to anonymize sources and sinks in sensor networks despite the inability to hide wireless transmissions. However, none of the existing anonymous communication schemes provide complete protection against attacks posed by different types of adversaries. In this paper, we propose a novel and scalable anonymous communication scheme Randomized Message Forwarding with Equalized Incoming/Outgoing Traffic Rate (RMFETR) which resists all known eavesdrop attacks. A further modification of this scheme Destination First Randomized Message Forwarding with Equalized Incoming/Outgoing Traffic Rate (DFRMFETR) improves message delivery time significantly. We present security analysis and performance analysis of these two schemes. While both RMFETR and DFRMFETR have the same security benefits against eavesdrop attacks as the randomized Buses protocol, they are more flexible and easy to implement. The expected message delivery time under RMFETR is same as that under the randomized Buses, while DFRMFETR induces a smaller delivery time.
收起
摘要 :
Vast numbers of face images are posted and circulated daily on social network and photo-sharing sites. Some face images are linked to the person's name, like those on user profile pages, while others are anonymized due to privacy ...
展开
Vast numbers of face images are posted and circulated daily on social network and photo-sharing sites. Some face images are linked to the person's name, like those on user profile pages, while others are anonymized due to privacy concerns. If an anonymized face image is linked to a named one, that person's privacy is infringed. One way to overcome this privacy problem is to anonymize face images when they are posted on social networks. However, current face anonymization methods fail to meet two key requirements: being provably secure against de-anonymization and enabling users to control the trade-off between security and usability (similarity to the original face) of the anonymized face images. We are developing a similarity-based method for face anonymization that meets both requirements in those cases where a new face image of a person is to be posted when many face images including those of that person are already posted. The basic idea is to hide the new face image in s face images that are equally similar to the face image of the same person. We theoretically demonstrated that the probability of an attacker correctly linking the anonymized face image to an image of the same person is less than 1/s. We also showed theoretically and confirmed experimentally, with 150 sample face images, that the larger the s, the less usable the anonymized face image. The security of our method holds in spite of future improvements in face recognition tools.
收起
摘要 :
Vast numbers of face images are posted and circulated daily on social network and photo-sharing sites. Some face images are linked to the person's name, like those on user profile pages, while others are anonymized due to privacy ...
展开
Vast numbers of face images are posted and circulated daily on social network and photo-sharing sites. Some face images are linked to the person's name, like those on user profile pages, while others are anonymized due to privacy concerns. If an anonymized face image is linked to a named one, that person's privacy is infringed. One way to overcome this privacy problem is to anonymize face images when they are posted on social networks. However, current face anonymization methods fail to meet two key requirements: being provably secure against de-anonymization and enabling users to control the trade-off between security and usability (similarity to the original face) of the anonymized face images. We are developing a similarity-based method for face anonymization that meets both requirements in those cases where a new face image of a person is to be posted when many face images including those of that person are already posted. The basic idea is to hide the new face image in s face images that are equally similar to the face image of the same person. We theoretically demonstrated that the probability of an attacker correctly linking the anonymized face image to an image of the same person is less than 1/s. We also showed theoretically and confirmed experimentally, with 150 sample face images, that the larger the s, the less usable the anonymized face image. The security of our method holds in spite of future improvements in face recognition tools.
收起
摘要 :
Most existing anonymous networks focus on providing strong anonymity at the price of having lower bandwidth, higher latency and degraded usability. They also often anonymize only a few specific applications. In this paper, we prop...
展开
Most existing anonymous networks focus on providing strong anonymity at the price of having lower bandwidth, higher latency and degraded usability. They also often anonymize only a few specific applications. In this paper, we propose a new approach of constructing an anonymous network. The network consists of an overlay network, which provides anonymity to all applications running on top of it, and a routing protocol, which can be considered as an anonymized version of path vector routing. The protocol preserves the high performance characteristics of path vector routing and also has the added advantage of hiding the overlay network topology.
收起
摘要 :
Most existing anonymous networks focus on providing strong anonymity at the price of having lower bandwidth, higher latency and degraded usability. They also often anonymize only a few specific applications. In this paper, we prop...
展开
Most existing anonymous networks focus on providing strong anonymity at the price of having lower bandwidth, higher latency and degraded usability. They also often anonymize only a few specific applications. In this paper, we propose a new approach of constructing an anonymous network. The network consists of an overlay network, which provides anonymity to all applications running on top of it, and a routing protocol, which can be considered as an anonymized version of path vector routing. The protocol preserves the high performance characteristics of path vector routing and also has the added advantage of hiding the overlay network topology.
收起
摘要 :
Most existing anonymous networks focus on providing strong anonymity at the price of having lower bandwidth, higher latency and degraded usability. They also often anonymize only a few specific applications. In this paper, we prop...
展开
Most existing anonymous networks focus on providing strong anonymity at the price of having lower bandwidth, higher latency and degraded usability. They also often anonymize only a few specific applications. In this paper, we propose a new approach of constructing an anonymous network. The network consists of an overlay network, which provides anonymity to all applications running on top of it, and a routing protocol, which can be considered as an anonymized version of path vector routing. The protocol preserves the high performance characteristics of path vector routing and also has the added advantage of hiding the overlay network topology.
收起
摘要 :
Privacy issues have been a serious concern for 802.11 Wireless LAN users. As demonstrated by Pang et al. [1] and Xu et al. [2], applying pseudonym techniques does not completely protect users' privacy. In particular, users' identi...
展开
Privacy issues have been a serious concern for 802.11 Wireless LAN users. As demonstrated by Pang et al. [1] and Xu et al. [2], applying pseudonym techniques does not completely protect users' privacy. In particular, users' identities can be disclosed through implicit identifiers such as the IP addresses and port numbers users often access. In this paper, we study how to improve user anonymity even if implicit identifiers based identifi-cation is applied. The basic idea of our approach is to artificially generate bogus data and inject them into original traffic, and thus users' behavior patterns are disturbed. Specifically, we propose eight different methods to generate bogus data, where each of them applies different algorithms and metrics to generate bogus packets. Our simulation results with SIGCOMM 2004 wireless trace demonstrate that our anonymization methods can decrease user identification rates, and hence improve user anonymity.
收起
原文获取