Obfuscation combiners
From MaRDI portal
Publication:2829229
DOI10.1007/978-3-662-53008-5_18zbMATH Open1391.94749OpenAlexW2914929826MaRDI QIDQ2829229FDOQ2829229
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
Recommendations
Cites Work
- Theory of Cryptography
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- A Complexity Measure
- On Robust Combiners for Oblivious Transfer and Other Primitives
- On strong simulation and composable point obfuscation
- Title not available (Why is that?)
- On the (im)possibility of obfuscating programs
- Cryptanalysis of the multilinear map over the integers
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- Security-Amplifying Combiners for Collision-Resistant Hash Functions
- Compression from Collisions, or Why CRHF Combiners Have a Long Output
- Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don’t Exist
- Multi-property Preserving Combiners for Hash Functions
- Topics in Cryptology – CT-RSA 2005
- On the Impossibility of Efficiently Combining Collision Resistant Hash Functions
- Robust multi-property combiners for hash functions
- 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
- Succinct randomized encodings and their applications
- Indistinguishability obfuscation from compact functional encryption
- Breaking and Fixing Cryptophia’s Short Combiner
- Indistinguishability obfuscation: from approximate to exact
- Indistinguishability obfuscation from semantically-secure multilinear encodings
- Indistinguishability obfuscation for Turing machines with unbounded memory
- Succinct garbling and indistinguishability obfuscation for RAM programs
- Robuster Combiners for Oblivious Transfer
- Protecting obfuscation against algebraic attacks
- Post-zeroizing obfuscation: new mathematical tools, and the case of evasive circuits
- On Robust Combiners for Private Information Retrieval and Other Primitives
- Indistinguishability obfuscation from constant-degree graded encoding schemes
- How to Generate and Use Universal Samplers
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
- Cryptophia's short combiner for collision-resistant hash functions
Cited In (9)
- 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
- Error-Tolerant Combiners for Oblivious Primitives
- Amplifying the security of functional encryption, unconditionally
- Advances in Cryptology - EUROCRYPT 2004
- Robust transforming combiners from indistinguishability obfuscation to functional encryption
Uses Software
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)
