RUcore: Rutgers University Community Repository
Privacy in emerging wireless networks
Descriptive
TitleInfo
(displayLabel = Citation Title);
(type = uniform)
Title
Privacy in emerging wireless networks
Name
(ID = NAME001);
(type = personal)
NamePart
(type = family)
Kamat
NamePart
(type = given)
Pandurang
DisplayForm
Pandurang Kamat
Role
RoleTerm
(authority = RULIB)
author
Name
(ID = NAME002);
(type = personal)
NamePart
(type = family)
Trappe
NamePart
(type = given)
Wade
Affiliation
Advisory Committee
DisplayForm
Wade Trappe
Role
RoleTerm
(authority = RULIB)
chair
Name
(ID = NAME003);
(type = personal)
NamePart
(type = family)
Martin
NamePart
(type = given)
Richard
Affiliation
Advisory Committee
DisplayForm
Richard Martin
Role
RoleTerm
(authority = RULIB)
internal member
Name
(ID = NAME004);
(type = personal)
NamePart
(type = family)
Minsky
NamePart
(type = given)
Naftaly
Affiliation
Advisory Committee
DisplayForm
Naftaly Minsky
Role
RoleTerm
(authority = RULIB)
internal member
Name
(ID = NAME005);
(type = personal)
NamePart
(type = family)
Rajagopalan
NamePart
(type = given)
Siva
Affiliation
Advisory Committee
DisplayForm
Siva Raj Rajagopalan
Role
RoleTerm
(authority = RULIB)
outside member
Name
(ID = NAME006);
(type = corporate)
NamePart
Rutgers University
Role
RoleTerm
(authority = RULIB)
degree grantor
Name
(ID = NAME007);
(type = corporate)
NamePart
Graduate School - New Brunswick
Role
RoleTerm
(authority = RULIB)
school
TypeOfResource
Text
Genre
(authority = marcgt)
theses
OriginInfo
DateCreated
(qualifier = exact)
2007
DateOther
(qualifier = exact);
(type = degree)
2007
Language
LanguageTerm
English
PhysicalDescription
Form
(authority = marcform)
electronic
InternetMediaType
application/pdf
InternetMediaType
text/xml
Extent
xiii, 120 pages
Abstract
Ad hoc wireless networks have emerged as a solution to providing ubiquitous, on-demand connectivity without the need for significant infrastructure deployment. In this thesis we address the privacy problems in two types of emerging wireless ad hoc networks, namely sensor and vehicular networks.
Although the content of sensor messages describing ``events of interest'' may be encrypted to provide confidentiality, the context surrounding these events may also be sensitive and therefore should be protected from eavesdroppers. The source-location privacy problem occurs in sensor networks when adversaries use RF localization
techniques to perform hop-by-hop traceback of messages to the source sensor's location. Our work provides a formal model for this problem
and examines the privacy characteristics of different sensor routing protocols. In order to provide efficient and private sensor communications, we devise new techniques to enhance source-location privacy that augment these routing protocols.
Similarly, an adversary armed with knowledge of the network deployment, routing algorithms, and the data sink location can infer the temporal patterns and track the spatio-temporal evolution of a sensed event, by monitoring the packet arrivals at the sink. We introduce the temporal privacy problem for delay-tolerant sensor
networks, provide an information theoretic formulation and propose adaptive buffering to obfuscate temporal information from the adversary.
Sensor networks are also characterized by distinctive traffic patterns, wherein traffic mostly exists when events of interests occur. Due to the direct correlation between the type of event and
size of data generated by it, an adversary observing a traffic burst can infer information about the type of event simply from the observed message size. We formulate this traffic privacy problem in terms of information entropy, present a quantifiable means to measure traffic privacy and propose solutions to enhance it.
Vehicular ad hoc networks represent a promising new communication paradigm that can facilitate many new forms of automotive applications. We present a robust and efficient security and privacy
framework, for such networks, that uses identity-based cryptography. We show that our framework provides authentication, confidentiality, non-repudiation and message-integrity. Further, it supports scalable, user-customizable privacy through short-lived,
unforgeable, pseudonyms.
Although the content of sensor messages describing ``events of interest'' may be encrypted to provide confidentiality, the context surrounding these events may also be sensitive and therefore should be protected from eavesdroppers. The source-location privacy problem occurs in sensor networks when adversaries use RF localization
techniques to perform hop-by-hop traceback of messages to the source sensor's location. Our work provides a formal model for this problem
and examines the privacy characteristics of different sensor routing protocols. In order to provide efficient and private sensor communications, we devise new techniques to enhance source-location privacy that augment these routing protocols.
Similarly, an adversary armed with knowledge of the network deployment, routing algorithms, and the data sink location can infer the temporal patterns and track the spatio-temporal evolution of a sensed event, by monitoring the packet arrivals at the sink. We introduce the temporal privacy problem for delay-tolerant sensor
networks, provide an information theoretic formulation and propose adaptive buffering to obfuscate temporal information from the adversary.
Sensor networks are also characterized by distinctive traffic patterns, wherein traffic mostly exists when events of interests occur. Due to the direct correlation between the type of event and
size of data generated by it, an adversary observing a traffic burst can infer information about the type of event simply from the observed message size. We formulate this traffic privacy problem in terms of information entropy, present a quantifiable means to measure traffic privacy and propose solutions to enhance it.
Vehicular ad hoc networks represent a promising new communication paradigm that can facilitate many new forms of automotive applications. We present a robust and efficient security and privacy
framework, for such networks, that uses identity-based cryptography. We show that our framework provides authentication, confidentiality, non-repudiation and message-integrity. Further, it supports scalable, user-customizable privacy through short-lived,
unforgeable, pseudonyms.
Note
(type = degree)
Ph.D.
Note
(type = bibliography)
Includes bibliographical references (p. 114-118).
Subject
(ID = SUBJ1);
(authority = RUETD)
Topic
Computer Science
Subject
(ID = SUBJ2);
(authority = ETD-LCSH)
Topic
Wireless communication systems
Subject
(ID = SUBJ3);
(authority = ETD-LCSH)
Topic
Privacy, Right of
RelatedItem
(type = host)
TitleInfo
Title
Graduate School - New Brunswick Electronic Theses and Dissertations
Identifier
(type = local)
rucore19991600001
Identifier
(type = hdl)
http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.16405
Identifier
ETD_452
Location
PhysicalLocation
(authority = marcorg);
(displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Identifier
(type = doi)
doi:10.7282/T35B02WK
Genre
(authority = ExL-Esploro)
ETD doctoral
Back to the top
Rights
RightsDeclaration
(AUTHORITY = GS);
(ID = rulibRdec0006)
The author owns the copyright to this work.
Copyright
Status
Copyright protected
Availability
Status
Open
AssociatedEntity
(AUTHORITY = rulib);
(ID = 1)
Name
Pandurang Kamat
Role
Copyright holder
Affiliation
Rutgers University. Graduate School - New Brunswick
RightsEvent
(AUTHORITY = rulib);
(ID = 1)
Type
Permission or license
Detail
Non-exclusive ETD license
AssociatedObject
(AUTHORITY = rulib);
(ID = 1)
Type
License
Name
Author Agreement License
Detail
I hereby grant to the Rutgers University Libraries and to my school the non-exclusive right to archive, reproduce and distribute my thesis or dissertation, in whole or in part, and/or my abstract, in whole or in part, in and from an electronic format, subject to the release date subsequently stipulated in this submittal form and approved by my school. I represent and stipulate that the thesis or dissertation and its abstract are my original work, that they do not infringe or violate any rights of others, and that I make these grants as the sole owner of the rights to my thesis or dissertation and its abstract. I represent that I have obtained written permissions, when necessary, from the owner(s) of each third party copyrighted matter to be included in my thesis or dissertation and will supply copies of such upon request by my school. I acknowledge that RU ETD and my school will not distribute my thesis or dissertation or its abstract if, in their reasonable judgment, they believe all such rights have not been secured. I acknowledge that I retain ownership rights to the copyright of my work. I also retain the right to use all or part of this thesis or dissertation in future works, such as articles or books.
Back to the top
Technical
Format
(TYPE = mime);
(VERSION = )
application/x-tar
FileSize
(UNIT = bytes)
832000
Checksum
(METHOD = SHA1)
e16a588ab5292a21397b4afbcf45497f438c32cb
ContentModel
ETD
CompressionScheme
other
OperatingSystem
(VERSION = 5.1)
windows xp
Format
(TYPE = mime);
(VERSION = NULL)
application/x-tar
Back to the top
Statistical Profile