Maximal incompleteness as obfuscation potency

DOI10.1007/S00165-016-0374-2MaRDI QIDQ511013zbMATH OpenOpenAlexFDO

Authors Roberto Giacobazzi, Isabella Mastroeni, Mila Dalla Preda

Publication date 14 February 2017

Published in Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00165-016-0374-2

zbMATH Keywords

abstract interpretationlattice theoryprogram semanticsstatic program analysisclosure operatorsprogram transformationcode obfuscation

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Automata, Languages and Programming
• On the Concept of Software Obfuscation in Computer Security
• Code obfuscation against abstract model checking attacks
• Code obfuscation against abstraction refinement attacks
• On the possibility of provably secure obfuscating programs

Cites work

• scientific article; zbMATH DE number 3470465 (Why is no real title available?)
• scientific article; zbMATH DE number 1834576 (Why is no real title available?)
• scientific article; zbMATH DE number 1390341 (Why is no real title available?)
• scientific article; zbMATH DE number 236855 (Why is no real title available?)
• scientific article; zbMATH DE number 3323877 (Why is no real title available?)
• Abstract Interpretation Frameworks
• Abstract interpretation and application to logic programs
• Algebraic properties of program integration
• Analyzing program analyses
• Automata, Languages and Programming
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Making abstract interpretations complete
• On the (im)possibility of obfuscating programs
• Refining and compressing abstract domains
• Specifying Imperative Data Obfuscations
• Systematic design of program transformation frameworks by abstract interpretation
• Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
• Weakening additivity in adjoining closures

Cited in

(9)

• Code obfuscation against abstraction refinement attacks
• Formal framework for reasoning about the precision of dynamic analysis
• Attacking an obfuscated cipher by injecting faults
• Code obfuscation against abstract model checking attacks
• C source code obfuscator
• Control flow obfuscation with irreducible loops and self-modifying code
• Property-driven code obfuscations reinterpreting Jones-optimality in abstract interpretation
• Encoding watermark numbers as reducible permutation graphs using self-inverting permutations
• A novel obfuscation: class hierarchy flattening

This page was built for publication: Maximal incompleteness as obfuscation potency

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