Efficient revocation and threshold pairing based cryptosystems
From MaRDI portal
Publication:2943754
DOI10.1145/872035.872059zbMATH Open1321.94078OpenAlexW2146149890WikidataQ130994457 ScholiaQ130994457MaRDI QIDQ2943754FDOQ2943754
Authors: 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
Recommendations
- scientific article; zbMATH DE number 1962151
- An identity-based mediated signature scheme without trusted PKG
- Efficient revocable identity-based encryption via subset difference methods
- A fully secure revocable ID-based encryption in the standard model
- Adaptive-ID Secure Revocable Identity-Based Encryption
Cites Work
Cited In (13)
- An identity-based mediated signature scheme without trusted PKG
- An efficient certificateless multi-receiver threshold decryption scheme
- Identity-based threshold decryption on access structure
- Title not available (Why is that?)
- CCA-Secure and Revocable Certificateless Encryption with Ciphertext Evolution
- Revocable identity-based encryption revisited: security model and construction
- (Dual) server-aided revocable attribute-based encryption with decryption key exposure resistance
- Provably secure threshold public-key encryption with adaptive security and short ciphertexts
- Title not available (Why is that?)
- Efficient dynamic threshold identity-based encryption with constant-size ciphertext
- Adaptive-ID Secure Revocable Identity-Based Encryption
- Research of mediated identity-based encryption
- Efficient identity-based threshold decryption scheme from bilinear pairings
This page was built for publication: Efficient revocation and threshold pairing based cryptosystems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943754)