EDBT 2026 Demo / reviewers in the wild / expert
Vijay Kumar Yadav 0003
dblp:272/4007
· DBLP profile ↗
10ranked-venue papers
6as first author
10since 2021 · last 2026
0000-0002-6139-7350ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 4 · 3 first-author · 4 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021Theory of computation · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | A blockchain-assisted privacy-preserving framework for Mobile CrowdSensing
Nitish Andola, Vijay Kumar Yadav 0003 |
Pervasive Mob. Comput. | 2 |
| 2023 | PSCLS: provably secure certificateless signature scheme for IoT device on cloud
Vijay Kumar Yadav 0003, Nitish Andola, Shekhar Verma, S. Venkatesan 0002 |
J. Supercomput. | 1 |
| 2023 | P2LBS: Privacy Provisioning in Location-Based ServicesabstractThe acceptability of a location-based service (LBS) hinges on its ability to efficiently provide service while protecting both the privacy of the customer and the server's economic interests. These include the privacy of the user, point-of-interests (POIs) privacy of the service provider, and provision for anonymous payment. Existing schemes fulfill these requirements only partially. Most of the schemes protect the query privacy of the user and the privacy of the services provided by the server, however, at high computation and communication costs. We propose a privacy-provisioning location-based service(P2LBS) scheme that provides unconditional privacy to the user's query and protects the basket of services offered by the service provider from unnecessary revelation along with an inbuilt anonymous payment scheme. To ensure the authentication of the user and the server, the P2LBS scheme uses a ring signature and anonymous payment protocol respectively. Query privacy and the services' reply privacy are provided through an oblivious transfer (OT) protocol. Results show that the P2LBS scheme is efficient compared to other current state-of-the-art schemes in terms of communication and computation costs. It fulfills all the end-to-end requirements needed to make an LBS scheme viable. Vijay Kumar Yadav 0003, Nitish Andola, Shekhar Verma, S. Venkatesan 0002 |
IEEE Trans. Serv. Comput. | 1 |
| 2022 | A secure searchable encryption scheme for cloud using hash-based indexing
Nitish Andola, Sourabh Prakash, Vijay Kumar Yadav 0003, Raghav, S. Venkatesan 0002, Shekhar Verma |
J. Comput. Syst. Sci. | 3 |
| 2022 | Linkable Privacy-Preserving Scheme for Location-Based ServicesabstractQuery content privacy and location privacy of the user and point of interest (POI) of the service provider are a serious concern for location-based services (LBS). The current LBS schemes either protect the query content privacy or location privacy. To protect query content of the user and POI of the server, several schemes have been proposed based on${k}$-anonymity, Oblivious transfer (OT), private information retrieval (PIR), and homomorphic encryption. To protect location privacy, the existing schemes either use cryptographic schemes or need a trusted third party (TTP) between the server and the user. A change of location requires re-execution of the core scheme, which causes communication and computational overhead. To address these problems, we propose a linkable location-based services (L2BS) scheme that uses Modified Linkable Spontaneous Anonymous Group (MLSAG) signature scheme and the OT scheme. The proposed MLSAG scheme provides privacy-preserving authentication with privacy preserving service linking. The OT protocol protects the query content of the user and the POI of the server. When a user requests for service and sends a query to the same server second time onwards, the L2BS scheme does not require re-execution of the OT. This, L2BSWOT scheme, decreases the communication and computation costs in addition to privacy-preserving linking of past and current queries from the same user. Results show that L2BS scheme with or without the need for OT execution (L2BSWOT scheme) outperforms other existing LBS schemes in terms of communication and computation costs while satisfying all privacy requirements of an LBS. Vijay Kumar Yadav 0003, Shekhar Verma, S. Venkatesan 0002 |
IEEE Trans. Intell. Transp. Syst. | 1 |
| 2022 | Searchable encryption on the cloud: a survey
Nitish Andola, Raghav Gahlot, Vijay Kumar Yadav 0003, S. Venkatesan 0002, Shekhar Verma |
J. Supercomput. | 3 |
| 2022 | EP2LBS: efficient privacy-preserving scheme for location-based services
Vijay Kumar Yadav 0003, Nitish Andola, Shekhar Verma, S. Venkatesan 0002 |
J. Supercomput. | 1 |
| 2022 | CP2EH: a comprehensive privacy-preserving e-health scheme over cloud
Vijay Kumar Yadav 0003, Shekhar Verma, S. Venkatesan 0002 |
J. Supercomput. | 1 |
| 2021 | An efficient and light weight polynomial multiplication for ideal lattice-based cryptography
Vijay Kumar Yadav 0003, Shekhar Verma, S. Venkatesan 0002 |
Multim. Tools Appl. | 1 |
| 2021 | HSIC-based affinity measure for learning on graphs
Abhishek 0003, Vijay Kumar Yadav 0003, Shekhar Verma, S. Venkatesan 0002 |
Pattern Anal. Appl. | 3 |