Somnath Panja
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
Research Subjects
Research Interests
Somnath Panja has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Reihaneh Safavi-Naini
University of Calgary
3 shared publications - Nikita Tripathi
University of Calgary, Calgary, AB, Canada
2 shared publications - Shaoquan Jiang
University of Windsor, Windsor, ON, Canada
2 shared publications Bimal Roy
1 shared publication- Bimal Roy
Indian Statistical Institute
1 shared publication - Feng Hao
University of Warwick
1 shared publication
Latest Publications
- Open Access
- 3 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 38230-38250
Robust and Reusable Fuzzy Extractor for Low-Entropy Distributions and Application to User Authentication
Fuzzy extractors (FEs) are cryptographic primitives that generate a random key from a sample of a randomness source, together with some helper data that can be used to reproduce the key from a second sample of the source that is “close” to the first one. Reusable FEs can be used securely to derive multiple keys. Robust FEs detect any tempering with the helper data with overwhelming probability. In this paper we make two contributions. First, we construct a computationally secure, robust, and reusable FE (rrFE) that satisfies the strongest notion of reusability security, and its security reduces to the hardness of a new computational assumption that is closely related to LPN problem, for which no efficient quantum algorithm is known. The proof is in the standard model, answering an open question of Canetti et al. (Journal of Cryptology 2021). We implement and evaluate our rrFE using a widely used data set of iris data as the randomness source and compare its performance with a reusable only scheme for the same source. We also introduce and formalize password-protected fuzzy extractors (PPFEs), which use passwords as an additional source of entropy to enhance the security of biometric data against offline attacks (by a constant amount). We further present a PPFE construction with proved security. Second, we motivate and propose a new cryptographic primitive called Password Protected Message Retrieval (PPMR) that enables a user to securely store the helper data on a remote server and later securely recover it on a local device, using one round of communication without requiring a secret key and only relying on a retrieval password. The helper data is used to recover a biometric-based pre-shared key with the server. This removes the need to store sensitive biometric data on the device and allows the AKE protocol to be securely executed from any device that can correctly execute a code (e.g. an uncorrupted terminal).
- 3 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 38230-38250
Open AccessRobust and Reusable Fuzzy Extractor for Low-Entropy Distributions and Application to User Authentication
Fuzzy extractors (FEs) are cryptographic primitives that generate a random key from a sample of a randomness source, together with some helper data that can be used to reproduce the key from a second sample of the source that is “close” to the first one. Reusable FEs can be used securely to derive multiple keys. Robust FEs detect any tempering with the helper data with overwhelming probability. In this paper we make two contributions. First, we construct a computationally secure, robust, and reusable FE (rrFE) that satisfies the strongest notion of reusability security, and its security reduces to the hardness of a new computational assumption that is closely related to LPN problem, for which no efficient quantum algorithm is known. The proof is in the standard model, answering an open question of Canetti et al. (Journal of Cryptology 2021). We implement and evaluate our rrFE using a widely used data set of iris data as the randomness source and compare its performance with a reusable only scheme for the same source. We also introduce and formalize password-protected fuzzy extractors (PPFEs), which use passwords as an additional source of entropy to enhance the security of biometric data against offline attacks (by a constant amount). We further present a PPFE construction with proved security. Second, we motivate and propose a new cryptographic primitive called Password Protected Message Retrieval (PPMR) that enables a user to securely store the helper data on a remote server and later securely recover it on a local device, using one round of communication without requiring a secret key and only relying on a retrieval password. The helper data is used to recover a biometric-based pre-shared key with the server. This removes the need to store sensitive biometric data on the device and allows the AKE protocol to be securely executed from any device that can correctly execute a code (e.g. an uncorrupted terminal).
- Open Access
- 13 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 31-40
Information-Theoretically Secure, Robust, and Reusable Fuzzy Extractors for Structured Sources
- 13 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 31-40
Open AccessInformation-Theoretically Secure, Robust, and Reusable Fuzzy Extractors for Structured Sources
- Open Access
- 13 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 61-84
PUF-based AKE: Attacks, Entropy and Post-Quantum Security
- 13 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 61-84
Open AccessPUF-based AKE: Attacks, Entropy and Post-Quantum Security
- 21 August 2025
- Published by Elsevier in Theoretical Computer Science
- Vol. 1054
Hybrid encryption in correlated randomness model and KEM combiners
- 21 August 2025
- Published by Elsevier in Theoretical Computer Science
- Vol. 1054
Hybrid encryption in correlated randomness model and KEM combiners
- 1 June 2021
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 59
A secure end-to-end verifiable e-voting system using blockchain and cloud server
- 1 June 2021
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 59
A secure end-to-end verifiable e-voting system using blockchain and cloud server
- 7 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Engineering Management
- Vol. 67 (4) , 1323-1339
A Smart Contract System for Decentralized Borda Count Voting
In this article, we propose the first self-tallying decentralized e-voting protocol for a ranked-choice voting system based on Borda count. Our protocol does not need any trusted setup or tallying authority to compute the tally. The voters interact through a publicly accessible bulletin board for executing the protocol in a way that is publicly verifiable. Our main protocol consists of two rounds. In the first round, the voters publish their public keys, and in the second round they publish their randomized ballots. All voters provide Non-interactive Zero-Knowledge (NIZK) proofs to show that they have been following the protocol specification honestly without revealing their secret votes. At the end of the election, anyone including a third-party observer will be able to compute the tally without needing any tallying authority. We provide security proofs to show that our protocol guarantees the maximum privacy for each voter. We have implemented our protocol using Ethereum’s blockchain as a public bulletin board to record voting operations as publicly verifiable transactions. The experimental data obtained from our tests show the protocol’s potential for the real-world deployment.
- 7 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Engineering Management
- Vol. 67 (4) , 1323-1339
A Smart Contract System for Decentralized Borda Count Voting
In this article, we propose the first self-tallying decentralized e-voting protocol for a ranked-choice voting system based on Borda count. Our protocol does not need any trusted setup or tallying authority to compute the tally. The voters interact through a publicly accessible bulletin board for executing the protocol in a way that is publicly verifiable. Our main protocol consists of two rounds. In the first round, the voters publish their public keys, and in the second round they publish their randomized ballots. All voters provide Non-interactive Zero-Knowledge (NIZK) proofs to show that they have been following the protocol specification honestly without revealing their secret votes. At the end of the election, anyone including a third-party observer will be able to compute the tally without needing any tallying authority. We provide security proofs to show that our protocol guarantees the maximum privacy for each voter. We have implemented our protocol using Ethereum’s blockchain as a public bulletin board to record voting operations as publicly verifiable transactions. The experimental data obtained from our tests show the protocol’s potential for the real-world deployment.