Efficient IBE with Tight Reduction to Standard Assumption in the Multi-challenge Setting
From MaRDI portal
Publication:2953791
DOI10.1007/978-3-662-53890-6_21zbMath1407.94111OpenAlexW2552787446MaRDI QIDQ2953791
Jie Chen, Junqing Gong, Zhen Fu Cao, Xiao-lei Dong
Publication date: 6 January 2017
Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53890-6_21
identity based encryptiontight securityprime-order bilinear groupmulti-challenge settingGroth-Sahai proof system(weak) anonymitynested dual system group
Related Items (18)
Fast, Compact, and Expressive Attribute-Based Encryption ⋮ Master-Key KDM-Secure IBE from Pairings ⋮ Hierarchical Identity-Based Encryption with Tight Multi-challenge Security ⋮ New Proof for BKP IBE Scheme and Improvement in the MIMC Setting ⋮ Unbounded ABE via bilinear entropy expansion, revisited ⋮ Efficient revocable identity-based encryption with short public parameters ⋮ Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin ⋮ Fully adaptive decentralized multi-authority \textsf{ABE} ⋮ Generic constructions of master-key KDM secure attribute-based encryption ⋮ Identity-based encryption with (almost) tight security in the multi-instance, multi-ciphertext setting ⋮ Unbounded dynamic predicate compositions in ABE from standard assumptions ⋮ Unbounded HIBE with tight security ⋮ Improved inner-product encryption with adaptive security and full attribute-hiding ⋮ Fast, compact, and expressive attribute-based encryption ⋮ Tightly Secure IBE Under Constant-Size Master Public Key ⋮ Tighter security proofs for GPV-IBE in the quantum random oracle model ⋮ Tightly secure hierarchical identity-based encryption ⋮ Master-key KDM-secure ABE via predicate encoding
Cites Work
- Unnamed Item
- Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography
- Extended Nested Dual System Groups, Revisited
- A Framework for Identity-Based Encryption with Almost Tight Security
- Compactly Hiding Linear Spans
- Tightly CCA-Secure Encryption Without Pairings
- More Efficient Constructions for Inner-Product Encryption
- An Algebraic Framework for Diffie-Hellman Assumptions
- Fully, (Almost) Tightly Secure IBE and Dual System Groups
- Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
- (Hierarchical) Identity-Based Encryption from Affine Message Authentication
- Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
- New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques
- Concise Multi-challenge CCA-Secure Encryption and Signatures with Almost Tight Security
- Identity-Based Encryption with (Almost) Tight Security in the Multi-instance, Multi-ciphertext Setting
- Efficient (Anonymous) Compact HIBE from Standard Assumptions
- Quasi-Adaptive NIZK for Linear Subspaces Revisited
- Improved Dual System ABE in Prime-Order Groups via Predicate Encodings
- Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings
- Identity-Based Cryptosystems and Signature Schemes
- Number-theoretic constructions of efficient pseudo-random functions
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
- Practical Identity-Based Encryption Without Random Oracles
- Efficient Noninteractive Proof Systems for Bilinear Groups
- Fully Secure Unbounded Inner-Product and Attribute-Based Encryption
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More
- Dual System Encryption via Predicate Encodings
This page was built for publication: Efficient IBE with Tight Reduction to Standard Assumption in the Multi-challenge Setting
