Mirza Ahad Baig
5 Publications
2025 | Conference Paper | IST-REx-ID: 19738 | 
Acharya, Anasuya, et al. “Securely Instantiating ‘Half Gates’ Garbling in the Standard Model.” 28th IACR International Conference on Practice and Theory of Public-Key Cryptography, vol. 15677, Springer Nature, 2025, pp. 37–75, doi:10.1007/978-3-031-91829-2_2.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2024 | Published | Conference Paper | IST-REx-ID: 18702 |
Anastos, Michael, et al. “The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging.” 22nd International Conference on Theory of Cryptography, vol. 15364, Springer Nature, 2024, pp. 413–43, doi:10.1007/978-3-031-78011-0_14.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2023 | Published | Journal Article | IST-REx-ID: 12164 |
Baig, Mirza Ahad, et al. “Long-Lived Counters with Polylogarithmic Amortized Step Complexity.” Distributed Computing, vol. 36, Springer Nature, 2023, pp. 29–43, doi:10.1007/s00446-022-00439-5.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
2021 | Published | Conference Paper | IST-REx-ID: 10408 |
Alwen, Joel F., et al. “Grafting Key Trees: Efficient Key Management for Overlapping Groups.” 19th International Conference, vol. 13044, Springer Nature, 2021, pp. 222–53, doi:10.1007/978-3-030-90456-2_8.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
2020 | Published | Conference Paper | IST-REx-ID: 8382 |
Baig, Mirza Ahad, et al. “Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity.” Proceedings of the 39th Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 31–40, doi:10.1145/3382734.3406005.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
Grants
5 Publications
2025 | Conference Paper | IST-REx-ID: 19738 |
Acharya, Anasuya, et al. “Securely Instantiating ‘Half Gates’ Garbling in the Standard Model.” 28th IACR International Conference on Practice and Theory of Public-Key Cryptography, vol. 15677, Springer Nature, 2025, pp. 37–75, doi:10.1007/978-3-031-91829-2_2.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2024 | Published | Conference Paper | IST-REx-ID: 18702 |
Anastos, Michael, et al. “The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging.” 22nd International Conference on Theory of Cryptography, vol. 15364, Springer Nature, 2024, pp. 413–43, doi:10.1007/978-3-031-78011-0_14.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2023 | Published | Journal Article | IST-REx-ID: 12164 |
Baig, Mirza Ahad, et al. “Long-Lived Counters with Polylogarithmic Amortized Step Complexity.” Distributed Computing, vol. 36, Springer Nature, 2023, pp. 29–43, doi:10.1007/s00446-022-00439-5.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
2021 | Published | Conference Paper | IST-REx-ID: 10408 |
Alwen, Joel F., et al. “Grafting Key Trees: Efficient Key Management for Overlapping Groups.” 19th International Conference, vol. 13044, Springer Nature, 2021, pp. 222–53, doi:10.1007/978-3-030-90456-2_8.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
2020 | Published | Conference Paper | IST-REx-ID: 8382 |
Baig, Mirza Ahad, et al. “Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity.” Proceedings of the 39th Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 31–40, doi:10.1145/3382734.3406005.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS