Abstract. Location privacy is of utmost concern for location-based services. It is the property that a person's location is revealed to other entities, such as a service provider or the person's friends, only if this release is strictly necessary and authorized by the person. We study how to achieve location privacy for a service that alerts people of nearby friends. Here, location privacy guarantees that users of the service can learn a friend's location if and only if the friend is actually nearby. We introduce three protocols-Louis, Lester and Pierre-that provide location privacy for such a service. The key advantage of our protocols is that they are distributed and do not require a separate service provider that is aware of people's locations. The evaluation of our sample implementation demonstrates that the protocols are sufficiently fast to be practical.
Eight (Z)-isomers of lycopene were prepared by stereocontrolled syntheses and fully characterized by '€1-NMR, "C-NMR, mass, and UVjVIS spectroscopy: (5Z)-, (72)
Abstract-Social networking sites, such as MySpace, Facebook and Flickr, are gaining more and more popularity among Internet users. As users are enjoying this new style of networking, privacy concerns are also attracting increasing public attention due to reports about privacy breaches on social networking sites. We propose FaceCloak, an architecture that protects user privacy on a social networking site by shielding a user's personal information from the site and from other users that were not explicitly authorized by the user. At the same time, FaceCloak seamlessly maintains usability of the site's services. FaceCloak achieves these goals by providing fake information to the social networking site and by storing sensitive information in encrypted form on a separate server. We implemented our solution as a Firefox browser extension for the Facebook platform. Our experiments show that our solution successfully conceals a user's personal information, while allowing the user and her friends to explore Facebook pages and services as usual.
A delay tolerant network (DTN) is a store and forward network where end-to-end connectivity is not assumed and where opportunistic links between nodes are used to transfer data. An emerging application of DTNs are rural area DTNs, which provide Internet connectivity to rural areas in developing regions using conventional transportation mediums, like buses. Potential applications of these rural area DTNs are e-governance, telemedicine and citizen journalism. Therefore, security and privacy are critical for DTNs. Traditional cryptographic techniques based on PKI-certified public keys assume continuous network access, which makes these techniques inapplicable to DTNs because of their disconnected nature. We present the first anonymous communication solution for DTNs and introduce a new anonymous authentication protocol as part of it. Furthermore, we present a security infrastructure for DTNs to provide efficient secure communication. Our anonymity and security solutions are based on identity-based cryptography. We show that our solutions have better performance than previously proposed security infrastructures for DTNs. * Research supported by an NSERC PGS-D postgraduate scholarship 1. We introduce a new, IBC-based, anonymous authentication protocol and use this protocol to build the first system for providing anonymous communication in DTNs. 2. We present an IBC-based security infrastructure for DTNs that is more efficient than an existing security infrastructure for DTNs [25]. We provide an overview of DTNs and IBC in Section 2. In Section 3, we discuss related work in the area of DTN security and anonymous communication. In Section 4, we present our architecture for secure DTN communication. Section 5 describes our new anonymous authentication protocol and our anonymity architecture, which, as it turns out, can be integrated into our security architecture with no changes in the setup. This anonymity architecture forms the basis for anonymous and secure communication in DTNs, which we discuss in Section 6. Section 7 investigates system and network-related issues, like performance, routing and billing. In Appendix A, we briefly introduce bilinear pairings and the bilinear Diffie-Hellman problem. We discuss the security and anonymity provided by our anonymous authentication protocol in Appendix B. 2 Background In this section, we give a survey of DTNs and the special case of rural area DTNs. We also review an IBC scheme, namely the Sakai-Ohgishi-Kasahara key agreement protocol [24] in a Boneh-Franklin identity-based encryption setup [5]. Finally, we give an overview of hierarchical identity-based cryptography (HIBC). 2.1 Delay Tolerant Networks (DTNs) DTNs deal with communication in extreme and performance-challenged environments, where continuous end-to-end connectivity cannot be assumed. In a DTN, nodes use opportunistic connectivity over intermittent links for communication. Such opportunistic links are generally provided by mobile routers. They offer connectivity by acting as "data mules" to carry data to and fr...
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.