On the power of rewinding simulators in functional encryption

DOI10.1007/s10623-016-0272-xzbMath1391.94744OpenAlexW2489088895WikidataQ122979646 ScholiaQ122979646MaRDI QIDQ2407055

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

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

Related Items (3)

Verifiable Inner Product Encryption Scheme ⋮ Simulation-Based Secure Functional Encryption in the Random Oracle Model ⋮ Strongly full-hiding inner product encryption

Cites Work

• Unnamed Item
• Efficient selective identity-based encryption without random oracles
• Probabilistic encryption
• How to construct constant-round zero-knowledge proof systems for NP
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Attribute-Based Encryption for Circuits from Multilinear Maps
• Functional Encryption: New Perspectives and Lower Bounds
• On the Achievability of Simulation-Based Security for Functional Encryption
• Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
• Standard Security Does Not Imply Security against Selective-Opening
• Functional Encryption with Bounded Collusions via Multi-party Computation
• Functional Encryption for Regular Languages
• On the Practical Security of Inner Product Functional Encryption
• Simulation-Based Secure Functional Encryption in the Random Oracle Model
• Identity-Based Cryptosystems and Signature Schemes
• Functional Encryption: Definitions and Challenges
• Functional Encryption for Inner Product Predicates from Learning with Errors
• Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
• Practical Identity-Based Encryption Without Random Oracles
• On the Necessity of Rewinding in Secure Multiparty Computation
• Conjunctive, Subset, and Range Queries on Encrypted Data
• The knowledge complexity of interactive proof-systems
• An Identity Based Encryption Scheme Based on Quadratic Residues
• On the Semantic Security of Functional Encryption Schemes
• Fuzzy Identity-Based Encryption
• Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
• Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
• Attribute-based encryption for circuits
• Reusable garbled circuits and succinct functional encryption
• On Extractability Obfuscation

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