Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hema Gohain

dblp:418/7304 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0002-8643-1487ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Privacy and data protection · 30% Cryptographic primitives and cryptanalysis · 30% Cryptographic protocols and secure computation · 30%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation
key management
0.912025
Secure and Privacy Preserving Scalable GDPR Enforcement System · IEEE Trans. Serv. Comput. 2025
Privacy and data protection
privacy compliance
0.912025
Secure and Privacy Preserving Scalable GDPR Enforcement System · IEEE Trans. Serv. Comput. 2025
Cryptographic primitives and cryptanalysis
proxy re-encryption
0.912025
Secure and Privacy Preserving Scalable GDPR Enforcement System · IEEE Trans. Serv. Comput. 2025
Authentication and access control › access control
role-based access control
0.312025
Secure and Privacy Preserving Scalable GDPR Enforcement System · IEEE Trans. Serv. Comput. 2025

Methods — techniques the papers use, named apart from their topics

random oracle model · 0.9formal verification · 0.9BAN logic · 0.9
YearPublicationVenuePosition
2025 Secure and Privacy Preserving Scalable GDPR Enforcement System
abstract
Protecting personal data has become a major issue of concern in the whole world. As per the General Data Protection Regulation (GDPR), Data Owners (DO) are given back control over their data, which is maintained by the Service Providers (SP). However, SP needs to be fully GDPR compliant. In the existing GDPR enforcement technologies, DO is severely facing the scalability issue considering it has to manage separate keys for different data. Clearly, it would be highly impractical to manage such a huge and proportionally increased amount of keys for resource constrained devices of DO. Furthermore, the integrity of the data received by the Data User (DU) is not addressed in the existing works. We propose a proxy re-encryption based secure protocol where DO has to manage only one key. We propose a threat model to analyze our proposed protocol. In this analysis, we use a random oracle model to assess security and privacy. We use Burrows-Abadi-Needham (BAN) logic to verify the correctness. Simulation through AVISPA and ProVerif, formal verification tools, also confirms the security and privacy of the proposed protocol. A testbed simulation is conducted to estimate the computational, communication, and storage requirements, ensuring the practicality of the proposed protocol.
Mou Dutta, Subhasish Dhal, Hema Gohain
IEEE Trans. Serv. Comput.3