| 2018 | ISIT | On the I/O Costs of Some Repair Schemes for Full-Length Reed-Solomon Codes. | Hoang Dau, Iwan M. Duursma, Hien Chu |
| 2017 | ISIT | Repairing reed-solomon codes with two erasures. | Hoang Dau, Iwan M. Duursma, Han Mao Kiah, Olgica Milenkovic |
| 2017 | ISIT | Balanced and sparse Tamo-Barg codes. | Wael Halbawi, Iwan M. Duursma, Hoang Dau, Babak Hassibi |
| 2017 | ISIT | Sector-disk codes with three global parities. | Xiao Li, Iwan M. Duursma |
| 2017 | ITA | Low bandwidth repair of the RS(10, 4) Reed-Solomon code. | Iwan M. Duursma, Hoang Dau |
| 2014 | ISIT | Distributed reed-solomon codes for simple multiple access networks. | Wael Halbawi, Tracey Ho, Hongyi Yao, Iwan M. Duursma |
| 2012 | ISIT | Multiplicative secret sharing schemes from Reed-Muller type codes. | Iwan M. Duursma, Jiashun Shen |
| 2004 | ISIT | On the vector decomposition problem for m-torsion points on an elliptic curve. | Negar Kiyavash, Iwan M. Duursma |
| 2003 | ASIACRYPT | Tate Pairing Implementation for Hyperelliptic Curves y | Iwan M. Duursma, Hyang-Sook Lee |
| 1999 | ASIACRYPT | Speeding up the Discrete Log Computation on Curves with Automorphisms. | Iwan M. Duursma, Pierrick Gaudry, Franois Morain |