Maximal incompleteness as obfuscation potency

DOI10.1007/S00165-016-0374-2zbMATH Open1355.68053OpenAlexW2343078876MaRDI QIDQ511013FDOQ511013

Isabella Mastroeni, Roberto Giacobazzi, 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

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

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)

Cites Work

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

Cited In (3)

• Formal framework for reasoning about the precision of dynamic analysis
• Property-driven code obfuscations reinterpreting Jones-optimality in abstract interpretation
• Encoding watermark numbers as reducible permutation graphs using self-inverting permutations

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)