Modeling and reasoning about an attacker with cryptanalytical capabilities

DOI10.1016/J.ENTCS.2009.10.010MaRDI QIDQ7014440zbMATH OpenFDO

Authors Bruno Montalto, Carlos Caleiro

Publication date 11 March 2025

Full work available at URL https://doi.org/10.1016/J.ENTCS.2009.10.010

zbMATH Keywords

attackercryptographic propertyprobabilistic statementsecurity protocolShannon entropy

Mathematics Subject Classification ID

Computer security (68M25) Measures of information, entropy (94A17) Cryptography (94A60)

Cites work

• A framework for analyzing probabilistic protocols and its application to the partial secrets exchange
• A Mathematical Theory of Communication
• A new polynomial-time algorithm for linear programming
• Automata, Languages and Programming
• Computer Aided Verification
• scientific article; zbMATH DE number 3168161 (Why is no real title available?)
• scientific article; zbMATH DE number 774344 (Why is no real title available?)
• scientific article; zbMATH DE number 3433226 (Why is no real title available?)
• Logic for Programming, Artificial Intelligence, and Reasoning
• On the security of public key protocols
• Reconciling two views of cryptography (The computational soundness of formal encryption)
• Reducibility among combinatorial problems
• Towards a quantitative analysis of security protocols

Cited in

(1)

• Quantitative aspects of programming languages and systems over the past 2⁴ years and beyond

This page was built for publication: Modeling and reasoning about an attacker with cryptanalytical capabilities

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