Mahabir Prasad Jhanwar

Orcid: 0000-0002-9753-2999

According to our database1, Mahabir Prasad Jhanwar authored at least 24 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
YouChoose: A Lightweight Anonymous Proof of Account Ownership.
IACR Cryptol. ePrint Arch., 2024

Publicly auditable privacy-preserving electoral rolls.
CoRR, 2024

2023
OpenVoting: Recoverability from Failures in Dual Voting.
IACR Cryptol. ePrint Arch., 2023

Traceable mixnets.
IACR Cryptol. ePrint Arch., 2023

Post-quantum DNSSEC over UDP via QNAME-Based Fragmentation.
Proceedings of the Security, Privacy, and Applied Cryptography Engineering, 2023

2020
PAS-TA-U: PASsword-based Threshold Authentication with PASsword Update.
IACR Cryptol. ePrint Arch., 2020

CovidBloc: A Blockchain Powered Exposure Database for Contact Tracing.
IACR Cryptol. ePrint Arch., 2020

PHyCT : Privacy preserving Hybrid Contact Tracing.
IACR Cryptol. ePrint Arch., 2020

2019
Exploiting Determinism in Lattice-based Signatures - Practical Fault Attacks on pqm4 Implementations of NIST candidates.
IACR Cryptol. ePrint Arch., 2019

Trading Accumulation Size for Witness Size: A Merkle Tree Based Universal Accumulator Via Subset Differences.
IACR Cryptol. ePrint Arch., 2019

2018
Side-channel Assisted Existential Forgery Attack on Dilithium - A NIST PQC candidate.
IACR Cryptol. ePrint Arch., 2018

Certificate Transparency Using Blockchain.
IACR Cryptol. ePrint Arch., 2018

2016
Secret Sharing for mNP: Completeness Results.
Proceedings of the Progress in Cryptology - INDOCRYPT 2016, 2016

2015
Almost Optimum Secret Sharing with Cheating Detection.
Proceedings of the Security, Privacy, and Applied Cryptography Engineering, 2015

2014
Compact Accumulator using Lattices.
IACR Cryptol. ePrint Arch., 2014

Paillier-based publicly verifiable (non-interactive) secret sharing.
Des. Codes Cryptogr., 2014

2013
Unconditionally-secure ideal robust secret sharing schemes for threshold and multilevel access structure.
J. Math. Cryptol., 2013

On the Share Efficiency of Robust Secret Sharing and Secret Sharing with Cheating Detection.
Proceedings of the Progress in Cryptology - INDOCRYPT 2013, 2013

Unconditionally-Secure Robust Secret Sharing with Minimum Share Size.
Proceedings of the Financial Cryptography and Data Security, 2013

2012
Relaxing IND-CCA: Indistinguishability against Chosen Ciphertext Verification Attack.
Proceedings of the Security, Privacy, and Applied Cryptography Engineering, 2012

2010
A Practical (Non-interactive) Publicly Verifiable Secret Sharing Scheme.
IACR Cryptol. ePrint Arch., 2010

2009
Sampling from Signed Quadratic Residues: RSA Group Is Pseudofree.
Proceedings of the Progress in Cryptology, 2009

2008
A Public Key Encryption In Standard Model Using Cramer-Shoup Paradigm.
IACR Cryptol. ePrint Arch., 2008

A Variant of Boneh-Gentry-Hamburg's Pairing-Free Identity Based Encryption Scheme.
Proceedings of the Information Security and Cryptology, 4th International Conference, 2008


  Loading...