On the power of rewinding simulators in functional encryption

DOI10.1007/S10623-016-0272-XMaRDI QIDQ2407055zbMATH OpenOpenAlexWikidataFDO

Authors Angelo De Caro, Vincenzo Iovino

Publication date 28 September 2017

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-016-0272-x

zbMATH Keywords

simulation-based securityfunctional encryptionrewinding

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• On the achievability of simulation-based security for functional encryption
• Reusable garbled circuits and succinct functional encryption
• Encryption Simulatability Reconsidered
• Impossibility of simulation secure functional encryption even with random oracles
• Functional encryption: deterministic to randomized functions from simple assumptions
• Simulation-based secure functional encryption in the random oracle model
• Succinct garbling schemes from functional encryption through a local simulation paradigm
• Limits on the power of indistinguishability obfuscation and functional encryption
• Simple and generic constructions of succinct functional encryption
• Simple and generic constructions of succinct functional encryption

Cites work

• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
• An Identity Based Encryption Scheme Based on Quadratic Residues
• Attribute-based encryption for circuits
• Attribute-based encryption for circuits from multilinear maps
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Conjunctive, Subset, and Range Queries on Encrypted Data
• Efficient selective identity-based encryption without random oracles
• Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
• Functional encryption for inner product predicates from learning with errors
• Functional encryption for regular languages
• Functional encryption with bounded collusions via multi-party computation
• Functional encryption: definitions and challenges
• Functional encryption: new perspectives and lower bounds
• Fuzzy Identity-Based Encryption
• How to construct constant-round zero-knowledge proof systems for NP
• Identity-based cryptosystems and signature schemes
• On extractability obfuscation
• On the Necessity of Rewinding in Secure Multiparty Computation
• On the achievability of simulation-based security for functional encryption
• On the practical security of inner product functional encryption
• On the semantic security of functional encryption schemes
• Practical Identity-Based Encryption Without Random Oracles
• Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
• Probabilistic encryption
• Reusable garbled circuits and succinct functional encryption
• Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
• Simulation-based secure functional encryption in the random oracle model
• Standard security does not imply security against selective-opening
• The knowledge complexity of interactive proof-systems

Cited in

(6)

• Verifiable Inner Product Encryption Scheme
• Impossibility of simulation secure functional encryption even with random oracles
• On the achievability of simulation-based security for functional encryption
• Encryption Simulatability Reconsidered
• Strongly full-hiding inner product encryption
• Simulation-based secure functional encryption in the random oracle model

This page was built for publication: On the power of rewinding simulators in functional encryption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2407055)