Publications

• M. Shafieinejad, N. Nasr Esfahani. A Scalable Post-quantum Hash-Based Group Signature. Designs, Codes and Cryptography, 2021.
• N. Nasr Esfahani, I. Goldberg, D. Stinson. Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets. IEEE transaction on Information Theory: Special Issue in Memory of Solomon Golomb, 64(4), 3136–3143, 2018.
• N. Nasr Esfahani, J. van Rees. On the Relationship between (16,6,3)-Designs and Binary (25,12) Self-Orthogonal Codes, Journal of Combinatorial Mathematics and Combinatorial Computing, volume 107, 137–147, 2018.
• N. Nasr Esfahani, D. Stinson. Computational Results on Invertible Matrices with the Maximum Number of Invertible 2 × 2 Submatrices, Australian Journal of Combinatorics, issue 69-1,130–144, 2017.
• P. D’Arco, N. Nasr Esfahani, D. Stinson. All or Nothing at All. Electronic Journal of Combinatorics, 23(4), #P4.10, 2016.
• S. R. Mousavi and N. Nasr Esfahani. A GRASP algorithm for the Closest String Problem using a probability-based heuristic. Computers & OR, 238–248, 2012.
• S. Shahidi, P. Mazrooei, N. Nasr Esfahani, M. H. Saraee. Proximity User Identification using Correlogram. 6th International Conference on Intelligence Information Processing, Manchester, United Kingdom, 2010.
• N. Nasr Esfahani, P. Mazrooei, K. Mahdaviani, B. Omoomi. A Note on the Maximum Independent Set Problem. IEEE, 2nd Conference on Data Mining and Optimization, Malaysia, 2009.

Pre-prints

• N. Nasr Esfahani, D. Stinson. On Security Properties of All-or-no thing Transforms, 2021.
• N. Nasr Esfahani, D. Stinson. Asymmetric All-or-nothing Transforms, 2021.