Quantifying information leakage of randomized protocols

DOI10.1007/978-3-642-35873-9_7MaRDI QIDQ2926639zbMATH OpenOpenAlexFDO

Authors Fabrizio Biondi, Axel Legay, Pasquale Malacaria, Andrzej Wąsowski

Publication date 3 November 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-01088193/file/main.pdf

Mathematics Subject Classification ID

Network protocols (68M12) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Cryptography (94A60)

Recommendations

• Quantifying information leakage of randomized protocols
• Quantifying Information Leakage in Process Calculi
• Quantifying information leakage in process calculi
• Formal analysis of the information leakage of the DC-nets and crowds anonymity protocols
• Statistical measurement of information leakage

Cited in

(16)

• Quantifying information leakage in process calculi
• Unprovability of leakage-resilient cryptography beyond the information-theoretic limit
• Leakage and protocol composition in a game-theoretic perspective
• Quantifying information leakage of randomized protocols
• Information leakage due to operative errors in card-based protocols
• A Unified Metric for Quantifying Information Leakage of Cryptographic Devices Under Power Analysis Attacks
• Does My Device Leak Information? An a priori Statistical Power Analysis of Leakage Detection Tests
• Information leakage of non-terminating processes
• Statistical measurement of information leakage
• Quantifying Information Leakage in Process Calculi
• Information leakage of a randomly selected boolean function
• Maximizing entropy over Markov processes
• Formal analysis of the information leakage of the DC-nets and crowds anonymity protocols
• Exponential Decreasing Rate of Leaked Information in Universal Random Privacy Amplification
• Compositional Methods for Information-Hiding
• Quantitative information flow for scheduler-dependent systems

This page was built for publication: Quantifying information leakage of randomized protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2926639)