Efficient revocation and threshold pairing based cryptosystems

DOI10.1145/872035.872059zbMath1321.94078OpenAlexW2146149890WikidataQ130994457 ScholiaQ130994457MaRDI QIDQ2943754

Benoît Libert, Jean-Jacques Quisquater

Publication date: 4 September 2015

Published in: Proceedings of the twenty-second annual symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/872035.872059

zbMATH Keywords

public key cryptosystemsbilinear mapsrevocation

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (9)

Identity-based threshold decryption on access structure ⋮ Efficient dynamic threshold identity-based encryption with constant-size ciphertext ⋮ Efficient identity-based threshold decryption scheme from bilinear pairings ⋮ (Dual) server-aided revocable attribute-based encryption with decryption key exposure resistance ⋮ Provably secure threshold public-key encryption with adaptive security and short ciphertexts ⋮ Revocable Identity-Based Encryption Revisited: Security Model and Construction ⋮ Adaptive-ID Secure Revocable Identity-Based Encryption ⋮ An efficient certificateless multi-receiver threshold decryption scheme ⋮ CCA-Secure and Revocable Certificateless Encryption with Ciphertext Evolution

Cites Work

• Unnamed Item

This page was built for publication: Efficient revocation and threshold pairing based cryptosystems