@inproceedings{RochaP:C:2017,
author = {de la Rocha, Alfonso and Papadimitratos, Panos},
booktitle = {IFIP WG 11.4 Workshop on Open Problems in Network Security (IFIP iNetSec)},
title = {{Blockchain-based Public Key Infrastructure for Inter-Domain Secure Routing}},
month = {May},
year = {2017},
address = {Rome, Italy},
doi = {},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/SBTM-blockchain-secure-routing.pdf},
comment = {},
typ = {C}
}
@inproceedings{BabaheidarianSP:C:2017,
author = {Parisa Babaheidarian and Somayeh Salimi and Panos Papadimitratos},
title = {{Preserving Confidentiality in the Gaussian Broadcast Channel using Compute-and-Forward}},
booktitle = {IEEE Conference on Information Sciences and Systems (IEEE CISS)},
pages = {1--6},
year = {2017},
month = {March},
address = {Baltimore, MD, USA},
doi = {10.1109/CISS.2017.7926077},
abstract = {We study the transmission of confidential messages across a wireless broadcast channel with K > 2 receivers and K helpers. The goal is to transmit all messages reliably to their intended receivers while keeping them confidential from the unintended receivers. We design a codebook based on nested lattice structure, cooperative jamming, lattice alignment, and i.i.d. coding. Moreover, we exploit the asymmetric compute-and-forward decoding strategy to handle finite SNR regimes. Unlike previous alignment schemes, our achievable rates are attainable at any finite SNR value. Also, we show that our scheme achieves the optimal sum secure degrees of freedom of 1 for the K-receiver Gaussian broadcast channel with K confidential messages and K helpers.},
keywords = {Gaussian channels;Gaussian distribution;broadcast channels;channel coding;cooperative communication;decoding;jamming;message authentication;wireless channels;Gaussian broadcast channel;asymmetric compute-and-forward decoding strategy;confidential message transmission;confidentiality preservation;cooperative jamming;finite SNR regime;i.i.d. coding;lattice alignment;nested lattice structure;optimal sum secure degrees of freedom;wireless broadcast channel;Decoding;Encoding;Jamming;Lattices;Receivers;Signal to noise ratio;Transmitters},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/gaussian-bcast-confidentiality.pdf},
comment = {},
typ = {C}
}
@inproceedings{DGeramiXSSP:C:2017,
author = {Majid Gerami and Ming Xiao and Somayeh Salimi and Mikael Skoglund and Panos Papadimitratos},
title = {{Optimal Secure Partial-Repair in Distributed Storage Systems}},
booktitle = {IEEE Conference on Information Sciences and Systems (IEEE CISS)},
pages = {1--5},
month = {March},
year = {2017},
address = {Baltimore, MD, USA},
doi = {10.1109/CISS.2017.7926093},
abstract = {Consider a distributed storage system where parts of the source file fragments in storage nodes are lost. We denote a storage node that lost a part of its fragments as a faulty storage node and a storage node that lost non of its fragment as a complete storage node. In a process, termed as partial repair, a set of storage nodes (among faulty and complete storage nodes) transmit repairing fragments to other faulty storage nodes to recover the lost fragments. We first investigate the optimal partial repair in which the required bandwidth for recovering the lost fragments is minimal. Next, we assume that an eavesdropper wiretaps a subset of links connecting storage nodes, and overhears a number of repairing fragments. We then study optimal secure partial-repair in which the partial-repair bandwidth is minimal and the eavesdropper obtains no information about the source file by overhearing the repairing fragments. We propose optimal secure codes for exact partial-repair in a special scenario.},
keywords = {security of data;storage management;distributed storage systems;eavesdropper wiretaps;exact partial-repair;faulty storage nodes;optimal secure codes;optimal secure partial repair bandwidth;repairing fragments;source file fragments;Bandwidth;Cloud computing;Encoding;Maintenance engineering;Peer-to-peer computing;Random variables;Security},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/optimal-secure-partial-repair.pdf},
comment = {},
typ = {C}
}
@inproceedings{JinP:C:2017,
author = {Hongyu Jin and Panos Papadimitratos},
title = {{Resilient Privacy Protection for Location-Based Services through Decentralization}},
booktitle = {{ACM} Conference on Security and Privacy in Wireless and Mobile Networks {(ACM WiSec)}},
pages = {253--258},
address = {Boston, MA, USA},
month = {July},
year = {2017},
isbn = {978-1-4503-5084-6},
doi = {10.1145/3098243.3098268},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/resilient-privacy-protection-LBS-decentralized.pdf},
comment = {},
typ = {C}
}
@inproceedings{KhodaeiMP:C:2017,
author = {Mohammad Khodaei and Andreas Messing and Panos Papadimitratos},
title = {{RHyTHM: A Randomized Hybrid Scheme To Hide in the Mobile Crowd}},
booktitle = {{IEEE} Vehicular Networking Conference {(IEEE VNC)}},
month = {November},
year = {2017},
address = {Torino, Italy},
doi = {},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/rhythm-vanet-security.pdf},
comment = {},
typ = {C}
}
@inproceedings{WieseJOPSS:C:2016,
author = {Moritz Wiese and Karl Henrik Johansson and Tobias J. Oechtering and Panos Papadimitratos and Henrik Sandberg and Mikael Skoglund},
title = {{Secure Estimation for Unstable Systems}},
booktitle = {{IEEE} Conference on Decision and Control {(IEEE CDC)}},
pages = {5059--5064},
month = {December},
year = {2016},
address = {Las Vegas, NV, USA},
abstract = {We assume that the states of an unstable dynamical system are encoded and sent to an estimator through an uncertain channel, which is a channel disturbing its inputs in a nonstochastic manner. The encoder's codeword is also fed into another uncertain channel, at whose output an eavesdropper is listening. The estimator should obtain a uniformly bounded system state estimation error, whereas the eavesdropper's information about the system states should be subject to a security constraint. We find a condition on the relation between the uncertain channel from encoder to estimator and the uncertain channel from encoder to eavesdropper which if satisfied allows for at least one of the two following security criteria to hold: The volume of the set of states possible acccording to the eavesdropper's information tends to infinity at exponential speed-by itself (strong security) or if divided by the volume of the set of states possible according to the estimator's information (weak security).},
keywords = {stability;state estimation;security constraint;strong security;uncertain channel;uniformly bounded system state estimation error;unstable dynamical system;unstable system estimation;weak security;Channel estimation;Decoding;Estimation error;Reliability;Security},
doi = {10.1109/CDC.2016.7799043},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/Secure-Estimation-Unstable-Systems.pdf},
comment = {},
typ = {C}
}
@inproceedings{BabaheidarianSP:C:2016,
author = {Parisa Babaheidarian and Somayeh Salimi and Panos Papadimitratos},
title = {{Security in the Gaussian Interference Channel: Weak and Moderately Weak Interference Regimes}},
booktitle = {{IEEE} International Symposium on Information Theory {(IEEE ISIT)}},
pages = {2434--2438},
month = {July},
year = {2016},
address = {Barcelona, Spain},
abstract = {We consider a secure communication scenario through the two-user Gaussian interference channel: each transmitter (user) has a confidential message to send reliably to its intended receiver while keeping it secret from the other receiver. Prior work investigated the performance of two different approaches for this scenario; i.i.d. Gaussian random codes and real alignment of structured codes. While the latter achieves the optimal sum secure degrees of freedom (s.d.o.f.), its extension to finite SNR regimes is challenging. In this paper, we propose a new achievability scheme for the weak and the moderately weak interference regimes, in which the reliability as well as the confidentiality of the transmitted messages are maintained at any finite SNR value. Our scheme uses lattice structure, structured jamming codewords, and lattice alignment in the encoding and the asymmetric compute-and-forward strategy in the decoding. We show that our lower bound on the sum secure rates scales linearly with log(SNR) and hence, it outperforms i.i.d. Gaussian random codes. Furthermore, we show that our achievable result is asymptotically optimal. Finally, we provide a discussion on an extension of our scheme to K > 2 users.},
keywords = {decoding;radiofrequency interference;random codes;telecommunication security;Gaussian random codes;achievability scheme;asymmetric compute-and-forward strategy;confidential message;decoding;encoding;finite SNR regimes;lattice alignment;lattice structure;moderately weak interference regimes;optimal sum secure degrees of freedom;secure communication scenario;structured codes;structured jamming codewords;sum secure rates scales;two-user Gaussian interference channel;Decoding;Interference channels;Jamming;Lattices;Receivers;Transmitters},
doi = {10.1109/ISIT.2016.7541736},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/security-gaussianCh-w-mw-interference.pdf},
comment = {},
typ = {C}
}
@inproceedings{GisdakisGP:C:2016,
author = {Stylianos Gisdakis and Thanassis Giannetsos and Panos Papadimitratos},
title = {{Android privacy C(R)ache: Reading your External Storage and Sensors for Fun and Profit}},
booktitle = {{ACM MobiHoc} Workshop on Privacy-Aware Mobile Computing (ACM PAMCO)},
pages = {1--10},
month = {July},
year = {2016},
address = {Paderborn, Germany},
doi = {10.1145/2940343.2940346},
keywords = {Android permissions, external storage, monitoring, personal data leakage, profiling},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/android-external-storage-sensors-privacy.pdf},
comment = {diva full},
typ = {C}
}
@inproceedings{JinP:C:2016,
author = {Hongyu Jin and Panos Papadimitratos},
title = {{Proactive Certificate Validation for VANETs}},
booktitle = {{IEEE} Vehicular Networking Conference {(IEEE VNC)}},
pages = {1--4},
address = {Columbus, OH, USA},
month = {December},
year = {2016},
abstract = {Security and privacy in Vehicular Ad-hoc Networks (VANETs) mandates use of short-lived credentials (pseudonyms) and cryptographic key pairs. This implies significant computational overhead for vehicles, needing to validate often numerous such pseudonyms within a short period. To alleviate such a bottleneck that could even place vehicle safety at risk, we propose a proactive pseudonym validation approach based on Bloom Filters (BFs). We show that our scheme could liberate computational resources for other (safety- and time-critical) operations with reasonable communication overhead without compromising security and privacy.},
keywords = {certification;data privacy;data structures;vehicular ad hoc networks;Bloom Filters;VANET;communication overhead;cryptographic key pairs;proactive certificate validation;proactive pseudonym validation approach;short-lived credentials;vehicle safety;vehicular ad-hoc networks;Conferences;Principal component analysis;Privacy;Radiation detectors;Security;Standards;Vehicles;Bloom Filter;Pseudonym;Security and Privacy},
doi = {10.1109/VNC.2016.7835974},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/Proactive-certificate-validation-VANETs.pdf},
comment = {},
typ = {C}
}
@inproceedings{KhodaeiP:C:2016,
author = {Khodaei, Mohammad and Papadimitratos, Panos},
title = {{Evaluating On-demand Pseudonym Acquisition Policies in Vehicular Communication Systems}},
booktitle = {{ACM MobiHoc} Workshop on Internet of Vehicles and Vehicles of Internet (ACM IoV-VoI)},
month = {July},
year = {2016},
isbn = {978-1-4503-4345-9},
address = {Paderborn, Germany},
pages = {7--12},
doi = {10.1145/2938681.2938684},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/ondemand-psedunym-acquisition-evaluation.pdf},
keywords = {access control, identity and credential management, privacy, security, vehicular PKI, vehicular communications},
typ = {C}
}
@inproceedings{WieseP:C:2016,
title = {{Frequency Hopping does not Increase Anti-Jamming Resilience of Wireless Channels}},
author = {Wiese, Moritz and Papadimitratos, Panos},
booktitle = {International Zurich Seminar on Communications (IZS)},
month = {March},
year = {2016},
address = {Zurich, Switzerland},
doi = {10.3929/ethz-a-010645203},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/conf-ver-Frequency-hopping-not-increase-anti-jamming-resilience.pdf},
comment = {},
typ = {C}
}
@inproceedings{WieseJOPSSb:C:2016,
author = {Moritz Wiese and Karl Henrik Johansson and Tobias J. Oechtering and Panos Papadimitratos and Henrik Sandberg and Mikael Skoglund},
title = {{Uncertain Wiretap Channels and Secure Estimation}},
booktitle = {{IEEE} International Symposium on Information Theory {(IEEE ISIT)}},
pages = {2004--2008},
month = {July},
year = {2016},
address = {Barcelona, Spain},
abstract = {The zero-error secrecy capacity of uncertain wiretap channels is defined. If the sensor-estimator channel is perfect, it is also calculated. Further properties are discussed. The problem of estimating a dynamical system with nonstochastic disturbances is studied where the sensor is connected to the estimator and an eavesdropper via an uncertain wiretap channel. The estimator should obtain a uniformly bounded estimation error whereas the eavesdropper's error should tend to infinity. It is proved that the system can be estimated securely if the zero-error capacity of the sensor-estimator channel is strictly larger than the logarithm of the system's unstable pole and the zero-error secrecy capacity of the uncertain wiretap channel is positive.},
keywords = {channel estimation;telecommunication security;wireless channels;eavesdroppers error;sensor-estimator channel;uncertain wiretap channels;uniformly bounded estimation error;zero-error secrecy capacity;Channel estimation;Delays;Estimation error;Receivers;Stochastic processes},
doi = {10.1109/ISIT.2016.7541650},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/UncertainWiretapChannelsSecureEstimation.pdf},
comment = {},
typ = {C}
}
@inproceedings{SalimiP:C:2016,
title = {{Pairwise Secret Key Agreement based on Location-derived Common Randomness}},
author = {Salimi, Somayeh and Papadimitratos, Panos},
booktitle = {International Zurich Seminar on Communications (IZS)},
month = {March},
year = {2016},
doi = {10.3929/ethz-a-010646726},
address = {Zurich, Switzerland},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/conf-ver-PairwiseSecretKeyAgreementLocationCommonRandomness.pdf},
comment = {},
typ = {C}
}
@incollection{JinPa:C:2015,
title = {{Resilient Collaborative Privacy for Location-Based Services}},
author = {Jin, Hongyu and Papadimitratos, Panos},
booktitle = {Nordic Conference on Secure IT Systems (NordSec)},
series = {Lecture Notes in Computer Science},
volume = {9417},
pages = {47--63},
month = {October},
year = {2015},
address = {Stockholm, Sweden},
doi = {10.1007/978-3-319-26502-5_4},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/resilient-collaborative-privacy-location-based-services.pdf},
comment = {},
typ = {C}
}
@inproceedings{BabaheidarianSP:C:2015,
author = {Parisa Babaheidarian and Somayeh Salimi and Panos Papadimitratos},
title = {{Finite-SNR Regime Analysis of the Gaussian Wiretap Multiple-Access Channel}},
booktitle = {IEEE Allerton Conference on Communication, Control, and Computing (IEEE Allerton)},
pages = {307--314},
month = {September},
year = {2015},
address = {Monticello, IL, USA},
doi = {10.1109/ALLERTON.2015.7447020},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/finiteSNR0GaussianWiretapMultipleAccessChannel.pdf},
comment = {},
typ = {C}
}
@inproceedings{SalimiJSP:C:2015,
author = {Somayeh Salimi and Eduard A. Jorswieck and Mikael Skoglund and Panos Papadimitratos},
title = {{Key Agreement over an Interference Channel with Noiseless Feedback: Achievable Region {\&} Distributed Allocation}},
booktitle = {{IEEE} Conference on Communications and Network Security {(IEEE CNS)} Physical Layer Methods for Wireless Security Workshop},
pages = {59--64},
month = {September},
year = {2015},
address = {Florence, Italy},
doi = {10.1109/CNS.2015.7346811},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/key-Agreement-Interference-channel-wFeedback.pdf},
comment = {},
typ = {C}
}
@inproceedings{JinPb:C:2015,
author = {Hongyu Jin and Panos Papadimitratos},
title = {{Scaling VANET Security through Cooperative Message Verification}},
booktitle = {{IEEE} Vehicular Networking Conference {(IEEE VNC)}},
pages = {275--278},
month = {December},
year = {2015},
address = {Kyoto, Japan},
doi = {10.1109/VNC.2015.7385588},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/scalingVANETsecurityCooperativeValidation.pdf},
comment = {},
typ = {C}
}
@inproceedings{GisdakisGP:C:2015,
author = {Stylianos Gisdakis and Thanassis Giannetsos and Panos Papadimitratos},
title = {{SHIELD: A Data Verification Framework for Participatory Sensing Systems}},
booktitle = {{ACM} Conference on Security {\&} Privacy in Wireless and Mobile Networks {(ACM WiSec)}},
pages = {16:1--16:12},
month = {June},
year = {2015},
address = {New York, NY, USA},
doi = {10.1145/2766498.2766503},
keywords = {participatory sensing, privacy, security},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/shield-data-verification-participatory-sensing-systems.pdf},
comment = {},
typ = {C}
}
@inproceedings{ZhangTP:C:2015,
title = {{Detection and Exclusion RAIM Algorithm against Spoofing/Replaying Attacks}},
author = {Zhang, Kewei and Tuhin, R. A. and Papadimitratos, Panos},
booktitle = {International Symposium on GNSS},
month = {November},
year = {2015},
organization = {Kyoto, Japan},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/},
comment = {},
typ = {C}
}
@inproceedings{ZhangP:C:2015,
title = {{GNSS Receiver Tracking Performance Analysis under Distance-Decreasing Attacks}},
author = {Zhang, K. and Papadimitratos, P.},
booktitle = {International Conference on Localization and GNSS (ICL-GNSS)},
doi = {10.1109/ICL-GNSS.2015.7217163},
month = {June},
year = {2015},
address = {Gothenburg, Sweden},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/distance-decreasing-gnss.pdf},
comment = {},
typ = {C}
}
@inproceedings{YeFGP:C:2015,
author = {Ye, Lin and Fodor, Viktoria and Giannetsos, Thanassis and Papadimitratos, Panos},
title = {{Path Metric Authentication for Low-Power and Lossy Networks}},
booktitle = {ACM International Workshop on Cyber-Physical Systems for Smart Water Networks (ACM CySWater)},
month = {April},
year = {2015},
isbn = {978-1-4503-3485-3},
address = {Seattle, WA, USA},
pages = {5:1--5:6},
doi = {10.1145/2738935.2738941},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/rpl-metric-authentication.pdf},
comment = {},
typ = {C}
}
@inproceedings{MirmohseniP:C:2014,
author = {M. Mirmohseni and P. Papadimitratos},
booktitle = {IEEE International Conference on Computer Communications (IEEE INFOCOM)},
title = {{Scaling Laws for Secrecy Capacity in Cooperative Wireless Networks}},
month = {April},
year = {2014},
volume = {},
number = {},
pages = {1527-1535},
address = {Toronto, Canada},
keywords = {Markov processes;array signal processing;cooperative communication;interference (signal);relay networks (telecommunication);telecommunication security;Wyner randomized encoder;active cooperative relaying;beamforming;cooperative wireless networks;interference limited communications;parallel relaying scheme;path loss exponent;scaling laws;secrecy capacity;secure communication;serial block Markov scheme;Aggregates;Array signal processing;Encoding;Relays;Tin;Transmitters;Wireless networks},
doi = {10.1109/INFOCOM.2014.6848088},
issn = {0743-166X},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/scaling-laws-secrecy-capacity-cooperative-networks-inf.pdf},
comment = {},
typ = {C}
}
@inproceedings{GisdakisGP:C::2014,
author = {Gisdakis, Stylianos and Giannetsos, Thanassis and Papadimitratos, Panos},
title = {{SPPEAR: Security and Privacy-preserving Architecture for Participatory-sensing Applications}},
booktitle = {ACM Conference on Security {\&} Privacy in Wireless and Mobile Networks (ACM WiSec)},
year = {2014},
isbn = {978-1-4503-2972-9},
address = {Oxford, United Kingdom},
pages = {39--50},
doi = {10.1145/2627393.2627402},
keywords = {anonymity, participatory sensing, privacy, security},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/SPPEAR-SecurityPrivacyArchitectureParticipatory-SensingApplications.pdf},
typ = {C}
}
@inproceedings{MirmohseniPd:C:2014,
title = {{On Secure Communication in Large Cooperative Wireless Networks}},
author = {Mirmohseni, Mahtab and Papadimitratos, Panos},
booktitle = {Systems and Networks Optimization for Wireless (SNOW) Workshop},
month = {April},
year = {2014},
address = {Are, Sweden},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/Mirmohseni_Papadimitratos_SNOW14.pdf},
typ = {C}
}
@inproceedings{KhodaeiP:C:2014,
title = {{Towards Deploying a Scalable \& Robust Vehicular Identity and Credential Management Infrastructure}},
author = {Khodaei, Mohammad and Jin, Hongyu and Papadimitratos, Panos},
booktitle = {IEEE Vehicular Networking Conference (IEEE VNC)},
pages = {33--40},
month = {December},
year = {2014},
address = {Paderborn, Germany},
abstract = {Several years of academic and industrial research efforts have converged to a common understanding on fundamental security building blocks for the upcoming Vehicular Communication (VC) systems. There is a growing consensus towards deploying a Vehicular Public-Key Infrastructure (VPKI) enables pseudonymous authentication, with standardization efforts in that direction. However, there are still significant technical issues that remain unresolved. Existing proposals for instantiating the VPKI either need additional detailed specifications or enhanced security and privacy features. Equally important, there is limited experimental work that establishes the VPKI efficiency and scalability. In this paper, we are concerned with exactly these issues. We leverage the common VPKI approach and contribute an enhanced system with precisely defined, novel features that improve its resilience and the user privacy protection. In particular, we depart from the common assumption that the VPKI entities are fully trusted and we improve user privacy in the face of an honest-but-curious security infrastructure. Moreover, we fully implement our VPKI, in a standard-compliant manner, and we perform an extensive evaluation. Along with stronger protection and richer functionality, our system achieves very significant performance improvement over prior systems - contributing the most advanced VPKI towards deployment.},
keywords = {data privacy;public key cryptography;telecommunication network management;vehicular ad hoc networks;VPKI;credential management infrastructure;fundamental security building blocks;honest-but-curious security infrastructure;privacy features;pseudonymous authentication;user privacy protection;vehicular communication systems;vehicular identity;vehicular public-key infrastructure;Conferences;Principal component analysis;Privacy;Protocols;Security;Servers;Vehicles},
doi = {10.1109/VNC.2014.7013306},
issn = {2157-9857},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/scalable-robust-vehicular-public-key-infrastructure.pdf},
comment = {},
typ = {C}
}
@inproceedings{MirmohseniPe:C:2014,
author = {M. Mirmohseni and P. Papadimitratos},
booktitle = {IEEE International Symposium on Information Theory (IEEE ISIT)},
title = {{Active Adversaries from an Information-Theoretic Perspective: Data Modification Attacks}},
year = {2014},
volume = {},
number = {},
pages = {791-795},
address = {Honolulu, HI, USA},
abstract = {We investigate the problem of reliable communication in the presence of active adversaries that can tamper with the transmitted data. We consider a legitimate transmitter-receiver pair connected over multiple communication paths (routes). We propose two new models of adversary, a ?memoryless? and a ?foreseer? adversary. For both models, the adversaries are placing themselves arbitrarily on the routes, keeping their placement fixed throughout the transmission block. This placement may or may not be known to the transmitter. The adversaries can choose their best modification strategy to increase the error at the legitimate receiver, subject to a maximum distortion constraint. We investigate the communication rates that can be achieved in the presence of the two types of adversaries and the channel (benign) stochastic behavior. For memoryless adversaries, the capacity is derived. Our method is to use the typical set of the anticipated received signal for all possible adversarial strategies (including their best one) in a compound channel that also captures adversarial placement. For the foreseer adversaries, which have enhanced observation capabilities compared to the memoryless ones, we propose a new coding scheme to guarantee resilience, i.e., recovery of the codeword independently of the adversarial (best) choice. We derive an achievable rate and we propose an upper bound on the capacity. We evaluate our general results for specific cases (e.g., binary symbol replacement or erasing attacks), to gain insights.},
keywords = {information theory;memoryless systems;telecommunication network routing;transceivers;active adversaries;adversarial placement;anticipated received signal;binary symbol replacement;channel stochastic behavior;compound channel;data modification attacks;foreseer adversary;information-theoretic perspective;legitimate transmitter-receiver pair;maximum distortion constraint;memoryless adversary;multiple communication paths;Distortion measurement;Encoding;Noise;Reliability;Stochastic processes;Upper bound},
doi = {10.1109/ISIT.2014.6874941},
issn = {2157-8095},
month = {June},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/active-adversaries-information-theoretic-data-modification-attacks.pdf},
comment = {},
typ = {C}
}
@inproceedings{GiannetsosGP:C:2014,
title = {{Trustworthy People-Centric Sensing: Privacy, Security and User Incentives Road-Map}},
author = {Giannetsos, Thanassis and Gisdakis, Stylianos and Papadimitratos, Panos},
booktitle = {IEEE IFIP Mediterranean Ad Hoc Networking Workshop (IEEE IFIP MedHocNet)},
month = {June},
year = {2014},
address = {Piran, Slovenia},
pages = {39-46},
abstract = {The broad capabilities of widespread mobile devices have paved the way for People-Centric Sensing (PCS). This emerging paradigm enables direct user involvement in possibly large-scale and diverse data collection and sharing. Unavoidably, this raises significant privacy concerns, as participants may inadvertently reveal a great deal of sensitive information. However, ensuring user privacy, e.g., by anonymizing data they contribute, may cloak faulty (possibly malicious) actions. Thus, PCS systems must not only be privacy-preserving but also accountable and reliable. As an increasing number of applications (e.g., assistive healthcare and public safety systems) can significantly benefit from people-centric sensing, it becomes imperative to meet these seemingly contradicting requirements. In this work, we discuss security, user privacy and incentivization for this sensing paradigm, exploring how to address all aspects of this multifaceted problem. We critically survey the security and privacy properties of state-of-the-art research efforts in the area. Based on our findings, we posit open issues and challenges, and discuss possible ways to address them, so that security and privacy do not hinder the deployment of PCS systems.},
keywords = {data privacy;mobile radio;telecommunication security;anonymizing data;assistive healthcare;data collection;data sharing;direct user involvement;faulty action cloak;mobile devices;multifaceted problem;privacy concerns;public safety systems;security properties;trustworthy people-centric sensing;user incentives road-map;user privacy;Computer architecture;Data collection;Data privacy;Mobile handsets;Privacy;Security;Sensors},
doi = {10.1109/MedHocNet.2014.6849103},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/trustworthy-participatory-centric-priv-sec-incentives.pdf},
comment = {},
typ = {C}
}
@inproceedings{MirmohseniPc:C:2014,
author = {M. Mirmohseni and P. Papadimitratos},
booktitle = {Iran Workshop on Communication and Information Theory (IWCIT)},
title = {{Colluding Eavesdroppers in Large Cooperative Wireless Networks}},
year = {2014},
pages = {1-6},
keywords = {computational complexity;cooperative communication;radio networks;radiofrequency interference;telecommunication security;eavesdropper collusion;eavesdropper improvement;fixed total power constraint;information leakage rate;interference-limited large cooperative wireless networks;legitimate nodes;path loss exponent;zero-cost secure communication;Aggregates;Array signal processing;Encoding;Relays;Transmitters;Vectors;Wireless networks},
doi = {10.1109/IWCIT.2014.6842500},
address = {Tehran, Iran},
issn = {},
month = {May},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/colluding-eavesdroppers-large-cooperative-networks.pdf},
typ = {C}
}
@inproceedings{MirmohseniPb:C:2014,
title = {{Constrained Colluding Eavesdroppers: An Information-Theoretic Model}},
author = {Mirmohseni, Mahtab and Papadimitratos, Panagiotis},
month = {February},
year = {2014},
booktitle = {International Zurich Seminar on Communications (IZS)},
doi = {10.3929/ethz-a-010094849},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/constrained-colluding-eavesdroppers-information-theoretic-izs.pdf},
comment = {},
address = {Zurich, Switzerland},
typ = {C}
}
@inproceedings{GisdakisLGP:C:2013,
author = {S. Gisdakis and M. Laganą and T. Giannetsos and P. Papadimitratos},
booktitle = {IEEE Vehicular Networking Conference (IEEE VNC)},
title = {{SEROSA: Service Oriented Security Architecture for Vehicular Communications}},
year = {2013},
address = {Boston, MA, USA},
volume = {},
number = {},
pages = {111-118},
abstract = {Modern vehicles are no longer mere mechanical devices; they comprise dozens of digital computing platforms, coordinated by an in-vehicle network, and have the potential to significantly enhance the digital life of individuals on the road. While this transformation has driven major advancements in road safety and transportation efficiency, significant work remains to be done to support the security and privacy requirements of the envisioned ecosystem of commercial services and applications (i.e., Internet access, video streaming, etc.). In the era when ?service is everything and everything is a service?, Vehicular Communication (VC) systems cannot escape from this ongoing trend towards multi-service environments accessible from anywhere. To meet the diverse requirements of vehicle operators and Service Providers (SPs), we present SEROSA, a service-oriented security and privacy-preserving architecture for VC. By synthesizing existing VC standards and Web Services (WS), our architecture provides comprehensive identity and service management while ensuring interoperability with existing SPs. We fully implement our system and extensively assess its efficiency, practicality, and dependability. Overall, SEROSA significantly extends the state of the art and serves as a catalyst for the integration of vehicles into the vast domain of Internet-based services.},
keywords = {Web services;mobile communication;road safety;road traffic;service-oriented architecture;telecommunication security;traffic engineering computing;Internet-based services;SEROSA;Web services;digital computing platforms;in-vehicle network;privacy-preserving architecture;service oriented security architecture;vehicular communications;Access control;Authentication;Principal component analysis;Privacy;Protocols;Vehicles;Access Control;Identity Management;Privacy;Security;Vehicular Communications;Web-Services},
doi = {10.1109/VNC.2013.6737597},
issn = {2157-9857},
month = {December},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/service-oriented-architecture-vehicular-security-privacy.pdf},
typ = {C}
}
@inproceedings{GisdakisKP:C:2013,
author = {S. Gisdakis and D. Katselis and P. Papadimitratos},
booktitle = {European Signal Processing Conference (EUSIPCO)},
title = {{Allocating Adversarial Resources in Wireless Networks}},
year = {2013},
pages = {1-5},
abstract = {A plethora of security schemes for wireless sensor networks (WSNs) has been proposed and their resilience to various attacks analyzed; including situations the adversary compromises a subset of the WSN nodes and/or deploys own misbehaving devices. The higher the degree of such intrusion is, the more effective an attack will be. Consider, however, an adversary that is far from omnipotent: How should she attack, how should she deploy her resources to maximally affect the attacked WSN operation? This basic question has received little attention, with one approach considering genetic algorithms for devising an attack strategy [5]. In this work, we recast the problem towards a more systematic treatment and more computationally efficient solutions: a combination of a genetic algorithm with a convex relaxation, and an ?1-constraint formulation. The devising of near-optimal attack strategies efficiently strengthens the adversary, allowing her to adapt and mount effective and thus harmful attacks even in complex and dynamically changing settings.},
keywords = {convex programming;cryptography;genetic algorithms;resource allocation;telecommunication security;wireless sensor networks;?1-constraint formulation;WSN nodes;WSN operation;adversarial resource allocation;convex relaxation;cryptographic key;genetic algorithms;misbehaving devices;near-optimal attack strategies;security schemes;wireless sensor networks;Biological cells;Cryptography;Genetic algorithms;Indexes;Vectors;Wireless sensor networks;Attack;cryptographic key;genetic algorithm (GA);security},
issn = {2219-5491},
month = {September},
address = {Marrakech, Morocco},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/AllocatingAdversarialResourcesWirelessNetworks.pdf},
typ = {C}
}
@inproceedings{KatselisP:C:2013,
author = {D. Katselis and P. Papadimitratos},
booktitle = {IEEE International Symposium on Signal Processing and Information Technology (IEEE ISSPIT)},
title = {{On Secret Key Generation through Multipath for Wireless Networks}},
year = {2013},
pages = {148-153},
abstract = {The complexity of cryptographic key management and the wireless medium salient features motivated a number of works that generate secret keys. Simply put, two nodes can estimate their wireless channel and derive common information to generate a key that other nodes cannot obtain. A gamut of methods, each drawing this information in a different manner, has been proposed. In this landscape, this paper contributes a few findings. First, we propose a method that renders channel impulse response magnitude samples roughly uniform, thus facilitating their quantization and agreement on the derived secret keys. We provide a characterization of the probability of successful agreement for this method, which could be useful for other related methods. Moreover, we consider the cost of the key agreement and we propose a trade-off to increase the probability of success while increasing local processing. With an appropriate configuration, a significant reduction in protocol rounds, and thus communication overhead, for key agreement can be achieved. Through simulations, we validate our approximation of the probability of success and demonstrate the reduced communication overhead.},
keywords = {cryptographic protocols;multipath channels;probability;radio networks;wireless channels;channel impulse response;communication overhead;cryptographic key management complexity;multipath wireless network;probability;protocol;quantization;secret key generation;wireless channel;wireless medium salient feature;Complexity theory;Cryptography;III-V semiconductor materials;Protocols;Wireless communication},
doi = {10.1109/ISSPIT.2013.6781870},
issn = {2162-7843},
month = {December},
address = {Athens, Greece},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/secret-key-generation-multipath.pdf},
typ = {C}
}
@inproceedings{AlexiouGLP:C:2013,
author = {N. Alexiou and S. Gisdakis and M. Laganą and P. Papadimitratos},
booktitle = {IEEE Workshop on Data Security and Privacy in Wireless Networks (IEEE D-SPAN), collocated with IEEE WoWMoM},
title = {{Towards a Secure and Privacy-preserving Multi-service Vehicular Architecture}},
year = {2013},
volume = {},
number = {},
pages = {1-6},
abstract = {Intensive efforts in industry, academia and standardization bodies have brought vehicular communications (VC) one step before commercial deployment. In fact, future vehicles will become significant mobile platforms, extending the digital life of individuals with an ecosystem of applications and services. To secure these services and to protect the privacy of individuals, it is necessary to revisit and extend the vehicular Public Key Infrastructure (PKI)-based approach towards a multi-service security architecture. This is exactly what this work does, providing a design and a proof-of-concept implementation. Our approach, inspired by long-standing standards, is instantiated for a specific service, the provision of short-term credentials (pseudonyms). Moreover, we elaborate on its operation across multiple VC system domains, and craft a roadmap for further developments and extensions that leverage Web-based approaches. Our current results already indicate our architecture is efficient and can scale, and thus can meet the needs of the foreseen broad gamut of applications and services, including the transportation and safety ones.},
keywords = {mobile radio;public key cryptography;telecommunication security;telecommunication services;VC system;Web-based approaches;individual privacy protection;long-standing standards;mobile platforms;privacy-preserving multiservice vehicular architecture;secure multiservice vehicular architecture;short-term credentials;vehicular PKI-based approach;vehicular communications;vehicular public key infrastructure-based approach;Authorization;Principal component analysis;Privacy;Protocols;Standards;Vehicles;VPKI;efficiency;privacy;security},
doi = {10.1109/WoWMoM.2013.6583472},
issn = {},
month = {June},
address = {Madrid, Spain},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/vespa-secure-private-mutliservice-vehicular.pdf},
typ = {C}
}
@inproceedings{EhdaieAAAP:C:2012,
author = {M. Ehdaie and N. Alexiou and M. Ahmadian and M. R. Aref and P. Papadimitratos},
booktitle = {IEEE Workshop on Secure Network Protocols (IEEE NPSec), in conjunction with IEEE ICNP},
title = {{Key Splitting for Random Key Distribution Schemes}},
year = {2012},
volume = {},
number = {},
pages = {1-6},
address = {Austin, TX, USA},
abstract = {A large number of Wireless Sensor Network (WSN) security schemes have been proposed in the literature, relying primarily on symmetric key cryptography. To enable those, Random Key pre-Distribution (RKD) systems have been widely accepted. However, WSN nodes are vulnerable to physical compromise. Capturing one or more nodes operating with RKD would give the adversary keys to compromise communication of other benign nodes. Thus the challenge is to enhance resilience of WSN to node capture, while maintaining the flexibility and low-cost features of RKD. We address this problem, without any special-purpose hardware, proposing a new and simple idea: key splitting. Our scheme does not increase per-node storage, and computation and communication overheads, and it can increase connectivity. More important, it achieves a significant increase in resilience to compromise compared to the state of the art, notably when the adversary does not have overwhelming computational power.},
keywords = {cryptography;telecommunication security;wireless sensor networks;RKD systems;WSN;key splitting;random key distribution schemes;random key pre-distribution systems;security schemes;symmetric key cryptography;wireless sensor network;Peer to peer computing;Probability;Protocols;Resilience;Security;Sensors;Wireless sensor networks},
doi = {10.1109/ICNP.2012.6459951},
issn = {1092-1648},
month = {October},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/key-splitting-random-key-distribution.pdf},
typ = {C}
}
@inproceedings{GisdakisP:C:2012,
author = {Gisdakis, S. and Papadimitratos, Panos},
title = {{On the Optimal Allocation of Adversarial Resources}},
booktitle = {ACM MobiCom International Workshop on Mission-oriented Wireless Sensor Networking (ACM MiSeNet)},
address = {Istanbul, Turkey},
month = {August},
year = {2012},
pages = {33--38},
doi = {10.1145/2348656.2348666},
keywords = {adversary modelling, resource allocation, security analysis},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/misenet-optimal-allocation-adversary.pdf},
comment = {},
typ = {C}
}
@inproceedings{PapadimitratosD:C:2012,
author = {Papadimitratos, Panos and Deng, J.},
title = {{Stealthy Pre-Attacks against Random Key Pre-Distribution Security}},
booktitle = {IEEE International Conference on Communications (IEEE ICC)},
address = {Ottawa, Canada},
year = {2012},
month = {June},
pages = {955-959},
abstract = {Random key pre-distribution (RKPD) has been investigated for large wireless sensor networks, in order to achieve efficient security and robustness against limited node compromise. While it is possible that an adversary obtains a subset of the symmetric keys in use, it has been unclear how to use those to compromise specific secure links. We investigate how the adversary could do this practically. We term this the Stealthy Pre-Attack (SPA), because the adversarial nodes leverage benign behavior to guide their attack. The contribution of this paper is the identification of this adversarial behavior, the evaluation of its benefits for the attacker, which can then much more effectively compromise security, and the proposal of counter-measures to mitigate it.},
keywords = {public key cryptography;telecommunication security;wireless sensor networks;RKPD;SPA;large wireless sensor networks;random key predistribution security;stealthy preattacks;Cryptography;Peer to peer computing;Performance evaluation;Protocols;USA Councils;Wireless sensor networks},
doi = {10.1109/ICC.2012.6364226},
issn = {1550-3607},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/stealthy-attacks-key-predistribution.pdf},
comment = {},
typ = {C}
}
@inproceedings{BohliPVW:C:2011,
author = {Bohli, Jiens-Matthias and Papadimitratos, Panos and Verardi, Donato and Westhoff, Dirk},
title = {{Resilient Data Aggregation for Unattended WSNs}},
booktitle = {IEEE LCN Workshop on Practical Issues in Building Sensor Network Applications (IEEE SenseApp 2011)},
year = {2011},
pages = {994--1002},
month = {October},
doi = {10.1109/LCN.2011.6114411},
issn = {0742-1303},
address = {Bonn, Germany},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/resilient-data-aggregation-wireless-sensor-networks.pdf},
comment = {},
typ = {C}
}
@inproceedings{FioreCCP:C:2011,
author = {Fiore, Marco and Casetti, Claudio and Chiasserini, Carla-Fabianna. and Papadimitratos, Panos},
title = {{Secure Neighbor Position Discovery in Vehicular Networks}},
booktitle = {IEEE/IFIP Mediterranean Ad Hoc Networking Workshop (IEEE/IFIP Med-Hoc-Net)},
year = {2011},
pages = {71--78},
address = {Sicily, Italy},
month = {June},
doi = {10.1109/Med-Hoc-Net.2011.5970496},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/secure-neighbor-discovery-vehicular.pdf},
comment = {},
typ = {C}
}
@inproceedings{ManolopoulosPTR:C:2011,
author = {Manolopoulos, V. and Papadimitratos, Panos and Tao, S. and Rusu, A.},
title = {{Securing Smartphone based ITS}},
booktitle = {IEEE International Conference on ITS Telecommunications (IEEE ITST)},
year = {2011},
pages = {201--206},
address = {St. Petersburg, Russia},
month = {August},
comment = {DIVA},
doi = {10.1109/ITST.2011.6060053},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/securitysmartphoneIntelligentTransportation.pdf},
typ = {C}
}
@inproceedings{NeubergPFU:C:2011,
author = {Neuberg, C. and Papadimitratos, Panos and Fragouli, C. and Urbanke, R.},
title = {{A Mobile World of Security - The Model}},
booktitle = {IEEE Conference on Information Sciences and Systems (IEEE CISS)},
year = {2011},
pages = {1--6},
month = {March},
address = {Baltimore, MD, USA},
doi = {10.1109/CISS.2011.5766242},
comment = {DIVA - Fulltext},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/mobile-world-security-key-generation-ciss.pdf},
typ = {C}
}
@inproceedings{RistanovicPTHL:C:2011,
author = {Ristanovic, N. and Papadimitratos, Panos and Theodorakopoulos, George and Hubaux, Jean-Pierre and Le Boudec, Jean-Yves},
title = {{Adaptive Message Authentication for Multi-Hop Networks}},
booktitle = {IEEE International Conference on Wireless On-demand Network Systems and Services (IEEE WONS)},
year = {2011},
pages = {96--103},
month = {January},
comment = {DIVA - Fulltext},
address = {Bardonecchia, Italy},
keywords = {message authentication;public key cryptography;telecommunication channels;telecommunication security;vehicular ad hoc networks;DoS attacks;adaptive message authentication;communication channel;lightweight filtering scheme;multihop intervehicle communication;network performance;public key cryptography;vehicular ad hoc network;vehicular nodes;Cryptography;Protocols;Routing;Safety;Spread spectrum communication;Vehicles},
doi = {10.1109/WONS.2011.5720206},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/adaptive-message-authentication-multihop-ad-hoc.pdf},
typ = {C}
}
@inproceedings{ShokriPTH:C:2011,
author = {Shokri, Reza and Papadimitratos, Panos and Theodorakopoulos, G. and Hubaux, Jean-Pierre},
title = {{Collaborative Location Privacy}},
booktitle = {IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS)},
year = {2011},
pages = {500--509},
address = {Valencia, Spain},
month = {October},
doi = {10.1109/MASS.2011.55},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/collaborative-location-privacy.pdf},
comment = {},
typ = {C}
}
@inproceedings{FluryPPHL:C:2010,
author = {Flury, Manuel and Poturalski, Marcin and Papadimitratos, Panos and Hubaux, Jean-Pierre and Le Boudec, Jean-Yves},
title = {{Effectiveness of Distance-decreasing Attacks Against Impulse Radio Ranging}},
booktitle = {ACM Conference on Wireless Network Security (ACM WiSec)},
year = {2010},
pages = {117--128},
month = {March},
address = {Hoboken, NJ, USA},
doi = {10.1145/1741866.1741887},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/distance-decreasing-attacks-UWB.pdf},
comment = {},
typ = {C}
}
@inproceedings{GalubaPPADK:C:2010,
author = {Galuba, Wojtek and Papadimitratos, Panos and Poturalski, Marcin and Aberer, Karl and Despotovic, Zoran and Kellerer, Wolfgang},
title = {{Castor: Scalable Secure Routing for Ad Hoc Networks}},
booktitle = {IEEE Conference on Computer Communications (IEEE INFOCOM)},
year = {2010},
pages = {1--9},
address = {San Diego, CA, USA},
month = {March},
comment = {DIVA - Fulltext},
abstract = {Wireless ad hoc networks are inherently vulnerable, as any node can disrupt the communication of potentially any other node in the network. Many solutions to this problem have been proposed. In this paper, we take a fresh and comprehensive approach that addresses simultaneously three aspects: security, scalability and adaptability to changing network conditions. Our communication protocol, Castor, occupies a unique point in the design space: it does not use any control messages except simple packet acknowledgments, and each node makes routing decisions locally and independently without exchanging any routing state with other nodes. Its novel design makes Castor resilient to a wide range of attacks and allows the protocol to scale to large network sizes and to remain efficient under high mobility. We compare Castor against four representative protocols from the literature. Our protocol achieves up to two times higher packet delivery rates, particularly in large and highly volatile networks, while incurring no or only limited additional overhead. At the same time, Castor is able to survive more severe attacks and recovers from them faster.},
keywords = {routing protocols;telecommunication network reliability;telecommunication security;wireless mesh networks;Castor;control messages;scalable secure routing;wireless ad hoc networks;Ad hoc networks;Communication system control;Communications Society;Data communication;Feedback;Mobile communication;Peer to peer computing;Protocols;Routing;Telecommunication network reliability},
doi = {10.1109/INFCOM.2010.5462115},
issn = {0743-166X},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/scalable-secure-routing-ad-hoc-castor.pdf},
typ = {C}
}
@inproceedings{PoturalskiFPHL:C:2010,
author = {Poturalski, Marcin and Flury, M. and Papadimitratos, Panos and Hubaux, Jean-Pierre and Le Boudec, Jean-Yves},
title = {{The Cicada Attack: Degradation and Denial of Service in IR Ranging}},
booktitle = {IEEE International Conference on Ultra-Wideband (IEEE ICUWB)},
year = {2010},
volume = {2},
pages = {1--4},
month = {September},
comment = {DIVA - Fulltext},
address = {Nanjing, China},
doi = {10.1109/ICUWB.2010.5616900},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/degradation-IR-UWB-ranging-cicada.pdf},
typ = {C}
}
@inproceedings{WiedersheimMKP:C:2010,
author = {Wiedersheim, B. and Ma, Z. and Kargl, Frank and Papadimitratos, Panos},
title = {{Privacy in Inter-Vehicular Networks: Why Simple Pseudonym Change is not Enough}},
booktitle = {IEEE International Conference on Wireless On-demand Network Systems and Services (IEEE WONS)},
year = {2010},
pages = {176--183},
month = {February},
comment = {DIVA - Fulltext},
address = {Kranjska Gora, Slovenia},
abstract = {Inter-vehicle communication (IVC) systems disclose rich location information about vehicles. State-of-the-art security architectures are aware of the problem and provide privacy enhancing mechanisms, notably pseudonymous authentication. However, the granularity and the amount of location information IVC protocols divulge, enable an adversary that eavesdrops all traffic throughout an area, to reconstruct long traces of the whereabouts of the majority of vehicles within the same area. Our analysis in this paper confirms the existence of this kind of threat. As a result, it is questionable if strong location privacy is achievable in IVC systems against a powerful adversary.},
keywords = {data privacy;mobile communication;protocols;telecommunication security;inter-vehicle communication systems;location information IVC protocols;privacy enhancing mechanisms;pseudonymous authentication;state-of-the-art security architectures;Application software;Communication system security;Computer applications;Computer networks;Informatics;Laboratories;Privacy;Protocols;Tin;Vehicle driving},
doi = {10.1109/WONS.2010.5437115},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/privacy-vanet-pseudonyms-enough.pdf},
typ = {C}
}
@inproceedings{MezzourPGP:C:2009,
author = {Mezzour, G. and Perrig, A. and Gligor, V. and Papadimitratos, Panos},
title = {{Privacy-Preserving Relationship Path Discovery in Social Networks}},
booktitle = {International Conference on Cryptology and Network Security (CANS)},
year = {2009},
pages = {189--208},
isbn = {978-3-642-10432-9},
doi = {10.1007/978-3-642-10433-6_13},
month = {December},
comment = {DIVA - Fulltext},
address = {Kanazawa, Japan},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/privacy-relationship-distributed-online-social-network.pdf},
typ = {C}
}
@inproceedings{ShokriPRPH:C:2009,
author = {Shokri, Reza and Poturalski, Marcin and Ravot, G. and Papadimitratos, Panos and Hubaux, Jean-Pierre},
title = {{A Practical Secure Neighbor Verification Protocol for Wireless Sensor Networks}},
booktitle = {ACM Conference on Wireless Network Security (ACM WiSec)},
year = {2009},
pages = {193--200},
address = {Zurich, Switzerland},
month = {March},
comment = {DIVA - Fulltext},
isbn = {978-1-60558-460-7},
doi = {10.1145/1514274.1514302},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/practical-secure-neighbor-discovery.pdf},
keywords = {secure neighbor verification, wireless sensor networks},
typ = {C}
}
@inproceedings{KafsiPDAH:C:08,
author = {M. Kafsi and P. Papadimitratos and O. Dousse and T. Alpcan and Jean-Pierre Hubaux},
title = {{VANET Connectivity Analysis}},
booktitle = {IEEE Workshop on Automotive Networking and Applications (IEEE AutoNet)},
year = {2008},
address = {New Orleans, LA, USA},
month = {December},
comment = {DIVA - Fulltext},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/vehicular-connectivity-analysis-vanet.pdf},
typ = {C}
}
@inproceedings{LuoPH2008,
author = {Luo, J. and Papadimitratos, Panos and Hubaux, Jean-Pierre},
title = {{Gossicrypt: Wireless Sensor Network Data Confidentiality Against Parasitic Adversaries}},
booktitle = {IEEE Conference on Sensor, Mesh and Ad Hoc Communications and Networks (IEEE SECON)},
year = {2008},
pages = {441--450},
address = {San Francisco, CA, USA},
month = {June},
doi = {},
comment = {DIVA - Fulltext},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/wireless-sensor-network-confidentiality-gossicrypt.pdf},
typ = {C}
}
@inproceedings{MooreRCPAH2008,
author = {Moore, T. and Raya, Maxim and Clulow, J. and Papadimitratos, Panos and Anderson, R. and Hubaux, Jean-Pierre},
title = {{Fast Exclusion of Errant Devices from Vehicular Networks}},
booktitle = {IEEE Conference on Sensor, Mesh and Ad Hoc Communications and Networks (IEEE SECON)},
year = {2008},
pages = {135--143},
address = {San Francisco, CA, USA},
month = {June},
doi = {10.1109/SAHCN.2008.26},
issn = {2155-5486},
comment = {DIVA - Fulltext},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/fast-exclusion-faulty-devices-vanet.pdf},
typ = {C}
}
@inproceedings{PanchardRSPKH2008,
author = {Panchard, J. and Rao, S. and Sheshshayee, M.S. and Papadimitratos, Panos and Kumar, S. and Hubaux, Jean-Pierre},
title = {{Wireless Sensor Networking for Rain-Fed Rarming Decision Support}},
booktitle = {ACM SIGCOMM Workshop on Networked systems for Developing Regions (ACM NSDR)},
year = {2008},
pages = {31--36},
address = {Seattle, WA, USA},
month = {August},
doi = {10.1145/1397705.1397714},
isbn = {978-1-60558-180-4},
comment = {DIVA - Fulltext},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/wireless-sensor-network-decision-support-farming.pdf},
typ = {C}
}
@inproceedings{Papadimitratos:C:2008,
author = {Papadimitratos, Panos},
title = {{'On the Road' - Reflections on the Security of Vehicular Communication Systems}},
booktitle = {IEEE International Conference on Vehicular Electronics and Safety (IEEE ICVES)},
year = {2008},
pages = {359--363},
address = {Columbus, OH, USA},
month = {September},
comment = {DIVA - Fulltext},
doi = {10.1109/ICVES.2008.4640913},
abstract = {Vehicular communication (VC) systems have recently drawn the attention of industry, authorities, and academia. A consensus on the need to secure VC systems and protect the privacy of their users led to concerted efforts to design security architectures. Interestingly, the results different project contributed thus far bear extensive similarities in terms of objectives and mechanisms. As a result, this appears to be an auspicious time for setting the corner-stone of trustworthy VC systems. Nonetheless, there is a considerable distance to cover till their deployment. This paper ponders on the road ahead. First, it presents a distillation of the state of the art, covering the perceived threat model, security requirements, and basic secure VC system components. Then, it dissects predominant assumptions and design choices and considers alternatives. Under the prism of what is necessary to render secure VC systems practical, and given possible non-technical influences, the paper attempts to chart the landscape towards the deployment of secure VC systems.},
keywords = {mobile radio;telecommunication security;intelligent transportation system;security architectures;security requirements;vehicular communication systems security;Authentication;Cryptography;Privacy;Protocols;Safety;Security;Vehicles},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/vanet-security-vehicular-communication-systems-outlook-deployment.pdf},
typ = {C}
}
@inproceedings{PapadimitratosCHL:C:2008,
author = {Papadimitratos, Panos and Calandriello, G. and Hubaux, Jean-Pierre and Lioy, A.},
title = {{Impact of Vehicular Communications Security on Transportation Safety}},
booktitle = {IEEE INFOCOM Mobile Networking for Vehicular Environments (MOVE) Workshop (IEEE MOVE)},
year = {2008},
pages = {1--6},
address = {Phoenix, AZ, USA},
month = {April},
abstract = {Transportation safety, one of the main driving forces of the development of vehicular communication (VC) systems, relies on high-rate safety messaging (beaconing). At the same time, there is consensus among authorities, industry, and academia on the need to secure VC systems. With specific proposals in the literature, a critical question must be answered: can secure VC systems be practical and satisfy the requirements of safety applications, in spite of the significant communication and processing overhead and other restrictions security and privacy-enhancing mechanisms impose? To answer this question, we investigate in this paper the following three dimensions for secure and privacy-enhancing VC schemes: the reliability of communication, the processing overhead at each node, and the impact on a safety application. The results indicate that with the appropriate system design, including sufficiently high processing power, applications enabled by secure VC can be in practice as effective as those enabled by unsecured VC.},
keywords = {mobile communication;road safety;road vehicles;safety messaging;transportation safety;vehicular communications security;Application software;Communication system security;Computer applications;Computer security;Electronic mail;Privacy;Protection;Transportation;Vehicle safety;Virtual colonoscopy},
doi = {10.1109/INFOCOM.2008.4544663},
comment = {DIVA - Fulltext},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/vanet-security-transportation-safety.pdf},
typ = {C}
}
@inproceedings{PapadimitratosJ:C:2008,
author = {Papadimitratos, Panos and Jovanovic, Aleksandar},
title = {{GNSS-based Positioning: Attacks and Countermeasures}},
booktitle = {IEEE Military Communications Conference (IEEE MILCOM)},
year = {2008},
pages = {1--7},
address = {San Diego, CA, USA},
month = {November},
abstract = {Increasing numbers of mobile computing devices, user-portable, or embedded in vehicles, cargo containers, or the physical space, need to be aware of their location in order to provide a wide range of commercial services. Most often, mobile devices obtain their own location with the help of global navigation satellite systems (GNSS), integrating, for example, a global positioning system (GPS) receiver. Nonetheless, an adversary can compromise location-aware applications by attacking the GNSS-based positioning: It can forge navigation messages and mislead the receiver into calculating a fake location. In this paper, we analyze this vulnerability and propose and evaluate the effectiveness of countermeasures. First, we consider replay attacks, which can be effective even in the presence of future cryptographic GNSS protection mechanisms. Then, we propose and analyze methods that allow GNSS receivers to detect the reception of signals generated by an adversary, and then reject fake locations calculated because of the attack. We consider three diverse defense mechanisms, all based on knowledge, in particular, own location, time, and Doppler shift, receivers can obtain prior to the onset of an attack. We find that inertial mechanisms that estimate location can be defeated relatively easy. This is equally true for the mechanism that relies on clock readings from off-the-shelf devices; as a result, highly stable clocks could be needed. On the other hand, our Doppler Shift Test can be effective without any specialized hardware, and it can be applied to existing devices.},
keywords = {Doppler shift;Global Positioning System;mobile computing;Doppler shift;GPS receiver;cargo containers;cryptographic GNSS protection mechanisms;global navigation satellite systems;global positioning system;mobile computing devices;navigation messages;physical space;Clocks;Containers;Cryptography;Doppler shift;Embedded computing;Global Positioning System;Mobile computing;Physics computing;Satellite navigation systems;Space vehicles},
doi = {10.1109/MILCOM.2008.4753512},
issn = {2155-7578},
comment = {DIVA - Fulltext},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/gnss-GPS-security-c1.pdf},
typ = {C}
}
@inproceedings{PapadimitratosJa:C:2008,
author = {Papadimitratos, Panos and Jovanovic, Aleksandar},
title = {{Protection and Fundamental Vulnerability of GNSS}},
booktitle = {IEEE International Workshop on Satellite and Space Communications (IEEE IWSSC)},
year = {2008},
pages = {167--171},
address = {Toulouse, France},
month = {October},
comment = {DIVA - Fulltext},
abstract = {An increasing number of mobile applications and services require that devices are aware of their location. Global navigation satellite systems (GNSS) are the predominant enabling technology. But location information provided by commercial GNSS is not secure, unlike what is the usual assumption. There are only few exceptions in the literature that present GNSS vulnerabilities. In this paper, we contribute the first detailed quantitative analysis of attacks against GNSS-based localization. We show how replay attacks against GNSS can have a significant impact: even against cryptographically secured GNSS instantiations, an adversary can manipulate the location and time calculated by victim GNSS receivers. We explain in detail how such attacks can be mounted, measure their impact, and discuss the effectiveness of possible countermeasures.},
keywords = {mobile radio;satellite navigation;telecommunication security;GNSS-based localization;global navigation satellite systems;mobile applications;mobile services;victim GNSS receivers;Cryptography;Global Positioning System;Personal digital assistants;Protection;Satellite broadcasting;Satellite navigation systems;Sensor systems;TV;Telephony;Vehicle safety},
doi = {10.1109/IWSSC.2008.4656777},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/gnss-GPS-security-c2.pdf},
typ = {C}
}
@inproceedings{PoturalskiPHa:C:2008,
author = {Poturalski, Marcin and Papadimitratos, Panos and Hubaux, Jean-Pierre},
title = {{Secure Neighbor Discovery in Wireless Networks: Formal Investigation of Possibility}},
booktitle = {{ACM} {S}ymposium on {I}nformation, {C}omputer and {C}ommunications {S}ecurity ({ACM ASIACCS})},
year = {2008},
pages = {189--200},
address = {Tokyo, Japan},
month = {March},
isbn = {978-1-59593-979-1},
comment = {},
doi = {10.1145/1368310.1368338},
keywords = {relay attack, secure neighbor discovery, wireless networks security},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/secure-neighbor-discovery-wireless-formal-impossibility.pdf},
typ = {C}
}
@inproceedings{PoturalskiPHb:C:2008,
author = {M. Poturalksi and P. Papadimitratos and Jean-Pierre Hubaux},
title = {{T}owards {P}rovable {S}ecure {N}eighbor {D}iscovery in {W}ireless {N}etworks},
booktitle = {{ACM} {C}omputer and {C}ommunications {S}ecurity {C}onference ({CCS}) {S}ixth {W}orkshop on {F}ormal {M}ethods in {S}ecurity {E}ngineering ({FMSE})},
year = {2008},
pages = {31--42},
address = {Alexandria, VA, USA},
month = {October},
doi = {10.1145/1456396.1456400},
isbn = {978-1-60558-288-7},
keywords = {relay attack, secure neighbor discovery, wireless networks security},
comment = {DIVA - Fulltext},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/provable-secure-neighbor-discovery-wireless.pdf},
typ = {C}
}
@inproceedings{RayaPapadiGH:C:2008,
author = {Raya, Maxim and Papadimitratos, Panos and Gligor, Virgil and Hubaux, Jean-Pierre},
title = {{On Data-Centric Trust Establishment in Ephemeral Ad hoc Networks}},
booktitle = {IEEE Conference on Computer Communications (IEEE INFOCOM)},
year = {2008},
pages = {1238--1246},
address = {Phoenix, AZ, USA},
month = {April},
abstract = {We argue that the traditional notion of trust as a relation among entities, while useful, becomes insufficient for emerging data-centric mobile ad hoc networks. In these systems, setting the data trust level equal to the trust level of the data- providing entity would ignore system salient features, rendering applications ineffective and systems inflexible. This would be even more so if their operation is ephemeral, i.e., characterized by short-lived associations in volatile environments. In this paper, we address this challenge by extending the traditional notion of trust to data-centric trust: trustworthiness attributed to node-reported data per se. We propose a framework for data-centric trust establishment: First, trust in each individual piece of data is computed; then multiple, related but possibly contradictory, data are combined; finally, their validity is inferred by a decision component based on one of several evidence evaluation techniques. We consider and evaluate an instantiation of our framework in vehicular networks as a case study. Our simulation results show that our scheme is highly resilient to attackers and converges stably to the correct decision.},
keywords = {ad hoc networks;mobile radio;security of data;data centric mobile ad hoc networks;data centric trust establishment;ephemeral ad hoc networks;evidence evaluation techniques;system salient features;vehicular networks;Ad hoc networks;Communications Society;Computational modeling;Computer networks;Government;Logic;Mobile ad hoc networks;Mobile communication;Peer to peer computing;Vehicles},
doi = {10.1109/INFOCOM.2008.180},
comment = {DIVA - Fulltext},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/data-centric-trust-ephemeral.pdf},
typ = {C}
}
@inproceedings{CalandrielloPLH:C:2007,
author = {Calandriello, Giorgio. and Papadimitratos, Panos and Hubaux, Jean-Pierre and Lioy, Antonio},
title = {{Efficient and Robust Pseudonymous Authentication in VANET}},
booktitle = {ACM MobiCom Workshop on Vehicular Ad hoc Networks (ACM VANET)},
year = {2007},
pages = {19--28},
month = {September},
doi = {10.1145/1287748.1287752},
comment = {DIVA - Fulltext},
address = {Montreal, Quebec, Canada},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/efficient-robust-pseudonymous-authentication-vanet.pdf},
typ = {C}
}
@inproceedings{FreudigerRFPH:C:2007,
author = {Freudiger, Julien and Raya, Maxim and F{\'e}legyh{\'a}zi, Mark and Papadimitratos, Panos and others},
title = {{Mix-zones for Location Privacy in Vehicular Networks}},
booktitle = {ACM Workshop on Wireless Networking for Intelligent Transportation Systems (ACM WiN-ITS)},
year = {2007},
address = {Vancouver, British Columbia, Canada},
month = {August},
comment = {DIVA - Fulltext},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/location-privacy-mix-zones-vanet.pdf},
typ = {C}
}
@inproceedings{HaghaniPPAH:C:2007,
author = {Haghani, P. and Papadimitratos, Panos and Poturalski, Marcin and Aberer, K. and Hubaux, Jean-Pierre},
title = {{Efficient and Robust Secure Aggregation for Sensor Networks}},
booktitle = {IEEE Workshop on Secure Network Protocols (IEEE NPSec), in conjunction with IEEE ICNP},
year = {2007},
pages = {1--6},
address = {Beijing, China},
month = {October},
abstract = {Wireless sensor networks (WSNs) rely on in-network aggregation for efficiency, however, this comes at a price: a single adversary can severely influence the outcome by contributing an arbitrary partial aggregate value. Secure in-network aggregation can detect such manipulation (H. Chan et al, 2006). But as long as such faults persist, no aggregation result can be obtained. In contrast, the collection of individual sensor node values is robust and solves the problem of availability, yet in an inefficient way. Our work seeks to bridge this gap in secure data collection: we propose a system that enhances availability with an efficiency close to that of in-network aggregation. To achieve this, our scheme relies on costly operations to localize and exclude nodes that manipulate the aggregation, but only when a failure is detected. The detection of aggregation disruptions and the removal of faulty nodes provides robustness. At the same time, after removing faulty nodes, the WSN can enjoy low cost (secure) aggregation. Thus, the high exclusion cost is amortized, and efficiency increases.},
keywords = {telecommunication security;wireless sensor networks;aggregation disruptions detection;data collection security;failure detection;in-network aggregation security;wireless sensor networks;Aggregates;Base stations;Bridges;Costs;Fault detection;Monitoring;Performance evaluation;Robustness;Spread spectrum communication;Wireless sensor networks},
doi = {10.1109/NPSEC.2007.4371623},
comment = {DIVA - Fulltext},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/efficient-secure-robust-aggregation-wsn.pdf},
typ = {C}
}
@inproceedings{HarschFP:C:2007,
author = {Harsch, Charles and Festag, Andreas and Papadimitratos, Panos},
title = {{Secure Position-Based Routing for VANETs}},
booktitle = {IEEE Vehicular Technology Conference (IEEE VTC Fall)},
year = {2007},
pages = {26--30},
address = {Balimore, MD, USA},
month = {September},
abstract = {Vehicular communication (VC) systems have the potential to improve road safety and driving comfort. Nevertheless, securing the operation is a prerequisite for deployment. So far, the security of VC applications has mostly drawn the attention of research efforts, while comprehensive solutions to protect the network operation have not been developed. In this paper, we address this problem: we provide a scheme that secures geographic position-based routing, which has been widely accepted as the appropriate one for VC. Moreover, we focus on the scheme currently chosen and evaluated in the Car2Car Communication Consortium (C2C-CC). We integrate security mechanisms to protect the position-based routing functionality and services (beaconing, multi-hop forwarding, and geo-location discovery), and enhance the network robustness. We propose defense mechanisms, relying both on cryptographic primitives and plausibility checks mitigating false position injection. Our implementation and initial measurements show that the security overhead is low and the proposed scheme deployable.},
keywords = {automotive electronics;cryptography;mobile radio;telecommunication network routing;telecommunication security;C2C-CC;Car2Car Communication Consortium;VANET;beaconing;cryptographic primitives;multihop forwarding;secure position-based routing;vehicular communication systems;Bioreactors;Broadcasting;Communication system security;Protection;Road safety;Routing;Spread spectrum communication;Unicast;Virtual colonoscopy;Wireless communication},
doi = {10.1109/VETECF.2007.22},
issn = {1090-3038},
comment = {DIVA - Fulltext},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/secure-position-based-routing-vanet-c.pdf},
typ = {C}
}
@inproceedings{PapadimitratosBHKKR:C:2007,
author = {Papadimitratos, Panos and Buttyan, Levente and Hubaux, Jean-Pierre and Kargl, Frank and Kung, Antonio and Raya, Maxim},
title = {{Architecture for Secure and Private Vehicular Communications}},
booktitle = {IEEE International Conference on ITS Telecommunications (IEEE ITST)},
year = {2007},
pages = {1--6},
address = {Sophia Antipolis, France},
month = {June},
abstract = {The deployment of vehicular communication (VC) systems is strongly dependent on their security and privacy features. In this paper, we propose a security architecture for VC. The primary objectives of the architecture include the management of identities and cryptographic keys, the security of communications, and the integration of privacy enhancing technologies. Our design approach aims at a system that relies on well-understood components which can be upgraded to provide enhanced security and privacy protection in the future. This effort is undertaken by SeVeCom (http://www.sevecom.org), a transversal project providing security and privacy enhancing mechanisms compatible with the VC technologies currently under development by all EU funded projects.},
keywords = {mobile communication;private key cryptography;telecommunication security;vehicles;cryptographic keys;privacy;security;vehicular communications;Communication system security;Content addressable storage;Cryptography;Identity management systems;Privacy;Protection;Protocols;Transportation;Vehicles;Virtual colonoscopy},
doi = {10.1109/ITST.2007.4295890},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/secure-vehicular-communication-architecture.pdf},
typ = {C}
}
@inproceedings{LeinmullerBHKKPRS:C:2006,
author = {Leinm{\"u}ller, Tim and Buttyan, Levente and Hubaux, Jean-Pierre and Kargl, Frank and Kroh, Rainer and Papadimitratos, Panos and Raya, Maxim and Schoch, Elmar},
title = {{SEVECOM} - {S}ecure {V}ehicle {C}ommunication},
booktitle = {IST Mobile Summit},
year = {2006},
month = {June},
address = {Mykonos, Greece},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/sevecom-early-1.pdf},
typ = {C}
}
@inproceedings{Papadimitratos:C:2006,
author = {Papadimitratos, Panos},
title = {{Secure Ad Hoc Networking}},
booktitle = {IEEE Consumer Communications and Networking Conference (IEEE CCNC)},
year = {2006},
volume = {1},
pages = {10--14},
address = {Las Vegas, NV, USA},
month = {January},
keywords = {Access protocols;Ad hoc networks;Computer networks;Guidelines;Home computing;IP networks;Military computing;Personal digital assistants;Portable computers;Transceivers},
doi = {10.1109/CCNC.2006.1592978},
issn = {2331-9852},
comment = {DIVA - Fulltext},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/secure-ad-hoc-networks-manet-ccnc.pdf},
typ = {C}
}
@inproceedings{PapadimitratosGH:C:2006,
author = {Papadimitratos, Panos and Gligor, V. and Hubaux, Jean-Pierre},
title = {{Securing Vehicular Communications-Assumptions, Requirements, and Principles}},
booktitle = {Workshop on Embedded Security in Cars (ESCAR)},
year = {2006},
address = {Berlin, Germany},
month = {November},
comment = {DIVA - Fulltext},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/secure-vehicular-communication-requirements-fundamentals.pdf},
typ = {C}
}
@inproceedings{PapadimitratosHH:C:2006,
author = {Papadimitratos, Panos and Haas, Zygmunt J. and Hubaux, Jean-Pierre},
title = {{How to Specify and How to Prove Correctness of Secure Routing Protocols for MANET}},
booktitle = {IEEE International Conference on Broadband Communications, Networks, and Systems (IEEE-CS BroadNets)},
month = {October},
year = {2006},
pages = {1--10},
abstract = {Secure routing protocols for mobile ad hoc networks have been developed recently, yet, it has been unclear what are the properties they achieve, as a formal analysis of these protocols is mostly lacking. In this paper, we are concerned with this problem, how to specify and how to prove the correctness of a secure routing protocol. We provide a definition of what a protocol is expected to achieve independently of its functionality, as well as a communication and adversary models. This way, we enable formal reasoning on the correctness of secure routing protocols. We demonstrate this by analyzing two protocols from the literature.},
keywords = {ad hoc networks;mobile communication;routing protocols;telecommunication security;MANET;mobile ad hoc networks;secure routing protocols;Mobile ad hoc networks;Routing protocols},
doi = {10.1109/BROADNETS.2006.4374344},
comment = {DIVA - Fulltext},
address = {San Jose, CA, USA},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/specification-correctness-secure-routing-manet.pdf},
typ = {C}
}
@inproceedings{PapadimitratosKHK:C:2006,
author = {Papadimitratos, Panos and Kung, Antonio and Hubaux, Jean-Pierre and Kargl, Frank},
title = {{Privacy and Identity Management for Vehicular Communication Systems: a Position Paper}},
booktitle = {{W}orkshop on {S}tandards for {P}rivacy in {U}ser-{C}entric {I}dentity {M}anagement},
year = {2006},
address = {Zurich, Switzerland},
month = {July},
comment = {DIVA - Fulltext},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/privacy-identity-managment-vanet.pdf},
typ = {C}
}
@article{SchochKLSP:C:2006,
author = {Schoch, E. and Kargl, Frank and Leinm{\"u}ller, T. and Schlott, S. and Papadimitratos, Panos},
title = {{Impact of Pseudonym Changes on Geographic Routing in VANETs}},
journal = {European Workshop on Security and Privacy in Ad hoc and Sensor Networks (ESAS)},
year = {2006},
pages = {43--57},
publisher = {Springer Berlin/Heidelberg},
address = {Hamburg, Germany},
month = {September},
comment = {DIVA - Fulltext},
doi = {10.1007/11964254_6},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/impactGeoRoutingPseudonymChange.pdf},
typ = {C}
}
@inproceedings{SankanarayananPM:C:2006,
author = {S. Sankaranarayanan and P. Papadimitratos and A. Mishra and S. Hershey},
title = {{A} {B}andwidth {S}haring {A}pproach to {I}mprove {L}icenced {S}pectrum {U}tilization},
booktitle = {{IEEE} {I}nternational {S}ymposium on {N}ew {F}rontiers in {D}ynamic {S}pectrum {A}ccess {N}etworks ({IEEE} {D}y{SPAN})},
year = {2005},
pages = {279--288},
address = {Baltimore, MD, USA},
month = {November},
abstract = {The spectrum of deployed wireless cellular communication systems is found to be under-utilized, even though licensed spectrum is at a premium. To efficiently utilize the bandwidth left unused in a cellular system, which we denote as the primary system (PRI), we design a system with an ad hoc overlay network, which we denote as the secondary system (SEC). The basic design principle is that the SEC operates in a non-intrusive manner and does not interact with the PRI. We develop the AS-MAC, an ad hoc SEC medium access control protocol to enable the interoperation of the PRI-SEC system. We address a number of technical challenges pertinent to this networking environment, and evaluate AS-MAC. Our performance evaluation results show that, in a single-hop ASN, the AS-MAC transparently utilizes 75\% of the bandwidth left unused by the PRI, while, in multi-hop ASNs, due to spatial reuse, the AS-MAC can utilize up to 180\% of the idle PRI resources},
keywords = {access protocols;ad hoc networks;cellular radio;performance evaluation;radio spectrum management;AS-MAC protocol;PRI-SEC;ad hoc network;bandwidth sharing approach;licensed spectrum utilization;medium access control;overlay network;performance evaluation;primary-secondary system;wireless cellular communication system;Access protocols;Area measurement;Bandwidth;Cellular networks;Frequency;GSM;Media Access Protocol;Peer to peer computing;Spread spectrum communication;Wireless communication},
doi = {10.1109/DYSPAN.2005.1542644},
comment = {DIVA - Fulltext},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/bw-sharing-licensed-spectrum-efficient-utilization-dyspan05.pdf},
typ = {C}
}
@inproceedings{SankarPM:C:05,
author = {S. Sankaranarayanan and P. Papadimitratos and A. Mishra},
title = {{Enhancing Wireless Spectrum Utilization with a Cellular-Ad Hoc Overlay Architecture}},
booktitle = {IEEE Military Communications Conference (IEEE MILCOM)},
year = {2005},
volume = {1},
pages = {405--415},
volume = {1},
address = {Atlantic City, NJ, USA},
month = {October},
comment = {DIVA - Fulltext},
abstract = {The spectrum of deployed wireless cellular communication systems is found to be under-utilized, even though licensed spectrum is at a premium. In this paper, we design a system with an ad hoc overlay network, which we denote as the secondary system (SEC), to efficiently utilize the bandwidth left unused in a cellular system, which we denote as the primary system (PRI). The basic design principle is that the SEC operates in a non-intrusive manner and does not interact with the PRI. We develop the AS-MAC, an ad hoc SEC medium access control protocol to enable the interoperation of the PRI-SEC system. We address a number of technical challenges pertinent to this networking environment, and investigate a number of AS-MAC variants. Our performance evaluation results indicate that AS-MAC can transparently utilize up to 80\% bandwidth left unused by the PRI},
keywords = {access protocols;ad hoc networks;cellular radio;cellular-ad hoc overlay architecture;medium access control protocol;primary system;secondary system;wireless cellular communication systems;wireless spectrum utilization;Access protocols;Area measurement;Bandwidth;Cellular networks;Computer architecture;Frequency measurement;GSM;Media Access Protocol;Time measurement;Wireless communication},
doi = {10.1109/MILCOM.2005.1605717},
issn = {2155-7578},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/m05-cell-overlay-dynamic-spectrum-access.pdf},
typ = {C}
}
@inproceedings{PapadimitratosH:C:2005,
author = {Papadimitratos, Panos and Haas, Z. J.},
title = {{Secure On-Demand Distance Vector Routing in Ad Hoc Networks}},
booktitle = {IEEE/Sarnoff Symposium on Advances in Wired and Wireless Communication (IEEE Sarnoff Symposium)},
year = {2005},
pages = {168--171},
address = {Princeton, NJ, USA},
month = {April},
comment = {DIVA - Fulltext},
abstract = {We address the problem of securing route discovery in mobile ad hoc networks, proposing a lightweight, yet robust, routing protocol, the distance-vector secure routing protocol (DV-SRP). DV-SRP discovers on-demand multiple routes, which are established across the network, without explicitly providing network connectivity. DV-SRP combines the advantages of the type of route discovery first introduced by AODV, with security and, thus, resilience to adversaries that disrupt route discovery. Compared to previous proposals in the literature to secure the AODV-like route discovery, DV-SRP is either more robust, or more efficient, or more general},
keywords = {ad hoc networks;mobile radio;routing protocols;telecommunication security;distance-vector secure routing protocol;mobile ad hoc networks;on-demand multiple route discovery;secure on-demand distance vector routing;Ad hoc networks;Computer networks;Intelligent networks;Mobile ad hoc networks;Peer to peer computing;Proposals;Public key cryptography;Robustness;Routing protocols;Telecommunication traffic},
doi = {10.1109/SARNOF.2005.1426537},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/secure-distance-vector-routing-manet.pdf},
typ = {C}
}
@inproceedings{PapadimitratosMR:C:2005,
author = {Papadimitratos, Panos and Mishra, A. and Rosenburgh, D.},
title = {A cross-layer design approach to enhance 802.15. 4},
booktitle = {IEEE Military Communications Conference (IEEE MILCOM)},
year = {2005},
pages = {1719--1726},
volume = {3},
address = {Atlantic City, NJ, USA},
month = {October},
comment = {DIVA - Fulltext},
abstract = {The low-power communication in wireless sensor networks can be impacted by severe channel impairments. In this paper, to address this problem and achieve high network goodput, we propose that the medium access control protocol takes into consideration the error performance of the underlying wireless links. We combine a distributed back-off strategy regulated by the wireless link qualify with carrier sense multiple access with collision avoidance. We integrate our cross-layer operational approach in the IEEE 802.15.4 standard, taking advantage of existing functionality and signaling to avoid network overhead and achieve simplicity in implementation. Our performance evaluation indicates that our scheme is more effective, achieving up to 69\% higher goodput, and more efficient, delivering up to 154\% more data bits per unit of energy consumed in the network, at the expense of an up to 18\% degradation in fairness, compared to the basic 802.15.4},
keywords = {access protocols;carrier sense multiple access;radio links;wireless sensor networks;802.15.4;carrier sense multiple access with collision avoidance;cross-layer design approach;distributed back-off strategy;medium access control protocol;wireless links;wireless sensor networks;Access protocols;Collision avoidance;Computer networks;Cross layer design;Degradation;Error correction;Media Access Protocol;Physical layer;Wireless application protocol;Wireless sensor networks},
doi = {10.1109/MILCOM.2005.1605922},
issn = {2155-7578},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/cross-layer-design-802.15.4.pdf},
typ = {C}
}
@inproceedings{PapadimitratosHb:C:2005,
author = {Papadimitratos, Panos and Haas, Z. J.},
title = {{Secure Route Discovery for QoS-Aware Routing in Ad Hoc Networks}},
booktitle = {IEEE/Sarnoff Symposium on Advances in Wired and Wireless Communication (IEEE Sarnoff Symposium)},
year = {2005},
pages = {176--179},
address = {Princeton, NJ, USA},
month = {April},
comment = {DIVA - Fulltext},
doi = {10.1109/SARNOF.2005.1426539},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/secure-QoS-routing-manet.pdf},
typ = {C}
}
@inproceedings{PapadimitratosH:C:2003,
author = {Papadimitratos, Panos and Haas, Z. J.},
title = {{Secure Link State Routing for Mobile Ad Hoc Networks}},
booktitle = {IEEE International Symposium on Applications and the Internet - Workshop on Security and Assurance in Ad Hoc Networks},
year = {2003},
pages = {379--383},
month = {January},
address = {Orlando, FL, USA},
abstract = {Secure operation of the routing protocol is one of the major challenges to be met for the proliferation of the mobile ad hoc networking (MANET) paradigm. Nevertheless, security enhancements have been proposed mostly for reactive MANET protocols. The proposed secure link state routing protocol (SLSP) provides secure proactive topology discovery, which can be beneficial to network operation in a number of ways. SLSP can be employed as a stand-alone protocol, or fit naturally into a hybrid routing framework, when combined with a reactive protocol. SLSP is robust against individual attackers, is capable of adjusting its scope between local and network-wide topology discovery, and is capable of operating in networks of frequently changing topology and membership.},
keywords = {ad hoc networks;public key cryptography;routing protocols;telecommunication security;hybrid routing framework;local topology discovery;membership;mobile ad hoc networks;network-wide topology discovery;reactive protocol;secure link state routing protocol;secure proactive topology discovery;security;stand-alone protocol;Collaboration;Communication system traffic control;Computer networks;Mobile ad hoc networks;Mobile communication;Mobile computing;Network topology;Robustness;Routing protocols;Synchronization},
doi = {10.1109/SAINTW.2003.1210190},
comment = {DIVA - Fulltext},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/SecureLinkStateRoutingMobileAdHocNetworks.pdf},
typ = {C}
}
@inproceedings{PapadimitratosHb:C:2003,
author = {Papadimitratos, Panos and Haas, Z. J.},
title = {{Secure Data Transmission in Mobile Ad Hoc Networks}},
booktitle = {ACM MobiCom Workshop on Wireless Security (ACM WiSe)},
year = {2003},
month = {July},
isbn = {1-58113-769-9},
address = {San Diego, CA, USA},
pages = {41--50},
doi = {10.1145/941311.941318},
keywords = {MANET security, multi-path routing, secure message transmission, secure routing, secure routing protocol},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/secure-message-transmission-manet-wise.pdf},
typ = {C}
}
@inproceedings{PapadimitratosHS:C:2002,
author = {Panagiotis Papadimitratos and Zygmunt J. Haas and Emin G{\"{u}}n Sirer},
title = {{Path Set Selection in Mobile Ad Hoc Networks}},
booktitle = {{ACM} {I}nternational {S}ymposium on {M}obile {A}d\ {H}oc {N}etworking and {C}omputing ({ACM} {M}obi{H}oc)},
pages = {1--11},
year = {2002},
doi = {10.1145/513800.513802},
keywords = {mobile ad hoc networks, path set selection, reliability},
isbn = {1-58113-501-7},
address = {Lausanne, Switzerland},
month = {June},
comment = {},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/path-selection-mutipath-manet.pdf},
typ = {C}
}
@inproceedings{PapadiH:C:02,
author = {P. Papadimitratos and Z. J. Haas},
title = {{S}ecure {R}outing for {M}obile {A}d {H}oc {N}etworks},
booktitle = {{SCS} {C}ommunication {N}etworks and {D}istributed {S}ystems\ {M}odeling and {S}imulation {C}onference (CNDS)},
year = {2002},
pages = {193--204},
address = {San Antonio, TX, USA},
month = {January},
comment = {},
webpdf = {https://people.kth.se/~papadim/publications/fulltext/secure-routing-cnds02.pdf},
typ = {C}
}
This file was generated by bibtex2html 1.98.