Unbounded ABE via bilinear entropy expansion, revisited
From MaRDI portal
(Redirected from Publication:1648812)
Recommendations
- Bilinear entropy expansion from the decisional linear assumption
- Unbounded HIBE and Attribute-Based Encryption
- Fully secure unbounded inner-product and attribute-based encryption
- Unbounded dynamic predicate compositions in ABE from standard assumptions
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
Cites work
- scientific article; zbMATH DE number 2009954 (Why is no real title available?)
- A unified framework for UC from only OT
- A unified framework for concurrent security
- An algebraic framework for Diffie-Hellman assumptions
- Bilinear entropy expansion from the decisional linear assumption
- Bit commitment using pseudorandomness
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- Black-box constructions of composable protocols without set-up
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Bounded-concurrent secure two-party computation without setup assumptions
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Concurrent Non-malleable Commitments from Any One-Way Function
- Constant-round black-box construction of composable multi-party computation protocol
- Dual System Encryption via Predicate Encodings
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Dual system encryption framework in prime-order groups via computational pair encodings
- Dual system encryption via doubly selective security: framework, fully secure functional encryption for regular languages, and more
- Efficient IBE with tight reduction to standard assumption in the multi-challenge setting
- Fully secure functional encryption with general relations from the decisional linear assumption
- Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
- Fully secure unbounded inner-product and attribute-based encryption
- Fully, (Almost) Tightly Secure IBE and Dual System Groups
- Fuzzy Identity-Based Encryption
- Improved dual system ABE in prime-order groups via predicate encodings
- Lossy Trapdoor Functions and Their Applications
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- New notions of security: achieving universal composability without trusted setup
- Non-malleability amplification
- On adaptively secure protocols
- Partial garbling schemes and their applications
- Resettably sound zero-knowledge arguments from OWFs -- the (semi) black-box way
- Round-efficient black-box construction of composable multi-party computation
- Round-optimal black-box two-party computation
- Semi-adaptive attribute-based encryption and improved delegation for Boolean formula
- Semi-adaptive security and bundling functionalities made generic and easy
- Theory of Cryptography
- Theory of Cryptography
- Tightly CCA-secure encryption without pairings
- Tools for simulating features of composite order bilinear groups in the prime order setting
- Unbounded HIBE and Attribute-Based Encryption
- Waters signatures with optimal security reduction
Cited in
(33)- Compact FE for unbounded attribute-weighted sums for logspace from SXDH
- GLUE: generalizing unbounded attribute-based encryption for flexible efficiency trade-offs
- Fast, compact, and expressive attribute-based encryption
- Unbounded HIBE with tight security
- Fast, compact, and expressive attribute-based encryption
- Rerandomizable signatures under standard assumption
- A survey on functional encryption
- Improved fully adaptive decentralized MA-ABE for NC1 from MDDH
- Non-interactive zero-knowledge functional proofs
- Fully adaptive decentralized multi-authority \textsf{ABE}
- Unbounded inner product functional encryption from bilinear maps
- Unbounded inner product functional encryption from bilinear maps
- Public-key puncturable encryption: modular and compact constructions
- Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH}
- Bilinear entropy expansion from the decisional linear assumption
- Adaptively secure ABE for DFA from \(k\)-Lin and more
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
- Attribute based encryption for deterministic finite automata from DLIN
- Witness encryption for succinct functional commitments and applications
- Flexible attribute-based proxy re-encryption for efficient data sharing
- Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}}
- Fully secure ABE with outsourced decryption against chosen ciphertext attack
- Public-key encryption with keyword search in multi-user, multi-challenge setting under adaptive corruptions
- Registered functional encryptions from pairings
- Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin
- Master-key KDM-secure ABE via predicate encoding
- Unbounded dynamic predicate compositions in ABE from standard assumptions
- Decentralized multi-authority attribute-based inner-product FE: large universe and unbounded
- Traitor tracing with \(N^{1/3}\)-size ciphertexts and \(O(1)\)-size keys from \(k\)-Lin
- Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice
- Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH
- Improved inner-product encryption with adaptive security and full attribute-hiding
- Tag-based ABE in prime-order groups via pair encoding
This page was built for publication: Unbounded ABE via bilinear entropy expansion, revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1648812)
