Dually computable cryptographic accumulators and their application to attribute based encryption

DOI10.1007/978-981-99-7563-1_24MaRDI QIDQ6550662zbMATH OpenFDO

Authors Anaïs Barthoulot, Olivier Blazy, Sébastien Canard

Publication date 5 June 2024

Full work available at URL https://doi.org/10.1007/978-981-99-7563-1_24

zbMATH Keywords

attribute based encryptioncryptographic accumulatorsdual pairing vector spacespairing

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficient ciphertext policy attribute-based encryption with constant-size ciphertext and constant computation-cost
• Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization
• Computationally Efficient Dual-Policy Attribute Based Encryption with Short Ciphertext
• Fast, compact, and expressive attribute-based encryption
• Fast, compact, and expressive attribute-based encryption

Cited in

(1)

• Cryptographic accumulators: new definitions, enhanced security, and delegatable proofs

This page was built for publication: Dually computable cryptographic accumulators and their application to attribute based encryption

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