Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity. - Mirza Ahad Baig; Danny Hendler; Alessia Milani; Corentin Travers (PODC, 2020)

PODC 2020 Review. - Mirza Ahad Baig; Alkida Balliu; Peter Davies 001; Michal Dory (SIGACT News, 2020)

Grafting Key Trees: Efficient Key Management for Overlapping Groups. - Joël Alwen; Benedikt Auerbach; Mirza Ahad Baig; Miguel Cueto; Karen Klein; Guillermo Pascual-Perez; Krzysztof Pietrzak; Michael Walter 001 (IACR Cryptol. ePrint Arch., 2021)

Efficiently Testable Circuits. - Mirza Ahad Baig; Suvradip Chakraborty; Stefan Dziembowski; Malgorzata Galazka; Tomasz Lizurej; Krzysztof Pietrzak (IACR Cryptol. ePrint Arch., 2022)

Efficiently Testable Circuits without Conductivity. - Mirza Ahad Baig; Suvradip Chakraborty; Stefan Dziembowski; Malgorzata Galazka; Tomasz Lizurej; Krzysztof Pietrzak (IACR Cryptol. ePrint Arch., 2023)

Long-lived counters with polylogarithmic amortized step complexity. - Mirza Ahad Baig; Danny Hendler; Alessia Milani; Corentin Travers (Distributed Comput., 2023)

The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging. - Michael Anastos; Benedikt Auerbach; Mirza Ahad Baig; Miguel Cueto Noval; Matthew Kwan 001; Guillermo Pascual-Perez; Krzysztof Pietrzak (IACR Cryptol. ePrint Arch., 2024)

Securely Instantiating 'Half Gates' Garbling in the Standard Model. - Anasuya Acharya; Karen Azari; Mirza Ahad Baig; Dennis Hofheinz; Chethan Kamath (IACR Cryptol. ePrint Arch., 2025)

Nakamoto Consensus from Multiple Resources. - Mirza Ahad Baig; Christoph U. Günther; Krzysztof Pietrzak (IACR Cryptol. ePrint Arch., 2025)

On the (in)security of Proofs-of-Space based Longest-Chain Blockchains. - Mirza Ahad Baig; Krzysztof Pietrzak (IACR Cryptol. ePrint Arch., 2025)