Asymptotic information leakage under one-try attacks

DOI10.1017/S0960129513000613zbMath1361.68079MaRDI QIDQ5740624

Francesca Pampaloni, Michela Paolini, Michele Boreale

Publication date: 27 July 2016

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (2)

Searching secrets rationally ⋮ Worst- and average-case privacy breaches in randomization mechanisms

Cites Work

• Quantifying information leakage in process calculi
• Anonymity protocols as noisy channels
• Quantitative Notions of Leakage for One-try Attacks
• Asymptotic Information Leakage under One-Try Attacks
• Quantitative Information Flow, with a View
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• Formally Bounding the Side-Channel Leakage in Unknown-Message Attacks
• Computing the Leakage of Information-Hiding Systems
• On the Foundations of Quantitative Information Flow
• A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks
• On the asymptotics of M-hypothesis Bayesian detection
• Compositional Methods for Information-Hiding
• Elements of Information Theory
• The Complexity of Distinguishing Distributions (Invited Talk)

This page was built for publication: Asymptotic information leakage under one-try attacks