Obfuscation Combiners
From MaRDI portal
Publication:2829229
DOI10.1007/978-3-662-53008-5_18zbMath1391.94749OpenAlexW2914929826MaRDI QIDQ2829229
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
Related Items
Proofs of Work from worst-case assumptions ⋮ From FE combiners to secure MPC and back ⋮ Multi-input Functional Encryption with Unbounded-Message Security ⋮ On the complexity of compressing obfuscation ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ Combiners for functional encryption, unconditionally ⋮ Amplifying the security of functional encryption, unconditionally
Uses Software
Cites Work
- Unnamed Item
- Robust multi-property combiners for hash functions
- Indistinguishability Obfuscation: From Approximate to Exact
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
- Cryptanalysis of GGH15 Multilinear Maps
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Cryptophia’s Short Combiner for Collision-Resistant Hash Functions
- Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
- On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input
- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
- Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
- Succinct Randomized Encodings and their Applications
- Cryptanalysis of the Multilinear Map over the Integers
- How to Generate and Use Universal Samplers
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
- Indistinguishability Obfuscation from Compact Functional Encryption
- On Strong Simulation and Composable Point Obfuscation
- Robuster Combiners for Oblivious Transfer
- Compression from Collisions, or Why CRHF Combiners Have a Long Output
- Security-Amplifying Combiners for Collision-Resistant Hash Functions
- A Complexity Measure
- On Robust Combiners for Oblivious Transfer and Other Primitives
- On the (im)possibility of obfuscating programs
- Protecting Obfuscation against Algebraic Attacks
- Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don’t Exist
- Multi-property Preserving Combiners for Hash Functions
- Breaking and Fixing Cryptophia’s Short Combiner
- Topics in Cryptology – CT-RSA 2005
- Theory of Cryptography
- Post-zeroizing Obfuscation: New Mathematical Tools, and the Case of Evasive Circuits
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- On Robust Combiners for Private Information Retrieval and Other Primitives
- On the Impossibility of Efficiently Combining Collision Resistant Hash Functions
