MHMohammed Anwarul Hasan

Mohammed Anwarul Hasan

*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


Mohammed Anwarul Hasan has a total of 42 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    zkExp: Zero-Knowledge Succinct Exponentiation Proofs

    by Biniyam Deressa, M. Anwar Hasan

    We present zkExp (Zero-Knowledge Succinct Exponentiation Proofs), the first zero-knowledge proof system achieving asymptotically efficient bounds for batched exponentiation: O ~ ( k ℓ ) prover time, O ( 1 ) verification time, and constant-size (160–256 B) proofs. For statements y i = g x i ( i = 1 , … , k ) with private exponents x i , zkExp introduces four innovations to overcome long-standing scalability barriers: (1) trace-based square-and-multiply encoding, (2) lazy sumcheck for exponentiation constraints, (3) hybrid FFT decomposition reducing memory from O ( ℓ ) to O ( ℓ ) , and (4) sliding-window batching enabling single-proof aggregation via KZG commitments. The protocol is computationally sound under the ( q , ℓ ) -Generalized Diffie–Hellman Exponent (GDHE) assumption and achieves computational zero-knowledge in the random oracle model. Proofs remain 160–256 B regardless of parameter sizes, with constant verification (3.5 ms). For 4096-bit exponents, prover overhead is 16.3 × (dropping to 1.35 × in 1000-batch settings), while Ethereum verification costs ~ 267 k gas for 1000 exponentiations, 10 × cheaper than ECDSA, with memory consumption below 1.1 MB. zkExp is the first protocol to match theoretical lower bounds for exponentiation proofs while enabling practical deployment in zero-knowledge rollups, anonymous credentials, and on-chain threshold cryptography.

  • Open Access

    zkMaP: Zero-Knowledge Succinct Non-Interactive Matrix Multiplication Proofs

    by Biniyam Deressa, M. Anwar Hasan

    We introduce zkMaP (Zero-Knowledge Succinct Non-Interactive Matrix Multiplication Proofs), a novel non-interactive zero-knowledge proof system for verifying matrix multiplication with significant improvements in efficiency and scalability. Our protocol leverages KZG polynomial commitments and an innovative inner-product reduction technique to reduce the verification of n x n matrix multiplication to a single pairing equation, thereby enabling constant-time verification independent of the matrix size. In particular, zkMaP requires only two pairing operations and produces proofs as small as 320 bytes, yielding a 96 percent reduction in proof size compared to prior schemes. Furthermore, the prover's computational complexity follows the state-of-the-art at O(n^2), with experimental results demonstrating that proofs for 1024 x 1024 matrices can be generated in approximately 12.21 seconds, offering a 16.14x speedup over previous methods. Our implementation also exhibits better memory efficiency, using only 24.58 MB of prover-side RAM for 1024 x 1024 matrices, and supports scalable batch processing, achieving per-proof generation times of 46.79 milliseconds for 1024 instances while maintaining a constant verification time of 3.6 ms.


  • Open Access

    Efficient Methods for Simultaneous Homomorphic Inversion

    by Jean Belo Klamti, M. Anwarul Hasan, Koray Karabina

    Efficient implementation of some privacy-preserving algorithms and applications rely on efficient implementation of homomorphic inversion. For example, a recently proposed homomorphic image filtering algorithm and the privacy-preserving body mass index (BMI) calculations repetitively use homomorphic inversion. In this paper, inspired by Montgomery's trick to perform simultaneous plaintext inversion, we tackle the simultaneous homomorphic inversion problem to compute s inverses simultaneously over ciphertexts. The advantage of Montgomery's trick for plaintext arithmetic is well-known. We first observe that the advantage can quickly vanish when homomorphic encryption is employed because of the increased depth of the circuits. Therefore, we propose three algorithms (Montgomery's trick and two other variants) that reduce the number of homomorphic inversions from s to 1 and that offer different levels of trade-offs between the number of multiplications and the circuit depth. We provide a theoretical complexity analysis of our algorithms and implement them using the CKKS scheme in the OpenFHE library. Our experiments show that, for some cases, the run time of homomorphic s-inversion can be improved up to 35 percent while in some other cases, regular inversion seems to outperform Montgomery-based inversion algorithms.

  • Self-Tallying E-Voting Using Homomorphic Time-Lock Puzzles and ZK-SNARKs

    by Muhammad ElSheikh, Amr M. Youssef, M. Anwar Hasan

    Achieving fairness, verifiability, and abandon resistance poses challenges within e-voting protocols. This paper introduces a privacy-preserving self-tallying e-voting system leveraging blockchain technology. The system supports diverse e-voting models, including ‘Yes/No’, approval voting with multiple candidates, and score voting. By employing linearly homomorphic time-lock puzzles (LHTLPs) along with verifiable delay functions (VDFs) and zero-knowledge Succinct Non-interactive Argument of Knowledge schemes (zk-SNARKs), the proposed system ensures crucial security properties, including voter anonymity and eligibility, as well as ballot privacy and validity. It also provides efficient individual and universal verifiability (end-to-end verifiability), and dispute-freeness. More importantly, the system demonstrates fairness and abandon resistance. Furthermore, the evaluation of the proof-of-concept implementation on the Ethereum blockchain indicates that on-chain gas costs are either fixed or increasing slowly and logarithmically with the number of voters.


  • AdChain: Decentralized Header Bidding

    by Behkish Nassirzadeh, Albert Heinle, Stefanos Leonardos, Anwar Hasan, Vijay Ganesh


  • Open Access

    Sharing the Path: A Threshold Scheme from Isogenies and Error Correcting Codes

    by Mohamadou Sall, M. Anwar Hasan

    In 2022, a prominent supersingular isogeny-based cryptographic scheme, namely SIDH, was compromised by a key recovery attack. However, this attack does not undermine the isogeny path problem, which remains central to the security of isogeny-based cryptography. Following the attacks by Castryck and Decru, as well as Maino and Martindale, Robert gave a mature and polynomial-time algorithm that transforms the SIDH key recovery attack into a valuable cryptographic tool. In this paper, we combine this tool with advanced encoding techniques to construct a novel threshold scheme.

  • Open Access

    AdChain: Decentralized Header Bidding

    by Behkish Nassirzadeh, Albert Heinle, Stefanos Leonardos, Anwar Hasan, Vijay Ganesh

    Due to the involvement of multiple intermediaries without trusted parties, lack of proper regulations, and a complicated supply chain, ad impression discrepancy affects online advertising. This issue causes up to $82 billion annual revenue loss for honest parties. The loss can be significantly reduced with a precise and trusted decentralized mechanism. This paper presents AdChain, a decentralized, distributed, and verifiable solution that detects and minimizes online advertisement impression discrepancies. AdChain establishes trust by employing multiple independent agents to receive and record log-level data, along with a consensus protocol to validate each ad data. AdChain is scalable, efficient, and compatible with the current infrastructure. Our experimental evaluation, using over half a million ad data points, identifies system parameters that achieve 98% accuracy, reducing the ad discrepancy rate from 20% to 2%. Our cost analysis shows that active nodes on AdChain can generate profits comparable to miners on major blockchain networks like Bitcoin.