Obfuscation combiners

DOI10.1007/978-3-662-53008-5_18MaRDI QIDQ2829229zbMATH OpenOpenAlexFDO

Authors Amir Herzberg, Hod bin-Noon, Haya Shulman, Marc Fischlin

Publication date 27 October 2016

Published in Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-53008-5_18

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Robuster Combiners for Oblivious Transfer
• Advances in Cryptology - EUROCRYPT 2004
• On the (im)possibility of obfuscating programs
• scientific article; zbMATH DE number 1842483
• Shorter circuit obfuscation in challenging security models

Cites work

• scientific article; zbMATH DE number 1088253 (Why is no real title available?)
• A Complexity Measure
• Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
• Breaking and Fixing Cryptophia’s Short Combiner
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Compression from Collisions, or Why CRHF Combiners Have a Long Output
• Cryptanalysis of GGH15 multilinear maps
• Cryptanalysis of the multilinear map over the integers
• Cryptophia's short combiner for collision-resistant hash functions
• How to Generate and Use Universal Samplers
• Indistinguishability obfuscation for Turing machines with unbounded memory
• Indistinguishability obfuscation from compact functional encryption
• Indistinguishability obfuscation from constant-degree graded encoding schemes
• Indistinguishability obfuscation from semantically-secure multilinear encodings
• Indistinguishability obfuscation: from approximate to exact
• Multi-property Preserving Combiners for Hash Functions
• Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don’t Exist
• On Robust Combiners for Oblivious Transfer and Other Primitives
• On Robust Combiners for Private Information Retrieval and Other Primitives
• On strong simulation and composable point obfuscation
• On the (im)possibility of obfuscating programs
• On the Impossibility of Efficiently Combining Collision Resistant Hash Functions
• On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
• Post-zeroizing obfuscation: new mathematical tools, and the case of evasive circuits
• Protecting obfuscation against algebraic attacks
• Robust multi-property combiners for hash functions
• Robuster Combiners for Oblivious Transfer
• Security-Amplifying Combiners for Collision-Resistant Hash Functions
• Succinct garbling and indistinguishability obfuscation for RAM programs
• Succinct randomized encodings and their applications
• Theory of Cryptography
• Topics in Cryptology – CT-RSA 2005
• Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
• Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
• Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations

Cited in

(10)

• Multi-input functional encryption with unbounded-message security
• On the complexity of compressing obfuscation
• Proofs of Work from worst-case assumptions
• Combiners for functional encryption, unconditionally
• From FE combiners to secure MPC and back
• Amplifying the security of functional encryption, unconditionally
• Error-Tolerant Combiners for Oblivious Primitives
• Advances in Cryptology - EUROCRYPT 2004
• Analysis and prevention of averaging attacks against obfuscation protocols
• Robust transforming combiners from indistinguishability obfuscation to functional encryption

Describes a project that uses

Uses Software

• GitHub
• PyObf

This page was built for publication: Obfuscation combiners

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