 |
Anonymity & Privacy in Wireless Networks |
Minimizing privacy risk is one of the major problems in the development of social media and hand-held smart phone technologies, vehicle ad hoc networks, and wireless sensor networks. These research articles were presented in 2014.
Kazemi, M.; Azmi, R., "Privacy Preserving And Anonymity In Multi Sinks Wireless Sensor Networks With Master Sink," Computing, Communication and Networking Technologies (ICCCNT), 2014 International Conference on, pp. 1,7, 11-13 July 2014. doi: 10.1109/ICCCNT.2014.6963107
Abstract: The wireless network is become larger than past. So in the recent years the wireless with multiple sinks is more useful. The anonymity and privacy in this network is a challenge now. In this paper, we propose a new method for anonymity in multi sink wireless sensor network. In this method we use layer encryption to provide source and event privacy and we use a label switching routing method to provide sink anonymity in each cluster. A master sink that is a powerful base station is used to connect sinks to each other.
Keywords: telecommunication network routing; telecommunication security; wireless sensor networks; layer encryption; master sink; multisinks wireless sensor networks; powerful base station; privacy anonymity; privacy preserving; sink anonymity; switching routing method; Encryption; Network topology; Privacy; Protocols; Wireless sensor networks; Anonymity; Label switching; Layer encryption; Multi sinks; Privacy (ID#:15-3954)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6963107&isnumber=6962988
Shinganjude, R.D.; Theng, D.P., "Inspecting the Ways of Source Anonymity in Wireless Sensor Network," Communication Systems and Network Technologies (CSNT), 2014 Fourth International Conference on, pp.705, 707, 7-9 April 2014. doi: 10.1109/CSNT.2014.148
Abstract: Sensor networks mainly deployed to monitor and report real events, and thus it is very difficult and expensive to achieve event source anonymity for it, as sensor networks are very limited in resources. Data obscurity i.e. the source anonymity problem implies that an unauthorized observer must be unable to detect the origin of events by analyzing the network traffic; this problem has emerged as an important topic in the security of wireless sensor networks. This work inspects the different approaches carried for attaining the source anonymity in wireless sensor network, with variety of techniques based on different adversarial assumptions. The approach meeting the best result in source anonymity is proposed for further improvement in the source location privacy. The paper suggests the implementation of most prominent and effective LSB Steganography technique for the improvement.
Keywords: steganography; telecommunication traffic; wireless sensor networks; LSB steganography technique; adversarial assumptions; event source anonymity; network traffic; source location privacy; wireless sensor networks; Communication systems; Wireless sensor network; anonymity; coding theory; persistent dummy traffic; statistical test; steganography (ID#:15-3955)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6821490&isnumber=6821334
Manjula, R.; Datta, R., "An Energy-Efficient Routing Technique For Privacy Preservation Of Assets Monitored With WSN," Students' Technology Symposium (TechSym), 2014 IEEE, pp.325,330, Feb. 28 2014-March 2 2014. doi: 10.1109/TechSym.2014.6808069
Abstract: Wireless Sensor Networks (WSNs) are deployed to monitor the assets (endangered species) and report the locations of these assets to the Base Station (BS) also known as Sink. The hunter (adversary) attacks the network at one or two hops away from the Sink, eavesdrops the wireless communication links and traces back to the location of the asset to capture them. The existing solutions proposed to preserve the privacy of the assets lack in energy efficiency as they rely on random walk routing technique and fake packet injection technique so as to obfuscate the hunter from locating the assets. In this paper we present an energy efficient privacy preserved routing algorithm where the event (i.e., asset) detected nodes called as source nodes report the events' location information to the Base Station using phantom source (also known as phantom node) concept and a-angle anonymity concept. Routing is done using existing greedy routing protocol. Comparison through simulations shows that our solution reduces the energy consumption and delay while maintaining the same level of privacy as that of two existing popular techniques.
Keywords: data privacy; energy conservation; routing protocols; telecommunication power management; telecommunication security; wireless sensor networks; WSN; asset monitoring; base station; endangered species monitoring; energy efficient routing technique; fake packet injection technique; phantom node; phantom source; privacy preservation; wireless sensor network; Base stations; Delays; Monitoring; Phantoms; Privacy; Routing; Routing protocols (ID#:15-3956)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6808069&isnumber=6807895
Xiaoguang Niu; Chuanbo Wei; Weijiang Feng; Qianyuan Chen, "OSAP: Optimal-Cluster-Based Source Anonymity Protocol In Delay-Sensitive Wireless Sensor Networks," Wireless Communications and Networking Conference (WCNC), 2014 IEEE, pp.2880,2885, 6-9 April 2014. doi: 10.1109/WCNC.2014.6952906
Abstract: For wireless sensor networks deployed to monitor and report real events, event source-location privacy (SLP) is a critical security property. Previous work has proposed schemes based on fake packet injection such as FitProbRate and TFS, to realize event source anonymity for sensor networks under a challenging attack model where a global attacker is able to monitor the traffic in the entire network. Although these schemes can well protect the SLP, there exists imbalance in traffic or delay. In this paper, we propose an Optimal-cluster-based Source Anonymity Protocol (OSAP), which can achieve a tradeoff between network traffic and real event report latency through adjusting the transmission rate and the radius of unequal clusters, to reduce the network traffic. The simulation results demonstrate that OSAP can significantly reduce the network traffic and the delay meets the system requirement.
Keywords: data privacy; protocols; telecommunication security; wireless sensor networks; OSAP; challenging attack model; delay sensitive wireless sensor networks; event source anonymity; event source location privacy; fake packet injection; global attacker; network traffic; optimal cluster based source anonymity protocol; real event report latency; Base stations; Delays; Mobile communication; Mobile computing; Security; Telecommunication traffic; Wireless networks; cluster-based wireless sensor network; fake packet injection; global attacker; network traffic reduction; source anonymity (ID#:15-3957)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6952906&isnumber=6951847
Chang-Ji Wang; Dong-Yuan Shi; Xi-Lei Xu, "Pseudonym-Based Cryptography and Its Application in Vehicular Ad Hoc Networks," Broadband and Wireless Computing, Communication and Applications (BWCCA), 2014 Ninth International Conference on, pp.253, 260, 8-10 Nov. 2014. doi: 10.1109/BWCCA.2014.72
Abstract: As the cornerstone of the future intelligent transportation system, vehicular ad hoc networks (VANETs) have attracted intensive attention from the academic and industrial research communities in recent years. For widespread deployment of VANETs, security and privacy issues must be addressed properly. In this paper, we introduce the notion of pseudonym-based cryptography, and present a provable secure pseudonym-based cryptosystems with a trusted authority that includes a pseudonym-based multi-receiver encryption scheme, a pseudonym-based signature scheme, and a pseudonym-based key establishment protocol. We then propose a secure and efficient data access scheme for VANETs based on cooperative caching technology and our proposed pseudonym-based cryptosystems. On the one hand, the efficiency of data access are greatly improved by allowing the sharing and coordination of cached data among multiple vehicles. On the other hand, anonymity of the vehicles, data confidentiality, integrity and non-repudiation are guaranteed by employing our proposed pseudonym-based cryptosystems. Simulation results have shown that our proposed pseudonym-based cryptosystems are suitable to the VANETs environment.
Keywords: cryptographic protocols; vehicular ad hoc networks; VANET; cooperative caching technology; data access scheme; provable secure pseudonym-based cryptosystems; pseudonym-based key establishment protocol; pseudonym-based multi-receiver encryption scheme; trusted authority; vehicular ad hoc networks; Encryption; Privacy; Protocols; Vehicles; Vehicular ad hoc networks; cooperative caching; onion packet; pseudonym-based key establishment protocol; pseudonym-based multi-receiver encryption scheme; pseudonym-based signature scheme; vehicular ad-hoc networks (ID#:15-3958)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7016077&isnumber=7015998
Shahare, P.C.; Chavhan, N.A., "An Approach to Secure Sink Node's Location Privacy in Wireless Sensor Networks," Communication Systems and Network Technologies (CSNT), 2014 Fourth International Conference on, pp.748,751, 7-9 April 2014. doi: 10.1109/CSNT.2014.157
Abstract: Wireless Sensor Network has a wide range of applications including environmental monitoring and data gathering in hostile environments. This kind of network is easily leaned to different external and internal attacks because of its open nature. Sink node is a receiving and collection point that gathers data from the sensor nodes present in the network. Thus, it forms bridge between sensors and the user. A complete sensor network can be made useless if this sink node is attacked. To ensure continuous usage, it is very important to preserve the location privacy of sink nodes. A very good approach for securing location privacy of sink node is proposed in this paper. The proposed scheme tries to modify the traditional Blast technique by adding shortest path algorithm and an efficient clustering mechanism in the network and tries to minimize the energy consumption and packet delay.
Keywords: delays; power consumption; wireless sensor networks; Blast technique; clustering mechanism; continuous usage; data gathering; energy consumption; environmental monitoring; external attacks; hostile environments; internal attacks; location privacy; packet delay; secure sink node; shortest path algorithm; wireless sensor networks; Base stations; Clustering algorithms; Computer science; Privacy; Receivers; Security; Wireless sensor networks; Anonymity; Sink node location privacy; Wireless sensor network (ID#:15-3959)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6821499&isnumber=6821334
Tomandl, A.; Herrmann, D.; Fuchs, K.-P.; Federrath, H.; Scheuer, F., "VANETsim: An Open Source Simulator For Security And Privacy Concepts In VANETs," High Performance Computing & Simulation (HPCS), 2014 International Conference on, pp.543,550, 21-25 July 2014. doi: 10.1109/HPCSim.2014.6903733
Abstract: Aside from massive advantages in safety and convenience on the road, Vehicular Ad Hoc Networks (VANETs) introduce security risks to the users. Proposals of new security concepts to counter these risks are challenging to verify because of missing real world implementations of VANETs. To fill this gap, we introduce VANETsim, an event-driven simulation platform, specifically designed to investigate application-level privacy and security implications in vehicular communications. VANETsim focuses on realistic vehicular movement on real road networks and communication between the moving nodes. A powerful graphical user interface and an experimentation environment supports the user when setting up or carrying out experiments.
Keywords: data privacy; discrete event simulation; graphical user interfaces; mobile computing; public domain software; vehicular ad hoc networks; VANETsim; application-level privacy implications; application-level security implications; event-driven simulation platform; graphical user interface; open source simulator; road safety; vehicular ad hoc networks; vehicular communications; Analytical models ;Graphical user interfaces; Privacy; Roads; Security; Vehicles; Vehicular ad hoc networks; Anonymity; Car2Car;Intrusion and Attack Detection; Privacy; Privacy-Enhancing Technology; Security; Security in Mobile and Wireless Networks; Simulator; VANET; Vehicular Communication (ID#:15-3960)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6903733&isnumber=6903651
Ward, J.R.; Younis, M., "A Metric for Evaluating Base Station Anonymity in Acknowledgement-Based Wireless Sensor Networks," Military Communications Conference (MILCOM), 2014 IEEE, pp. 216, 221, 6-8 Oct. 2014. doi: 10.1109/MILCOM.2014.41
Abstract: In recent years, Wireless Sensor Networks (WSNs) have become valuable assets to both the commercial and military communities with applications ranging from industrial automation and product tracking to intrusion detection at a hostile border. A typical WSN topology allows sensors to act as data sources that forward their measurements to a central sink or base station (BS). The unique role of the BS makes it a natural target for an adversary that desires to achieve the most impactful attack possible against a WSN. An adversary may employ traffic analysis techniques to identify the BS based on network traffic flow even when the WSN implements conventional security mechanisms. This motivates a need for WSN operators to achieve improved BS anonymity to protect the identity, role, and location of the BS. Although a variety of countermeasures have been proposed to improve BS anonymity, those techniques are typically evaluated based on a WSN that does not employ acknowledgements. In this paper we propose an enhanced evidence theory metric called Acknowledgement-Aware Evidence Theory (AAET) that more accurately characterizes BS anonymity in WSNs employing acknowledgements. We demonstrate AAET's improved robustness to a variety of configurations through simulation.
Keywords: telecommunication security; telecommunication traffic; wireless sensor networks; WSN topology; acknowledgement aware evidence theory; acknowledgement based wireless sensor networks; base station anonymity; enhanced evidence theory metric; network traffic flow; traffic analysis technique; Correlation; Measurement; Media Access Protocol; Sensors; Standards; Wireless sensor networks; acknowledged communication ;anonymity; location privacy; wireless sensor network (ID#:15-3961)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6956762&isnumber=6956719
Tomandl, A.; Herrmann, D.; Federrath, H., "PADAVAN: Privacy-Aware Data Accumulation for Vehicular Ad-hoc Networks," Wireless and Mobile Computing, Networking and Communications (WiMob), 2014 IEEE 10th International Conference onpp.487, 493, 8-10 Oct. 2014. doi: 10.1109/WiMOB.2014.6962215
Abstract: In this paper we introduce PADAVAN, a novel anonymous data collection scheme for Vehicular Ad Hoc Networks (VANETs). PADAVAN allows users to submit data anonymously to a data consumer while preventing adversaries from submitting large amounts of bogus data. PADAVAN is comprised of an n-times anonymous authentication scheme, mix cascades and various principles to protect the privacy of the submitted data itself. Furthermore, we evaluate the effectiveness of limiting an adversary to a fixed amount of messages.
Keywords: data privacy; telecommunication security; vehicular ad hoc networks; PADAVAN; VANET; anonymous authentication scheme; anonymous data collection scheme; data consumer; privacy-aware data accumulation; submitted data privacy protection; vehicular ad-hoc networks; Authentication; Data collection; Data privacy; Junctions; Privacy; Sensors; Vehicles; Anonymity; Data Collection; Privacy; Security; VANET; Vehicular Communication (ID#:15-3962)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6962215&isnumber=6962120
Shin-Ming Cheng; Cheng-Han Ho; Shannon Chen; Shih-Hao Chang, "Distributed Anonymous Authentication In Heterogeneous Networks," Wireless Communications and Mobile Computing Conference (IWCMC), 2014 International, pp.505,510, 4-8 Aug. 2014. doi: 10.1109/IWCMC.2014.6906408
Abstract: Nowadays, the design of a secure access authentication protocol in heterogeneous networks achieving seamless roaming across radio access technologies for mobile users (MUs) is a major technical challenge. This paper proposes a Distributed Anonymous Authentication (DAA) protocol to resolve the problems of heavy signaling overheads and long signaling delay when authentication is executed in a centralized manner. By applying MUs and point of attachments (PoAs) as group members, the adopted group signature algorithms provide identity verification directly without sharing secrets in advance, which significantly reduces signaling overheads. Moreover, MUs sign messages on behalf of the group, so that anonymity and unlinkability against PoAs are provided and thus privacy is preserved. Performance analysis confirm the advantages of DAA over existing solutions.
Keywords: message authentication; next generation networks; protocols; radio access networks; telecommunication security; telecommunication signaling; DAA protocol; adopted group signature algorithms; distributed anonymous authentication protocol; group members; heterogeneous networks; identity verification; mobile users; radio access technologies; seamless roaming; secure access authentication protocol; signaling delay; signaling overheads; Educational institutions; Handover; anonymous authentication; group signature; heterogeneous networks (ID#:15-3963)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6906408&isnumber=6906315
Ding Wang; Ping Wang; Jing Liu, "Improved Privacy-Preserving Authentication Scheme For Roaming Service In Mobile Networks," Wireless Communications and Networking Conference (WCNC), 2014 IEEE, pp.3136,3141, 6-9 April 2014. doi: 10.1109/WCNC.2014.6953015
Abstract: User authentication is an important security mechanism that allows mobile users to be granted access to roaming service offered by the foreign agent with assistance of the home agent in mobile networks. While security-related issues have been well studied, how to preserve user privacy in this type of protocols still remains an open problem. In this paper, we revisit the privacy-preserving two-factor authentication scheme presented by Li et al. at WCNC 2013. We show that, despite being armed with a formal security proof, this scheme actually cannot achieve the claimed feature of user anonymity and is insecure against offline password guessing attacks, and thus, it is not recommended for practical applications. Then, we figure out how to fix these identified drawbacks, and suggest an enhanced scheme with better security and reasonable efficiency. Further, we conjecture that under the non-tamper-resistant assumption of the smart cards, only symmetric-key techniques are intrinsically insufficient to attain user anonymity.
Keywords: cryptography; message authentication; mobile radio; telecommunication security; improved privacy-preserving two-factor authentication scheme; mobile networks; mobile users nontamper-resistant assumption; offline password guessing attacks ;roaming service; security mechanism; security-related issues; smart cards; symmetric-key techniques; user anonymity; user authentication; Authentication; Mobile communication; Mobile computing; Protocols; Roaming; Smart cards; Mobile networks; Password authentication; Roaming service; Smart card; User anonymity (ID#:15-3964)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6953015&isnumber=6951847
Jagdale, B.N.; Bakal, J.W., "Synergetic Cloaking Technique In Wireless Network For Location Privacy," Industrial and Information Systems (ICIIS), 2014 9th International Conference on, pp.1, 6, 15-17 Dec. 2014. doi: 10.1109/ICIINFS.2014.7036480
Abstract: Mobile users access location services from a location based server. While doing so, the user's privacy is at risk. The server has access to all details about the user. Example the recently visited places, the type of information he accesses. We have presented synergetic technique to safeguard location privacy of users accessing location-based services via mobile devices. Mobile devices have a capability to form ad-hoc networks to hide a user's identity and position. The user who requires the service is the query originator and who requests the service on behalf of query originator is the query sender. The query originator selects the query sender with equal probability which leads to anonymity in the network. The location revealed to the location service provider is a rectangle instead of exact co-ordinate. In this paper we have simulated the mobile network and shown the results for cloaking area sizes and performance against the variation in the density of users.
Keywords: data privacy; mobile ad hoc networks; mobility management (mobile radio);probability; telecommunication security; telecommunication services; ad-hoc networks; cloaking area sizes;location based server; location privacy; location service provider ;location-based services;mobile devices;mobile network; mobile users; query originator; query sender; synergetic cloaking technique;user privacy; wireless network; Ad hoc networks; Cryptography; Databases; Educational institutions; Mobile communication; Privacy ;Servers; Cloaking; Collaboration; Location Privacy; Mobile Networks; Performance (ID#:15-3965)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7036480&isnumber=7036459
Ming Chen; Wenzhong Li; Zhuo Li; Sanglu Lu; Daoxu Chen, "Preserving Location Privacy Based On Distributed Cache Pushing," Wireless Communications and Networking Conference (WCNC), 2014 IEEE, pp.3456,3461, 6-9 April 2014. doi: 10.1109/WCNC.2014.6953141
Abstract: Location privacy preservation has become an important issue in providing location based services (LBSs). When the mobile users report their locations to the LBS server or the third-party servers, they risk the leak of their location information if such servers are compromised. To address this issue, we propose a Location Privacy Preservation Scheme (LPPS) based on distributed cache pushing which is based on Markov Chain. The LPPS deploys distributed cache proxies in the most frequently visited areas to store the most popular location-related data and pushes them to mobile users passing by. In the way that the mobile users receive the popular location-related data from the cache proxies without reporting their real locations, the users' location privacy is well preserved, which is shown to achieve k-anonymity. Extensive experiments illustrate that the proposed LPPS achieve decent service coverage ratio and cache hit ratio with low communication overhead.
Keywords: Markov processes; cache storage; data privacy; mobile computing; mobility management (mobile radio);Markov chain; distributed cache pushing ;location based service; location privacy; location privacy preservation scheme; mobile users; Computer architecture; Distributed databases; Markov processes; Mobile communication; Privacy; Servers; Trajectory (ID#:15-3970)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6953141&isnumber=6951847
Ward, J.R.; Younis, M., "Examining the Effect of Wireless Sensor Network Synchronization on Base Station Anonymity," Military Communications Conference (MILCOM), 2014 IEEE, pp.204,209, 6-8 Oct. 2014. doi: 10.1109/MILCOM.2014.39
Abstract: In recent years, Wireless Sensor Networks (WSNs) have become valuable assets to both the commercial and military communities with applications ranging from industrial control on a factory floor to reconnaissance of a hostile border. A typical WSN topology that applies to most applications allows sensors to act as data sources that forward their measurements to a central sink or base station (BS). The unique role of the BS makes it a natural target for an adversary that desires to achieve the most impactful attack possible against a WSN. An adversary may employ traffic analysis techniques such as evidence theory to identify the BS based on network traffic flow even when the WSN implements conventional security mechanisms. This motivates a need for WSN operators to achieve improved BS anonymity to protect the identity, role, and location of the BS. Many traffic analysis countermeasures have been proposed in literature, but are typically evaluated based on data traffic only, without considering the effects of network synchronization on anonymity performance. In this paper we use evidence theory analysis to examine the effects of WSN synchronization on BS anonymity by studying two commonly used protocols, Reference Broadcast Synchronization (RBS) and Timing-synch Protocol for Sensor Networks (TPSN).
Keywords: protocols; synchronisation; telecommunication network topology; telecommunication security; telecommunication traffic; wireless sensor networks; BS anonymity improvement; RBS; TPSN; WSN topology; base station anonymity; data sources; evidence theory analysis; network traffic flow; reference broadcast synchronization; security mechanisms; timing-synch protocol for sensor networks; traffic analysis techniques; wireless sensor network synchronization; Protocols; Receivers; Sensors; Synchronization; Wireless communication; Wireless sensor networks; RBS; TPSN; anonymity; location privacy; synchronization; wireless sensor network (ID#:15-3971)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6956760&isnumber=6956719
Banerjee, D.; Bo Dong; Biswas, S.; Taghizadeh, M., "Privacy-Preserving Channel Access Using Blindfolded Packet Transmissions," Communication Systems and Networks (COMSNETS), 2014 Sixth International Conference on, pp.1,8, 6-10 Jan. 2014. doi: 10.1109/COMSNETS.2014.6734887
Abstract: This paper proposes a novel wireless MAC-layer approach towards achieving channel access anonymity. Nodes autonomously select periodic TDMA-like time-slots for channel access by employing a novel channel sensing strategy, and they do so without explicitly sharing any identity information with other nodes in the network. An add-on hardware module for the proposed channel sensing has been developed and the proposed protocol has been implemented in Tinyos-2.x. Extensive evaluation has been done on a test-bed consisting of Mica2 hardware, where we have studied the protocol's functionality and convergence characteristics. The functionality results collected at a sniffer node using RSSI traces validate the syntax and semantics of the protocol. Experimentally evaluated convergence characteristics from the Tinyos test-bed were also found to be satisfactory.
Keywords: data privacy; time division multiple access; wireless channels; wireless sensor networks;Mica2 hardware;RSSI;Tinyos-2x test-bed implementation; add-on hardware module; blindfolded packet transmission; channel sensing strategy; periodic TDMA-Iike time-slot; privacy-preserving channel access anonymity; protocol; wireless MAC-layer approach; Convergence; Cryptography;Equations;Google;Heating;Interference;Noise;Anonymity;MAC protocols; Privacy; TDMA (ID#:15-3972)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6734887&isnumber=6734849
Umam, E.G.; Sriramb, E.G., "Robust Encryption Algorithm Based SHT In Wireless Sensor Networks," Information Communication and Embedded Systems (ICICES), 2014 International Conference on, pp.1,5, 27-28 Feb. 2014. doi: 10.1109/ICICES.2014.7034145
Abstract: In bound applications, the locations of events reportable by a device network have to be compelled to stay anonymous. That is, unauthorized observers should be unable to notice the origin of such events by analyzing the network traffic. The authors analyze 2 forms of downsides: Communication overhead and machine load problem. During this paper, the authors give a new framework for modeling, analyzing, and evaluating obscurity in device networks. The novelty of the proposed framework is twofold: initial, it introduces the notion of "interval indistinguishability" and provides a quantitative live to model obscurity in wireless device networks; second, it maps supply obscurity to the applied mathematics downside the authors showed that the present approaches for coming up with statistically anonymous systems introduce correlation in real intervals whereas faux area unit unrelated. The authors show however mapping supply obscurity to consecutive hypothesis testing with nuisance Parameters ends up in changing the matter of exposing non-public supply data into checking out associate degree applicable knowledge transformation that removes or minimize the impact of the nuisance data victimization sturdy cryptography algorithmic rule. By doing therefore, the authors remodeled the matter of analyzing real valued sample points to binary codes, that opens the door for committal to writing theory to be incorporated into the study of anonymous networks. In existing work, unable to notice unauthorized observer in network traffic. However this work in the main supported enhances their supply obscurity against correlation check, the most goal of supply location privacy is to cover the existence of real events.
Keywords: cryptography; wireless sensor networks; SHT; communication overhead; device network obscurity; hypothesis testing; Interval indistinguishability; location privacy; machine load problem; network traffic; nuisance data victimization sturdy cryptography algorithmic rule; robust encryption algorithm; wireless device network; wireless sensor networks; Computer hacking; Correlation; Encryption; Privacy; Telecommunication traffic; Testing; Wireless sensor networks; anonymity; consecutive hypothesis testing; nuisance parameters and committal to writing theory; privacy; sturdy cryptography algorithmic rule; supply location (ID#:15-3973)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7034145&isnumber=7033740
Vijayan, A.; Thomas, T., "Anonymity, Unlinkability And Unobservability In Mobile Ad Hoc Networks," Communications and Signal Processing (ICCSP), 2014 International Conference on, pp. 1880, 1884, 3-5 April 2014.
doi: 10.1109/ICCSP.2014.6950171
Abstract: Mobile ad hoc networks have the features of open medium, dynamic topology, cooperative algorithms, lack of centralized monitoring etc. Due to these, mobile ad hoc networks are much vulnerable to security attacks when compared to wired networks. There are various routing protocols that have been developed to cope up with the limitations imposed by the ad hoc networks. But none of these routing schemes provide complete unlinkability and unobservability. In this paper we have done a survey about anonymous routing and secure communications in mobile ad hoc networks. Different routing protocols are analyzed based on public/private key pairs and cryptosystems, within that USOR can well protect user privacy against both inside and outside attackers. It is a combination of group signature scheme and ID based encryption scheme. These are run during the route discovery process. We implement USOR on ns2, and then its performance is compared with AODV.
Keywords: cooperative communication; mobile ad hoc networks; private key cryptography; public key cryptography; routing protocols; telecommunication network topology; telecommunication security; AODV; ID based encryption scheme; USOR; anonymous routing; centralized monitoring; cooperative algorithms; cryptosystems; dynamic topology; group signature scheme; mobile ad hoc networks; ns2;public-private key pairs; route discovery process; routing protocols; routing schemes; secure communications; security attacks; user privacy; wired networks; Ad hoc networks; Communication system security; Cryptography; Routing; Routing protocols; Wireless communication; Anonymity; routing protocols; security; unlinkability; unobservability (ID#:15-3974)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6950171&isnumber=6949766
Rahman, S.M.M.; Kamruzzaman, S.M.; Almogren, A.; Alelaiwi, A.; Alamri, A.; Alghamdi, A., "Anonymous and Secure Communication Protocol for Cognitive Radio Ad Hoc Networks," Multimedia (ISM), 2014 IEEE International Symposium on, pp. 393, 398, 10-12 Dec. 2014.
doi: 10.1109/ISM.2014.85
Abstract: Cognitive radio (CR) networks are becoming an increasingly important part of the wireless networking landscape due to the ever-increasing scarcity of spectrum resources throughout the world. Nowadays CR media is becoming popular wireless communication media for disaster recovery communication network. Although the operational aspects of CR are being explored vigorously, its security aspects have gained less attention to the research community. The existing research on CR network mainly focuses on the spectrum sensing and allocation, energy efficiency, high throughput, end-to-end delay and other aspect of the network technology. But, very few focuses on the security aspect and almost none focus on the secure anonymous communication in CR networks (CRNs). In this research article we would focus on secure anonymous communication in CR ad hoc networks (CRANs). We would propose a secure anonymous routing for CRANs based on pairing based cryptography which would provide source node, destination node and the location anonymity. Furthermore, the proposed research would protect different attacks those are feasible on CRANs.
Keywords: ad hoc networks; cognitive radio; cryptographic protocols; routing protocols; telecommunication security; CR ad hoc networks; CR media; CRAN; anonymous-secure communication protocol; cognitive radio ad hoc networks; destination node; disaster recovery communication network; end-to-end delay; energy efficiency; location anonymity; network throughput; operational aspect; pairing-based cryptography; secure anonymous routing; security aspect;source node; spectrum allocation; spectrum resource scarcity; spectrum sensing; wireless communication media; Ad hoc networks; Cognitive radio; Cryptography; Privacy; Protocols; Routing; anonymous routing; cognitive radio (CR) networks; pairing-based cryptography; secure communication (ID#:15-3975)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7033057&isnumber=7032934
Tianyu Zhao; Chang Chen; Lingbo Wei; Mengke Yu, "An Anonymous Payment System To Protect The Privacy Of Electric Vehicles," Wireless Communications and Signal Processing (WCSP), 2014 Sixth International Conference on, pp.1,6, 23-25 Oct. 2014.
doi: 10.1109/WCSP.2014.6992208
Abstract: Electric vehicle is the automobile that powered by electrical energy stored in batteries. Due to the frequent recharging, vehicles need to be connected to the recharging infrastructure while they are parked. This may disclose drivers' privacy, such as their location that drivers may want to keep secret. In this paper, we propose a scheme to enhance the privacy of the drivers using anonymous credential technique and Trusted Platform Module(TPM). We use anonymous credential technique to achieve the anonymity of vehicles such that drivers can anonymously and unlinkably recharge their vehicles. We add some attributes to the credential such as the type of the battery in the vehicle in case that the prices of different batteries are different. We use TPM to omit a blacklist such that the company that offer the recharging service(Energy Provider Company, EPC) does not need to conduct a double spending detection.
Keywords: battery powered vehicles; cryptography; data privacy; driver information systems; financial management; secondary cells; trusted computing; EPC; Energy Provider Company; TPM; anonymous credential technique; anonymous payment system; automobile; battery; double spending detection; driver privacy; electric vehicles; electrical energy; privacy protection; recharging infrastructure; recharging service; trusted platform module; Authentication; Batteries; Privacy; Protocols; Registers; Servers; Vehicles (ID#:15-3976)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6992208&isnumber=6992003
Wiesner, K.; Feld, S.; Dorfmeister, F.; Linnhoff-Popien, C., "Right To Silence: Establishing Map-Based Silent Zones For Participatory Sensing," Intelligent Sensors, Sensor Networks and Information Processing (ISSNIP), 2014 IEEE Ninth International Conference on, pp. 1,6, 21-24 April 2014
doi: 10.1109/ISSNIP.2014.6827657
Abstract: Participatory sensing tries to create cost-effective, large-scale sensing systems by leveraging sensors embedded in mobile devices. One major challenge in these systems is to protect the users' privacy, since users will not contribute data if their privacy is jeopardized. Especially location data needs to be protected if it is likely to reveal information about the users' identities. A common solution is the blinding out approach that creates so-called ban zones in which location data is not published. Thereby, a user's important places, e.g., her home or workplace, can be concealed. However, ban zones of a fixed size are not able to guarantee any particular level of privacy. For instance, a ban zone that is large enough to conceal a user's home in a large city might be too small in a less populated area. For this reason, we propose an approach for dynamic map-based blinding out: The boundaries of our privacy zones, called Silent Zones, are determined in such way that at least k buildings are located within this zone. Thus, our approach adapts to the habitat density and we can guarantee k-anonymity in terms of surrounding buildings. In this paper, we present two new algorithms for creating Silent Zones and evaluate their performance. Our results show that especially in worst case scenarios, i.e., in sparsely populated areas, our approach outperforms standard ban zones and guarantees the specified privacy level.
Keywords: cartography; data privacy; mobile computing; performance evaluation; security of data; wireless sensor networks; ban zones; dynamic map-based blinding out; embedded sensors; habitat density; k-anonymity; large-scale sensing systems; location data; map-based silent zones; mobile devices; mobile phones; participatory sensing; performance evaluation; privacy level; user privacy protection; Buildings; Cities and towns; Data privacy; Mobile communication; Mobile handsets; Privacy; Sensors (ID#:15-3977)
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6827657&isnumber=6827478
Note:
Articles listed on these pages have been found on publicly available internet pages and are cited with links to those pages. Some of the information included herein has been reprinted with permission from the authors or data repositories. Direct any requests via Email to news@scienceofsecurity.net for removal of the links or modifications to specific citations. Please include the ID# of the specific citation in your correspondence.