On the Achievability of Simulation-Based Security for Functional Encryption
From MaRDI portal
Publication:2849415
DOI10.1007/978-3-642-40084-1_29zbMath1311.94077OpenAlexW2170297052MaRDI QIDQ2849415
Abhishek Jain, Angelo De Caro, Omer Paneth, Adam O'Neill, Giuseppe Persiano, Vincenzo Iovino
Publication date: 17 September 2013
Published in: Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40084-1_29
Related Items (35)
Verifiable Inner Product Encryption Scheme ⋮ Impossibility of simulation secure functional encryption even with random oracles ⋮ From Selective to Adaptive Security in Functional Encryption ⋮ Indistinguishability Obfuscation from Compact Functional Encryption ⋮ Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents ⋮ From Cryptomania to Obfustopia Through Secret-Key Functional Encryption ⋮ Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings ⋮ On the power of rewinding simulators in functional encryption ⋮ From cryptomania to obfustopia through secret-key functional encryption ⋮ Simulation-Based Secure Functional Encryption in the Random Oracle Model ⋮ On the optimal succinctness and efficiency of functional encryption and attribute-based encryption ⋮ Broadcast, trace and revoke with optimal parameters from polynomial hardness ⋮ Multi-input Functional Encryption with Unbounded-Message Security ⋮ Functional encryption with secure key leasing ⋮ Collusion-resistant functional encryption for RAMs ⋮ The pseudorandom oracle model and ideal obfuscation ⋮ Leakage-Resilient Chosen-Ciphertext Secure Functional Encryption from Garbled Circuits ⋮ Verifiable functional encryption using Intel SGX ⋮ Adaptively simulation-secure attribute-hiding predicate encryption ⋮ Practical fully secure unrestricted inner product functional encryption modulo \(p\) ⋮ Efficient Inner Product Encryption with Simulation-Based Security ⋮ Anonymous spatial encryption under affine space delegation functionality with full security ⋮ Functional encryption for randomized functionalities in the private-key setting from minimal assumptions ⋮ Function-private functional encryption in the private-key setting ⋮ Strongly full-hiding inner product encryption ⋮ Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps ⋮ Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions ⋮ Cryptography with Updates ⋮ Fully secure functional encryption with a large class of relations from the decisional linear assumption ⋮ Functional Encryption for Turing Machines ⋮ Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits ⋮ A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation ⋮ Fully Secure Functional Encryption for Inner Products, from Standard Assumptions ⋮ A new approach to practical function-private inner product encryption ⋮ Unnamed Item
This page was built for publication: On the Achievability of Simulation-Based Security for Functional Encryption