Incremental program obfuscation

DOI10.1007/978-3-319-63715-0_7MaRDI QIDQ1680211zbMATH OpenOpenAlexFDO

Authors Sanjam Garg, Omkant Pandey

Publication date 15 November 2017

Full work available at URL https://doi.org/10.1007/978-3-319-63715-0_7

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Program Obfuscation and One-Time Programs
• On the (im)possibility of obfuscating programs
• scientific article; zbMATH DE number 2044529
• On the possibility of provably secure obfuscating programs
• scientific article; zbMATH DE number 1842483
• Code obfuscation against abstraction refinement attacks
• Control flow obfuscation with irreducible loops and self-modifying code

Cited in

(6)

• Succinct garbling schemes from functional encryption through a local simulation paradigm
• Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
• scientific article; zbMATH DE number 5652055 (Why is no real title available?)
• Cryptography with updates
• Incremental cryptography revisited: PRFs, nonces and modular design
• On the (im)possibility of obfuscating programs

This page was built for publication: Incremental program obfuscation

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