Structure-preserving compilers from new notions of obfuscations

DOI10.1007/978-3-031-31371-4_23MaRDI QIDQ6067384zbMATH OpenOpenAlexFDO

Authors Matteo Campanelli, Danilo Francati, Claudio Orlandi

Publication date 16 November 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-31371-4_23

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Theory of data (68Pxx) Cryptography (94A60)

Recommendations

• Advances in Cryptology - EUROCRYPT 2004
• On the (im)possibility of obfuscating programs
• Indistinguishability obfuscation
• scientific article; zbMATH DE number 1842483
• On Best-Possible Obfuscation

Cites work

• Advances in Cryptology - EUROCRYPT 2004
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Candidate iO from homomorphic encryption schemes
• Candidate obfuscation via oblivious LWE sampling
• Compact proofs of retrievability
• How to use indistinguishability obfuscation
• scientific article; zbMATH DE number 1842483 (Why is no real title available?)
• Impossibility of VBB obfuscation with ideal constant-degree graded encodings
• Indistinguishability obfuscation from circular security
• Indistinguishability obfuscation from compact functional encryption
• Indistinguishability obfuscation from functional encryption
• Indistinguishability obfuscation from semantically-secure multilinear encodings
• Indistinguishability obfuscation from well-founded assumptions
• Indistinguishability obfuscation with non-trivial efficiency
• Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
• Instantiating random oracles via UCEs
• Limits of extractability assumptions with distributional auxiliary input
• New directions in cryptography
• New negative results on differing-inputs obfuscation
• Obfuscation for evasive functions
• Obfuscation of hyperplane membership
• On Best-Possible Obfuscation
• On extractability obfuscation
• On obfuscating point functions
• On obfuscation with random oracles
• On perfect correctness in (lockable) obfuscation
• On Signatures of Knowledge
• On strong simulation and composable point obfuscation
• On the (im)possibility of obfuscating programs
• On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
• On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
• On virtual grey box obfuscation for general circuits
• Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation
• Protecting obfuscation against algebraic attacks
• Public-coin differing-inputs obfuscation and its applications
• Robust transforming combiners from indistinguishability obfuscation to functional encryption
• The impossibility of obfuscation with auxiliary input or a universal simulator
• Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
• When does functional encryption imply obfuscation?

Cited in

(1)

• TSFC: A Structure-Preserving Form Compiler

This page was built for publication: Structure-preserving compilers from new notions of obfuscations

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