Mirza Ahad Baig
5 Publications
2025 | Conference Paper | IST-REx-ID: 19738 |
Acharya A, Azari K, Baig MA, Hofheinz D, Kamath C. Securely instantiating ‘Half Gates’ garbling in the standard model. In: 28th IACR International Conference on Practice and Theory of Public-Key Cryptography. Vol 15677. Springer Nature; 2025: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 M, Auerbach B, Baig MA, et al. The cost of maintaining keys in dynamic groups with applications to multicast encryption and group messaging. In: 22nd International Conference on Theory of Cryptography. Vol 15364. Springer Nature; 2024:413-443. doi:10.1007/978-3-031-78011-0_14
[Preprint]
View
| DOI
| Download Preprint (ext.)
2023 | Published | Journal Article | IST-REx-ID: 12164 |
Baig MA, Hendler D, Milani A, Travers C. Long-lived counters with polylogarithmic amortized step complexity. Distributed Computing. 2023;36: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 JF, Auerbach B, Baig MA, et al. Grafting key trees: Efficient key management for overlapping groups. In: 19th International Conference. Vol 13044. Springer Nature; 2021:222-253. 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 MA, Hendler D, Milani A, Travers C. Long-lived snapshots with polylogarithmic amortized step complexity. In: Proceedings of the 39th Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2020: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 A, Azari K, Baig MA, Hofheinz D, Kamath C. Securely instantiating ‘Half Gates’ garbling in the standard model. In: 28th IACR International Conference on Practice and Theory of Public-Key Cryptography. Vol 15677. Springer Nature; 2025: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 M, Auerbach B, Baig MA, et al. The cost of maintaining keys in dynamic groups with applications to multicast encryption and group messaging. In: 22nd International Conference on Theory of Cryptography. Vol 15364. Springer Nature; 2024:413-443. doi:10.1007/978-3-031-78011-0_14
[Preprint]
View
| DOI
| Download Preprint (ext.)
2023 | Published | Journal Article | IST-REx-ID: 12164 |
Baig MA, Hendler D, Milani A, Travers C. Long-lived counters with polylogarithmic amortized step complexity. Distributed Computing. 2023;36: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 JF, Auerbach B, Baig MA, et al. Grafting key trees: Efficient key management for overlapping groups. In: 19th International Conference. Vol 13044. Springer Nature; 2021:222-253. 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 MA, Hendler D, Milani A, Travers C. Long-lived snapshots with polylogarithmic amortized step complexity. In: Proceedings of the 39th Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2020:31-40. doi:10.1145/3382734.3406005
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS