Now showing 1 - 8 of 8
  • Publication
    VIVO: A secure, privacy-preserving, and real-time crowd-sensing framework for the Internet of Things.
    (Elsevier, 2018-07-21)
    Luceri, Luca
    ;
    Cardoso, Felipe
    ;
    Papandrea, Michaela
    ;
    Giordano, Silvia
    ;
    Buwaya, Julia
    ;
    Kundig, Stéphane
    ;
    Angelopoulos, Constantinos Marios
    ;
    Rolim, José
    ;
    Zhao, Zhongliang
    ;
    Carrera, Jose Luis
    ;
    Braun, Torsten
    ;
    Tossou, Aristide C.Y.
    ;
    Dimitrakakis, Christos
    ;
    Scopus© Citations 9
  • Publication
    Differential Privacy for Bayesian Inference through Posterior Sampling.
    (Microtome Publishing, 2017)
    Dimitrakakis, Christos
    ;
    Nelson, Blaine
    ;
    Zhang, Zuhe
    ;
    ;
    Rubinstein, Benjamin I. P.
    Differential privacy formalises privacy-preserving mechanisms that provide access to a database. Can Bayesian inference be used directly to provide private access to data? The answer is yes: under certain conditions on the prior, sampling from the posterior distribution can lead to a desired level of privacy and utility. For a uniform treatment, we define differential privacy over arbitrary data set metrics, outcome spaces and distribution families. This allows us to also deal with non-i.i.d or non-tabular data sets. We then prove bounds on the sensitivity of the posterior to the data, which delivers a measure of robustness. We also show how to use posterior sampling to provide differentially private responses to queries, within a decision-theoretic framework. Finally, we provide bounds on the utility of answers to queries and on the ability of an adversary to distinguish between data sets. The latter are complemented by a novel use of Le Cam's method to obtain lower bounds on distinguishability. Our results hold for arbitrary metrics, including those for the common definition of differential privacy. For specific choices of the metric, we give a number of examples satisfying our assumptions.
    Type:
    Journal:
    Volume:
    Issue:
  • Publication
    Distance Bounding Protocols: Are you Close Enough?
    (IEEE, 2015)
    Dimitrakakis, Christos
    ;
    Distance-bounding protocols can offer protection against attacks on access control systems that require users to both verify their credentials and prove their location. However, tradeoffs among accuracy, cost, and privacy are necessary.
    Type:
    Journal:
    Volume:
    Issue:
    Scopus© Citations 6
  • Publication
    Expected loss analysis for authentication in constrained channels.
    (IOS Press, 2015)
    Dimitrakakis, Christos
    ;
    ;
    Vaudenay, Serge
    We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy conditions and communication costs. This is motivated by a number of authentication protocols, where at least some part of the authentication is performed during a phase, lasting n rounds, with no error correction. This requires assigning an acceptable threshold for the number of detected errors and taking into account the cost of incorrect authentication and of communication. This paper describes a framework enabling an expected loss analysis for all the protocols in this family. Computationally simple methods to obtain nearly optimal values for the threshold, as well as for the number of rounds are suggested and upper bounds on the expected loss, holding uniformly, are given. These bounds are tight, as shown by a matching lower bound. Finally, a method to adaptively select both the number of rounds and the threshold is proposed for a certain class of protocols.
    Scopus© Citations 4
  • Publication
    Intrusion Detection in MANET using Classification Algorithms: The Effects of Cost and Model Selection.
    (Elsevier, 2013-01) ;
    Dimitrakakis, Christos
    Intrusion detection is frequently used as a second line of defense in Mobile Ad-hoc Networks (MANETs). In this paper we examine how to properly use classification methods in intrusion detection for MANETs. In order to do so we evaluate five supervised classification algorithms for intrusion detection on a number of metrics. We measure their performance on a dataset, described in this paper, which includes varied traffic conditions and mobility patterns for multiple attacks. One of our goals is to investigate how classification performance depends on the problem cost matrix. Consequently, we examine how the use of uniform versusweighted cost matrices affects classifier performance. A second goal is to examine techniques for tuning classifiers when unknown attack subtypes are expected during testing. Frequently, when classifiers are tuned using cross-validation, data from the same types of attacks are available in all folds. This differs from real-world employment where unknown types of attacks may be present. Consequently, we develop a sequential cross-validation procedure so that not all types of attacks will necessarily be present across all folds, in the hope that this would make the tuning of classifiers more robust. Our results indicate that weighted cost matrices can be used effectively with most statistical classifiers and that sequential cross-validation can have a small, but significant effect for certain types of classifiers.
    Scopus© Citations 84
  • Publication
    On selecting the nonce length in distance-bounding protocols.
    (Oxford University Press, 2013-04-04) ;
    Peris-Lopez, Pedro
    ;
    Dimitrakakis, Christos
    ;
    Vaudenay, Serge
    Distance-bounding protocols form a family of challenge–response authentication protocols that have been introduced to thwart relay attacks. They enable a verifier to authenticate and to establish an upper bound on the physical distance to an untrusted prover. We provide a detailed security analysis of a family of such protocols. More precisely, we show that the secret key shared between the verifier and the prover can be leaked after a number of nonce repetitions. The leakage probability, while exponentially decreasing with the nonce length, is only weakly dependent on the key length. Our main contribution is a high probability bound on the number of sessions required for the attacker to discover the secret, and an experimental analysis of the attack under noisy conditions. Both of these show that the attack's success probability mainly depends on the length of the used nonces rather than the length of the shared secret key. The theoretical bound could be used by practitioners to appropriately select their security parameters. While longer nonces can guard against this type of attack, we provide a possible countermeasure which successfully combats these attacks even when short nonces are used.
    Type:
    Journal:
    Volume:
    Issue:
    Scopus© Citations 14
  • Publication
    Reid et al.'s Distance Bounding Protocol and Mafia Fraud Attacks over Noisy Channels.
    (IEEE, 2010-02-05) ;
    Dimitrakakis, Christos
    ;
    Peris-Lopez, Pedro
    ;
    Hernandez-Castro, J.C.
    Distance bounding protocols are an effective countermeasure against relay attacks including distance fraud, mafia fraud and terrorist fraud attacks. Reid et al. proposed the first symmetric key distance bounding protocol against mafia and terrorist fraud attacks. However, claims that this is only achieved with a (7/8) n probability of success for mafia fraud, rather than the theoretical value of (3/4) n (for n rounds) achieved by distance bounding protocols without a final signature. We prove that the mafia fraud attack success using the Reid et al. protocol is bounded by (3/4) n and reduces as noise increases. The proof can be of further interest as it is the first - to the best of our knowledge - detailed analysis of the effects of communication errors on the security of a distance bounding protocol.
    Type:
    Journal:
    Volume:
    Issue:
    Scopus© Citations 22