Towards general-purpose program obfuscation via local mixing

DOI10.1007/978-3-031-78023-3_2MaRDI QIDQ6955273zbMATH OpenFDO

Authors Ran Canetti, Claudio Chamon, Eduardo R. Mucciolo, Andrei E. Ruckenstein

Publication date 23 July 2025

Full work available at URL https://doi.org/10.1007/978-3-031-78023-3_2

zbMATH Keywords

indistinguishability obfuscation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Networks and circuits as models of computation; circuit complexity (68Q06)

Cites work

• scientific article; zbMATH DE number 1583797 (Why is no real title available?)
• scientific article; zbMATH DE number 3692653 (Why is no real title available?)
• scientific article; zbMATH DE number 2163011 (Why is no real title available?)
• scientific article; zbMATH DE number 1842483 (Why is no real title available?)
• An Almost m-wise Independent Random Permutation of the Cube
• Candidate obfuscation via oblivious LWE sampling
• Circuit obfuscation using braids
• Cryptography from sublinear-time average-case hardness of time-bounded Kolmogorov complexity
• GGH15 beyond permutation branching programs: proofs, attacks, and candidates
• Generators for Certain Alternating Groups with Applications to Cryptography
• Graph-induced multilinear maps from lattices
• How to use indistinguishability obfuscation
• Indistinguishability obfuscation from bilinear maps and LPN variants
• Indistinguishability obfuscation from circular security
• Indistinguishability obfuscation from functional encryption
• Indistinguishability obfuscation from well-founded assumptions
• Indistinguishability obfuscation with non-trivial efficiency
• Indistinguishability obfuscation, range avoidance, and bounded arithmetic
• Kolmogorov comes to cryptomania: on interactive Kolmogorov complexity and key-agreement
• Layout graphs, random walks and the t-wise independence of SPN block ciphers
• Logical Reversibility of Computation
• Matrix PRFs: constructions, attacks, and applications to obfuscation
• Obfuscating circuits via composite-order graded encoding
• Obfuscation of probabilistic circuits and applications
• Obfustopia built on secret-key functional encryption
• On best-possible obfuscation
• On one-way functions and Kolmogorov complexity
• On the (im)possibility of obfuscating programs
• Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
• Protecting obfuscation against algebraic attacks
• Quantum statistical mechanics of encryption: reaching the speed limit of classical block ciphers
• Robustness of average-case meta-complexity via pseudorandomness
• Simple permutations mix well
• Succinct LWE sampling, random polynomials, and obfuscation
• The Complexity of Public-Key Cryptography
• The \(t\)-wise independence of substitution-permutation networks
• Time/Space Trade-Offs for Reversible Computation
• Two-round secure MPC from indistinguishability obfuscation
• Witness encryption and its applications
• Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations

Cited in

(3)

• Obfuscating pseudorandom functions is post-quantum complete
• Lattice-based post-quantum iO from circular security with random opening assumption
• Cryptography. Abstracts from the workshop held January 19--24, 2025

This page was built for publication: Towards general-purpose program obfuscation via local mixing

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