LSLaltu Sardar

Laltu Sardar

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Laltu Sardar has a total of 10 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Efficient and Post-quantum Conjunctive Dynamic SSE with Strong Privacy Guarantees

    by Bibhas Chandra Das, Nilanjan Datta, Avijit Dutta, Avishek Majumder, Debdeep Mukhopadhyay, Sikhar Patranabis, Subhabrata Samajder, Laltu Sardar

  • Open Access

    Fake Me If You Can: Unforgeable Digi-Physical Academic Certificates With Instant Verifiability

    by Laltu Sardar

    Academic certificate forgery is a significant societal issue that impacts immigration controls and competitive job markets. Existing physical certificate verification processes are inefficient, relying heavily on manual methods, requiring substantial time and manpower, and are further complicated by cross-border challenges such as data protection laws. While robust blockchain-based certificate management solutions exist and are well-suited for environments where regulatory trust is lacking, their cost and complexity make them less attractive in settings where regulatory bodies are already trusted. In such practical contexts, certificate verification can be performed efficiently without the overhead associated with blockchain technologies. In this work, we introduce FastVer, a cryptographically secure, novel certificate verification framework that enables instant verification of issued certificates at the global cross-border level, as well as at domestic and university levels. Moreover, under a stronger adversarial model, we invoke the IbSM tree and propose SFastVer, a novel framework capable of revoking previously issued certificates that were authorized but issued in an unauthorized manner. Both frameworks seamlessly integrate into existing systems and policies with minimal disruption. Verification within this framework is cost-free, and maintenance costs remain remarkably low. We implement prototypes of both frameworks. The experimental results demonstrate that they are fast, highly scalable, and efficient, achieving verification times of just a few seconds per certificate.


  • Efficient keyword search on encrypted dynamic cloud data

    by Laltu Sardar, Binanda Sengupta, Sushmita Ruj

    Sensitive information is increasingly being outsourced to the cloud. In order to protect the privacy of such sensitive data, cloud users (clients) encrypt their data before outsourcing. However, this poses a difficulty to later perform search operations on the encrypted data. Searchable encryption schemes enable a client to search and retrieve the cloud data (based on the keywords present in the data) when the data is encrypted. Dynamic searchable encryption schemes allow the client to search over the encrypted cloud data even when new documents are added to or deleted from the encrypted data. There is a trade-off between security (that is measured in terms of information leaked to the cloud) and the efficiency of dynamic searchable encryption schemes. Stronger security guarantees often come at a cost of less efficiency. In this work, we propose a new dynamic searchable encryption scheme for cloud data that achieves better security guarantees and improved efficiency compared to popular dynamic searchable encryption schemes. Our scheme uses an efficient data structure that reduces storage, lookup (search) time, and database modification time. We build a prototype of our scheme and experiment on large real-life datasets. We show our scheme performs better than the existing schemes, which provide similar (or weaker) security.

  • Open Access

    FSPVDsse: A Forward Secure Publicly Verifiable Dynamic SSE scheme

    by Laltu Sardar, Sushmita Ruj

    A symmetric searchable encryption (SSE) scheme allows a client (data owner) to search on encrypted data outsourced to an untrusted cloud server. The search may either be a single keyword search or a complex query search like conjunctive or Boolean keyword search. Information leakage is quite high for dynamic SSE, where data might be updated. It has been proven that to avoid this information leakage an SSE scheme with dynamic data must be forward private. A dynamic SSE scheme is said to be forward private, if adding a keyword-document pair does not reveal any information about the previous search result with that keyword. In SSE setting, the data owner has very low computation and storage power. In this setting, though some schemes achieve forward privacy with honest-but-curious cloud, it becomes difficult to achieve forward privacy when the server is malicious, meaning that it can alter the data. Verifiable dynamic SSE requires the server to give a proof of the result of the search query. The data owner can verify this proof efficiently. In this paper, we have proposed a generic publicly verifiable dynamic SSE (DSSE) scheme that makes any forward private DSSE scheme verifiable without losing forward privacy. The proposed scheme does not require any extra storage at owner-side and requires minimal computational cost as well for the owner. Moreover, we have compared our scheme with the existing results and show that our scheme is practical.

  • Open Access

    The Secure Link Prediction Problem

    by Laltu Sardar, Sushmita Ruj

    Link Prediction is an important and well-studied problem for social networks. Given a snapshot of a graph, the link prediction problem predicts which new interactions between members are most likely to occur in the near future. As networks grow in size, data owners are forced to store the data in remote cloud servers which reveals sensitive information about the network. The graphs are therefore stored in encrypted form. We study the link prediction problem on encrypted graphs. To the best of our knowledge, this secure link prediction problem has not been studied before. We use the number of common neighbors for prediction. We present three algorithms for the secure link prediction problem. We design prototypes of the schemes and formally prove their security. We execute our algorithms in real-life datasets.

  • Open Access

    The secure link prediction problem

    by Laltu Sardar, Sushmita Ruj

    Link Prediction is an important and well-studied problem for social networks. Given a snapshot of a graph, the link prediction problem predicts which new interactions between members are most likely to occur in the near future. As networks grow in size, data owners are forced to store the data in remote cloud servers which reveals sensitive information about the network. The graphs are therefore stored in encrypted form. We study the link prediction problem on encrypted graphs. To the best of our knowledge, this secure link prediction problem has not been studied before. We use the number of common neighbors for prediction. We present three algorithms for the secure link prediction problem. We design prototypes of the schemes and formally prove their security. We execute our algorithms in real-life datasets.