BDBibhas Chandra Das

Bibhas Chandra Das

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

Bibhas Chandra Das has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Designing Quantum-Safe Conjunctive SSE: How Fast Can You Go?

    by Bibhas Das, Nilanjan Datta, Mriganka Dey, Avishek Majumder, Subhabrata Samajder

    Designing quantum-safe SSE schemes that efficiently support conjunctive queries while maintaining only a linear storage overhead relative to the database size is an important research area with growing demand. In this direction, Talapatra et al. introduced OQXT [EUROS& P’23], the first quantum-safe conjunctive SSE scheme based on hard lattice assumptions. More recently, Talapatra et al. proposed a scalable extension, NTRU-OQXT [CiC’25], built upon a scalable alternative to OQXT. To the best of our knowledge, NTRU-OQXT is the most efficient quantum-safe SSE scheme that can handle conjunctive queries. In this paper, we first discuss some security vulnerabilities in NTRU-OQXT and argue that trivial fixes would incur additional efficiency costs. To this end, we propose a variant of NTRU-OQXT, dubbed NTRU-OQXT+, that not only addresses the security vulnerabilities of NTRU-OQXT but also provides much improved performance.

  • 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

    Fault-tolerant Verifiable Dynamic SSE with Forward and Backward Privacy

    by Bibhas Chandra Das, Nilanjan Datta, Avishek Majumder, Subhabrata Samajder

    Dynamic Searchable Symmetric Encryption (DSSE) allows users to securely outsource their data to cloud servers while enabling efficient searches and updates. The verifiability property of a DSSE construction ensures that users do not accept incorrect search results from a malicious server while the fault-tolerance property guarantees the construction functions correctly even with faulty queries from the client (e.g., adding a keyword to a document multiple times, deleting a keyword from a document that was never added). There have been very few studies on fault-tolerant verifiable DSSE schemes that achieve forward privacy, and none of the existing constructions achieve backward privacy. In this paper, we aim to design an efficient fault-tolerant verifiable DSSE scheme that provides both forward and backward privacy. First, we propose a basic fault-tolerant verifiable DSSE scheme, dubbed FVS1 , which achieves forward privacy and stronger backward privacy with the update pattern (BPUP). However, the communication complexity for the search operation of this scheme is O ( u ) , where u is the total number of updates for the search keyword. To address this issue, we propose an efficient variant of the previous DSSE scheme, called FVS2 , which achieves the same functionality with an optimized communication complexity of O ( m + u ′ ) for search queries. Here m is the size of the result set and u ′ is the number of update operations made on the queried keyword after the previous search made on the keyword. This improvement comes at the cost of some additional information leakage, but it ensures the construction achieves backward privacy with the link pattern (BPLP).