Cryptanalysis of Boyen's attribute-based encryption scheme in TCC 2013
From MaRDI portal
Publication:2673979
DOI10.1007/s10623-022-01076-6zbMath1497.94073OpenAlexW3159094447WikidataQ114849698 ScholiaQ114849698MaRDI QIDQ2673979
Keita Xagawa, Shota Yamada, Shweta Agrawal, Xiang Xie, Rajarshi Biswas, Ryo Nishimaki
Publication date: 22 September 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-022-01076-6
Cites Work
- Unnamed Item
- Unnamed Item
- Generating shorter bases for hard random lattices
- Bonsai trees, or how to delegate a lattice basis
- Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}}
- On converting CNF to DNF
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Lattice Signatures without Trapdoors
- New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques
- Unbounded HIBE and Attribute-Based Encryption
- Decentralizing Attribute-Based Encryption
- Secret-Sharing Schemes: A Survey
- Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
- Trapdoors for hard lattices and new cryptographic constructions
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
- Attribute-Based Functional Encryption on Lattices
- Fuzzy Identity-Based Encryption
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Attribute-based encryption for circuits
This page was built for publication: Cryptanalysis of Boyen's attribute-based encryption scheme in TCC 2013