Cryptanalysis of Boyen's attribute-based encryption scheme in TCC 2013

DOI10.1007/S10623-022-01076-6zbMATH Open1497.94073OpenAlexW3159094447WikidataQ114849698 ScholiaQ114849698MaRDI QIDQ2673979FDOQ2673979

Authors: Shweta Agrawal, Rajarshi Biswas, Ryo Nishimaki, Keita Xagawa, Xiang Xie, Shota Yamada 

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

Recommendations

• Cryptanalysis of Tseng et al.'s authenticated encryption schemes
• A bunch of broken schemes: a simple yet powerful linear approach to analyzing security of attribute-based encryption
• Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption
• Generic constructions for chosen-ciphertext secure attribute based encryption
• Attribute-based encryption schemes with constant-size ciphertexts
• A practical compiler for attribute-based encryption: new decentralized constructions and more
• Attribute-based encryption schemes
• New proof methods for attribute-based encryption: achieving full security through selective techniques

zbMATH Keywords

latticescryptanalysisattribute-based encryptionlinear secret sharing scheme

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization
• Trapdoors for hard lattices and new cryptographic constructions
• Fuzzy Identity-Based Encryption
• Title not available (Why is that?)
• Lattice signatures without trapdoors
• Title not available (Why is that?)
• Secret-Sharing Schemes: A Survey
• 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 encryption for circuits
• Trapdoors for lattices: simpler, tighter, faster, smaller
• New proof methods for attribute-based encryption: achieving full security through selective techniques
• On converting CNF to DNF
• Decentralizing attribute-based encryption
• Unbounded HIBE and Attribute-Based Encryption
• Generating shorter bases for hard random lattices
• Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
• Bonsai trees, or how to delegate a lattice basis
• Attribute-based functional encryption on lattices
• Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}}

Cited In (2)

• A bunch of broken schemes: a simple yet powerful linear approach to analyzing security of attribute-based encryption
• Algebraic attacks against several weak variants of GVW'13 ABE

This page was built for publication: Cryptanalysis of Boyen's attribute-based encryption scheme in TCC 2013

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