Change search
ReferencesLink to record
Permanent link

Direct link
On the Optimal Allocation of Adversarial Resources
(LCN)ORCID iD: 0000-0003-2624-7522
KTH, School of Electrical Engineering (EES), Communication Networks.
2012 (English)In: Mobicom'12 The 18th Annual International Conference on Mobile Computing and Networking: Proceedings of the first ACM international workshop on Mission-oriented wireless sensor networking / [ed] ACM, Association for Computing Machinery (ACM), 2012, 33-38 p.Conference paper (Refereed)
Abstract [en]

Security is important for mission-critical wireless sensor net-works (WSNs). This is especially so because powerful ad-versaries could compromise and control a significant frac-tion of the network nodes. A plethora of schemes has beendeveloped to secure wireless sensor networks and resilienceto sophisticated attacks has been analyzed. However, thequestion of how the adversary could deploy her resources tomaximally affect the attacked system has remained largelyunaddressed. This is the problem this paper is concernedwith: Given a number of compromised entities (nodes) andcryptographic keys, how can the adversary devise a close-to-optimal attack tactic? To the best of our knowledge, this isthe first investigation of its kind: while the basic adversarialbehavior is well-known, the problem of how the adversarycan optimally deploy her resources to maximize the attackimpact has not been considered for WSNs. We consideran abstract model of the mission-critical WSN and the ad-versary, and we find that the determination of an optimalattack is computationally hard, thus, we devise an efficientheuristic approach. An intelligent adversarial resource allo-cation indeed yields disproportional gains for the attacker.Our analysis is the first necessary step to comprehend howto best address vulnerabilities.

Place, publisher, year, edition, pages
Association for Computing Machinery (ACM), 2012. 33-38 p.
Keyword [en]
Adversary modeling, security analysis, resource allocation
National Category
Communication Systems
URN: urn:nbn:se:kth:diva-107756DOI: 10.1145/2348656.2348666ScopusID: 2-s2.0-84866614743ISBN: 978-1-4503-1529-6OAI: diva2:577912
Conference on Mobile Computing and Networking Istanbul, Turkey, August 26, 2012
ICT - The Next Generation

© ACM, 2012. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Mobicom'12 The 18th Annual International Conference on Mobile Computing and Networking,

QC 20130110

Available from: 2013-01-10 Created: 2012-12-17 Last updated: 2016-01-29Bibliographically approved
In thesis
1. Secure and Privacy Preserving Urban Sensing Systems
Open this publication in new window or tab >>Secure and Privacy Preserving Urban Sensing Systems
2016 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

The emergence of resource-rich mobile devices and smart vehicles has paved the way for Urban Sensing. In this new paradigm, users, leveraging their sensing-capable devices, sense their environment and become part of an unprecedented large-scale network of sensors, with extensive spatial and temporal coverage, that enables the collection and dissemination of real-time information, potentially, from anywhere, about anything and at anytime. Urban sensing will facilitate the deployment of innovative applications aiming to address the ever-growing concerns for citizens' well-being by offering a better understanding of our activities and environment.

Nevertheless, the openness of such systems (ideally anyone can participate) and the richness of the data users contribute unavoidably raise significant concerns both about the security of urban sensing applications and the privacy of the participating users. More specifically, users participating in urban sensing applications are expected to contribute sensed data tagged, in many cases, with spatio-temporal information. Misusing such information could reveal sensitive user-specific attributes including their whereabouts, health condition, and habits and lead to extensive and unsolicited user profiling. At the same time, the participation of large numbers of users possessing sensing- capable devices is a double-edged sword: devices can be compromised or faulty or users can be adversarial seeking to manipulate urban sensing systems by submitting intelligently crafted faulty information.

This thesis considers security, resilience and privacy for urban sensing notably in two application domains: intelligent transportation systems and generic smartphone based crowd-sourced sensing applications. For these domains, we design, implement and evaluate provably secure and privacy-preserving solutions capable of protecting the users from the system (i.e., ensuring their privacy in the presence of untrustworthy infrastructure) and the system from malicious users (i.e., holding them accountable for possible system-offending actions)

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2016. 48 p.
TRITA-EE, ISSN 1653-5146 ; 2016:014
National Category
Computer Systems
Research subject
Education and Communication in the Technological Sciences; Electrical Engineering
urn:nbn:se:kth:diva-181100 (URN)978-91-7595-860-6 (ISBN)
Public defence
2016-02-25, Horsal F3, Lindstedtsvägen 26, KTH, Stockholm, 13:00 (English)

QC 20160229

Available from: 2016-01-29 Created: 2016-01-28 Last updated: 2016-02-05Bibliographically approved

Open Access in DiVA

fulltext(1291 kB)83 downloads
File information
File name FULLTEXT02.pdfFile size 1291 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopusACM digital library

Search in DiVA

By author/editor
Stylianos, GisdakisPapadimitratos, Panos
By organisation
Communication Networks
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 83 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 52 hits
ReferencesLink to record
Permanent link

Direct link