Quantifying information leakage of randomized protocols

被引:9
|
作者
Biondi, Fabrizio [1 ]
Legay, Axel [1 ]
Malacaria, Pasquale [2 ]
Wasowski, Andrzej [3 ]
机构
[1] IRISA INRIA Rennes, F-35042 Rennes, France
[2] Queen Mary Univ London, London E1 4NS, England
[3] IT Univ Copenhagen, DK-2300 Copenhagen S, Denmark
关键词
Model checking; Quantitative information flow; Information leakage; Markov chain; Markov decision process; Channel capacity; Probabilistic system; FLOW; RISK;
D O I
10.1016/j.tcs.2015.07.034
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The quantification of information leakage provides a quantitative evaluation of the security of a system. We propose the usage of Markovian processes to model deterministic and probabilistic systems. By using a methodology generalizing the lattice of information approach we model refined attackers capable to observe the internal behavior of the system, and quantify the information leakage of such systems. We also use our method to obtain an algorithm for the computation of channel capacity from our Markovian models. Finally, we show how to use the method to analyze timed and non-timed attacks on the Onion Routing protocol. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:62 / 87
页数:26
相关论文
共 50 条
  • [31] A Kind of Quantum Dialogue Protocols Without Information Leakage Assisted by Auxiliary Quantum Operation
    Ling-Yun Huang
    Tian-Yu Ye
    International Journal of Theoretical Physics, 2015, 54 : 2494 - 2504
  • [32] Quantifying the Information Leakage in Timing Side Channels in Deterministic Work-Conserving Schedulers
    Gong, Xun
    Kiyavash, Negar
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2016, 24 (03) : 1841 - 1852
  • [33] A Unified Metric for Quantifying Information Leakage of Cryptographic Devices Under Power Analysis Attacks
    Zhang, Liwei
    Ding, A. Adam
    Fei, Yunsi
    Luo, Pei
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2015, PT II, 2015, 9453 : 338 - 360
  • [34] Leakage-Tolerant Interactive Protocols
    Bitansky, Nir
    Canetti, Ran
    Halevi, Shai
    THEORY OF CRYPTOGRAPHY (TCC 2012), 2012, 7194 : 266 - 284
  • [35] Quantifying Privacy Leakage in Graph Embedding
    Duddu, Vasisht
    Boutet, Antoine
    Shejwalkar, Virat
    PROCEEDINGS OF THE 17TH EAI INTERNATIONAL CONFERENCE ON MOBILE AND UBIQUITOUS SYSTEMS: COMPUTING, NETWORKING AND SERVICES (MOBIQUITOUS 2020), 2021, : 76 - 85
  • [36] Localizing and Quantifying Leakage through CFRDs
    Jia, J. S.
    Xu, Y.
    Hao, J. T.
    Zhang, L. M.
    JOURNAL OF GEOTECHNICAL AND GEOENVIRONMENTAL ENGINEERING, 2016, 142 (09)
  • [37] Quantifying protocols for safe school activities
    Genari, Juliano
    Goedert, Guilherme Tegoni
    Lira, Sergio H. A.
    Oliveira, Krerley
    Barbosa, Adriano
    Lima, Allysson
    Silva, Jose Augusto
    Oliveira, Hugo
    Maciel, Mauricio
    Ledoino, Ismael
    Resende, Lucas J.
    dos Santos, Edmilson Roque
    Marchesin, Dan
    Struchiner, Claudio
    Pereira, Tiago
    PLOS ONE, 2022, 17 (09):
  • [38] How Can Randomized Routing Protocols Hide Flow Information in Wireless Networks?
    Zhao, Shangqing
    Lu, Zhuo
    Wang, Cliff
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2020, 19 (11) : 7224 - 7236
  • [39] Quantifying the efficacy of voltage protocols in characterising ion channel kinetics: A novel information-theoretic approach
    Jennings, Matthew W.
    Nithiarasu, Perumal
    Pant, Sanjay
    INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN BIOMEDICAL ENGINEERING, 2024, 40 (05)
  • [40] RANDOMIZED AGREEMENT PROTOCOLS
    BENOR, M
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 448 : 72 - 83