Active linking attacks

DOI10.1007/978-3-662-48054-0_46MaRDI QIDQ2946424zbMATH OpenOpenAlexFDO

Authors Henning Schnoor, Oliver Woizekowski

Publication date 16 September 2015

Published in Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1311.7236

Mathematics Subject Classification ID

Computer security (68M25) Cryptography (94A60)

Abstract: We study linking attacks on communication protocols. We show that an active attacker is strictly more powerful in this setting than previously-considered passive attackers. We introduce a formal model to reason about active linkability attacks, formally define security against these attacks and give very general conditions for both security and insecurity of protocols. In addition, we introduce a composition-like technique that allows to obtain security proofs by only studying small components of a protocol.

Recommendations

• scientific article; zbMATH DE number 1405638
• On the power of non-spoofing adversaries
• Safely composing security protocols
• An active attack on a multiparty key exchange protocol
• Theory of Cryptography

Cites work

• ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION
• Active linking attacks
• G2C: cryptographic protocols from goal-driven specifications
• scientific article; zbMATH DE number 1161568 (Why is no real title available?)
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.

Cited in

(2)

• Active linking attacks
• On the power of non-spoofing adversaries

This page was built for publication: Active linking attacks

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