Obfuscating circuits via composite-order graded encoding
From MaRDI portal
Publication:5261690
DOI10.1007/978-3-662-46497-7_21zbMATH Open1382.94049OpenAlexW2169673773MaRDI QIDQ5261690FDOQ5261690
Authors: Benny Applebaum, Zvika Brakerski 
Publication date: 6 July 2015
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-46497-7_21
Recommendations
Cited In (37)
- Hardness of continuous local search: query complexity and cryptographic lower bounds
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
- On Removing Graded Encodings from Functional Encryption
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Efficient obfuscation for CNF circuits and applications in cloud computing
- Circuit obfuscation using braids
- Universal samplers with fast verification
- Cutting-edge cryptography through the lens of secret sharing
- Cutting-edge cryptography through the lens of secret sharing
- Multilinear maps from obfuscation
- Graded encoding schemes from obfuscation
- Protecting obfuscation against algebraic attacks
- Impossibility of VBB obfuscation with ideal constant-degree graded encodings
- Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
- How to avoid obfuscation using witness PRFs
- Compactness vs collusion resistance in functional encryption
- Constraining pseudorandom functions privately
- Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
- Lattice-based SNARGs and their application to more efficient obfuscation
- Practical order-revealing encryption with limited leakage
- On the correlation intractability of obfuscated pseudorandom functions
- Multilinear maps from obfuscation
- On the complexity of compressing obfuscation
- Obfuscating circuits via composite-order graded encoding
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Functional encryption: deterministic to randomized functions from simple assumptions
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries
- Shorter circuit obfuscation in challenging security models
- How to obfuscate programs directly
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- On virtual grey box obfuscation for general circuits
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Constrained pseudorandom functions from functional encryption
- Indistinguishability obfuscation: from approximate to exact
- Obfuscating conjunctions
- Cryptanalyses of Candidate Branching Program Obfuscators
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
This page was built for publication: Obfuscating circuits via composite-order graded encoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261690)
