MGPV: A novel and efficient scheme for secure data sharing among mobile users in the public cloud

Vijayakumar, Pandi; Ganesh, S. Milton; Deborah, L. Jegatha; Islam, SK Hafizul; Hassan, Mohammad Mehedi; Alelaiwi, Abdulahmeed; Fortino, Giancarlo

doi:10.1016/j.future.2019.01.034

Cited by 5 publications

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This scheme is efficient in terms of certificate and signature verification cost and providing anonymity. Azees et al [25,26] proposed an efficient conditional privacy preserving scheme for VANET using bi-linear pairing. The scheme provides better efficiency in terms of fast verification on certificates, signatures, preserves anonymity among vehicle entities and revokes the privacy of misbehaving vehicles and provides conditional privacy in a computationally efficient manner.…”

Section: Plos Onementioning

confidence: 99%

Privacy preserving data sharing method for social media platforms

Yadav

Tiwari²

2023

PLoS ONE

View full text Add to dashboard Cite

Digital security as a service is a crucial aspect as it deals with user privacy provision and secure content delivery to legitimate users. Most social media platforms utilize end-to-end encryption as a significant security feature. However, multimedia data transmission in group communication is not encrypted. One of the most important objectives for a service provider is to send the desired multimedia data/service to only legitimate subscriber. Broadcast encryption is the most appropriate cryptographic primitive solution for this problem. Therefore, this study devised a construction called anonymous revocable identity-based broadcast encryption that preserves the privacy of messages broadcasted and the identity of legitimate users, where even revoked users cannot extract information about the user’s identity and sent data. The update key is broadcast periodically to non-revoked users, who can obtain the message using the update and decryption keys. A third-party can also revoke the users. It is proven that the proposed construction is semantically secure against IND-ID-CPA attacks and efficient in terms of computational cost and communication bandwidth.

show abstract

Section: Plos Onementioning

confidence: 99%

Privacy preserving data sharing method for social media platforms

Yadav

Tiwari²

2023

PLoS ONE

View full text Add to dashboard Cite

show abstract

“…The recent use of polynomial equations for group key management scheme can be attributed to Zhu and Jiang who invented a novel scheme for secure group communication based on polynomial equations 20 and its vulnerability during the registration process is cited in Reference 21. An improvised work of 20 was proposed in Reference 22 which secures the registration process and achieves less computational and communication overheads.…”

Section: A Brief Review Of the Related Literaturementioning

confidence: 99%

SPPGKM: A secure polynomial function powered group key management scheme for dynamic user environments in cloud

Manikandan¹,

Ganesh²

2022

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

In this modern era of smart cities supported by digital locker facilities, e-governance, e-healthcare, e-banking, e-learning systems, and other digital systems, People use mobile phones to upload and share sensitive documents with others. Previous group key management schemes suffer from problems such as expensive double encryptions, the need for re-encryption during every user leave operation and becoming vulnerable to attacks. Hence, to address these three issues, this manuscript introduces a pairing based cryptography based computationally efficient protocol powered by polynomial equations. First, to reduce computational overhead during group communication, the document is encrypted only once with minimal complexity before uploaded to cloud.Second, during a user leave or join operation, the re-encryption of documents in cloud is avoided in the group manager side by tactically relieving the group key parameters from the polynomial parameters. Finally, the security analysis shows that the careful handling of secure parameters of users averts the collusion attack, man-in-the-middle attack, message modification attacks, and all other possible attacks. The implementation results portray the capacity of this work to handle secure group communications in cloud storage.

show abstract

Deep multilayer percepted policy attribute Lamport certificateless signcryption for secure data access and sharing in cloud

Mala

Jayanthi

2021

Distrib Parallel Databases

View full text Add to dashboard Cite

MGPV: A novel and efficient scheme for secure data sharing among mobile users in the public cloud

Cited by 5 publications

References 18 publications

Privacy preserving data sharing method for social media platforms

Privacy preserving data sharing method for social media platforms

SPPGKM: A secure polynomial function powered group key management scheme for dynamic user environments in cloud

Deep multilayer percepted policy attribute Lamport certificateless signcryption for secure data access and sharing in cloud

Contact Info

Product

Resources

About