On Removing Graded Encodings from Functional Encryption

DOI10.1007/978-3-319-56614-6_1zbMath1415.94410OpenAlexW2612535422MaRDI QIDQ5738968

Huijia Lin, Nir Bitansky, Omer Paneth

Publication date: 13 June 2017

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

Full work available at URL: https://doi.org/10.1007/978-3-319-56614-6_1

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Impossibility of simulation secure functional encryption even with random oracles ⋮ From cryptomania to obfustopia through secret-key functional encryption ⋮ On the complexity of compressing obfuscation ⋮ Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps ⋮ On Removing Graded Encodings from Functional Encryption

Cites Work

• Unnamed Item
• Unnamed Item
• Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings
• On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
• Indistinguishability Obfuscation: From Approximate to Exact
• Output-Compressing Randomized Encodings and Applications
• Order-Revealing Encryption and the Hardness of Private Learning
• Indistinguishability Obfuscation with Non-trivial Efficiency
• Functional Encryption Without Obfuscation
• Time-Lock Puzzles from Randomized Encodings
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
• Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
• Functional Encryption with Bounded Collusions via Multi-party Computation
• Cryptanalysis of the Multilinear Map over the Integers
• How to Obfuscate Programs Directly
• From Cryptomania to Obfustopia Through Secret-Key Functional Encryption
• Compactness vs Collusion Resistance in Functional Encryption
• Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
• Indistinguishability Obfuscation from Compact Functional Encryption
• The Uber-Assumption Family
• Candidate Multilinear Maps from Ideal Lattices
• How to use indistinguishability obfuscation
• On Obfuscation with Random Oracles
• Obfuscating Circuits via Composite-Order Graded Encoding
• Hierarchical Identity Based Encryption with Constant Size Ciphertext
• On the (im)possibility of obfuscating programs
• Protecting Obfuscation against Algebraic Attacks
• Reusable garbled circuits and succinct functional encryption
• Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps
• On Removing Graded Encodings from Functional Encryption
• Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
• Two-Round Secure MPC from Indistinguishability Obfuscation
• Cryptography and Coding
• Theory of Cryptography

This page was built for publication: On Removing Graded Encodings from Functional Encryption