Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities

DOI10.1016/j.tcs.2019.02.021zbMath1423.68440OpenAlexW2920767208WikidataQ128306305 ScholiaQ128306305MaRDI QIDQ2424888

Andreia Mordido, Filipe Casal, Carlos Caleiro

Publication date: 25 June 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.02.021

zbMATH Keywords

phase transitionside-channel attacksprobabilistic satisfiabilityGenPSATGGenPSAT

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mixed integer programming (90C11) Cryptography (94A60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Uses Software

• Gurobi
• GenPSAT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic satisfiability: algorithms with the presence and absence of a phase transition
• Some representations of the multivariate Bernoulli and binomial distributions
• Probabilistic logic
• Probabilistic satisfiability
• Generalized probabilistic satisfiability
• A logic for reasoning about probabilities
• ECDH Key-Extraction via Low-Bandwidth Electromagnetic Attacks on PCs
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• Masking against Side-Channel Attacks: A Formal Security Proof
• Power Analysis Attacks
• Probabilistic Satisfiability and Coherence Checking through Integer Programming
• Probabilistic logic over equations and domain restrictions
• Applied Cryptography and Network Security
• The complexity of theorem-proving procedures