IEEE Transactions on Services Computing · 2020 · 37 citations · 24 references
ComputingCloud ComputingComputer ScienceCloud InfrastructureCloud SecurityCryptographyAccess ControlAttribute-based EncryptionData EncryptionData SecurityData Security ArchitectureSecure Data SharingRevocation Schemes
Most of the organizations using the cloud-based data sharing platforms are multi-group in nature. The existing directly revocable attribute-based encryption (ABE) schemes though seem to be a good fit, but they fail to provide any effective solution for secure multi-group data sharing scenarios. To bridge this gap, we first propose <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Re</b> vocable <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ABE</b> with <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">V</b> erifiable <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">O</b> utsourced decryption (ReVO-ABE)- a directly revocable collusion-resistant ABE scheme that allows any number of user revocation and joining without affecting the secret membership keys of the nonrevoked users. Based on ReVO-ABE, we build a <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">D</b> ynamic <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">M</b> ulti- <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">G</b> roup <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">S</b> ecure <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">D</b> ata <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">S</b> haring scheme called DMG-SDS. For operations that are exclusive to multi-groups like group merge and split can be performed without affecting the attribute secret keys or membership keys of the nonrevoked users, which is not possible with any of the existing schemes. Our proposed scheme meets the necessary security requirements, and the performance assessment shows that it has much better performance benefits when compared with most the recent competitive schemes.
24
Attribute-based encryption for fine-grained access control of encrypted data
Vipul Goyal, Omkant Pandey, Amit Sahai et al. · 2006 · 5K citations
Ciphertext-Policy Attribute-Based Encryption
John Bethencourt, Amit Sahai, Brent Waters · 2007 · 4.9K citations · Full text
Charm: a framework for rapidly prototyping cryptosystems
Joseph A. Akinyele, Christina Garman, Ian Miers et al. · Journal of Cryptographic Engineering · 2013 · 664 citations