Navid Nasr Esfahani

According to our database, Navid Nasr Esfahani authored at least 15 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Constructions and Bounds for Codes With Restricted Overlaps.

Simon R. Blackburn, Navid Nasr Esfahani, Donald L. Kreher, Douglas R. Stinson

IEEE Trans. Inf. Theory, April, 2024

2022

On the Information-Theoretic Security of Combinatorial All-or-Nothing Transforms.

Yujie Gu, Sonata Akao, Navid Nasr Esfahani, Ying Miao, Kouichi Sakurai

IEEE Trans. Inf. Theory, 2022

On the Security Properties of Combinatorial All-or-nothing Transforms.

Yujie Gu, Sonata Akao, Navid Nasr Esfahani, Ying Miao, Kouichi Sakurai

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Generalizations of All-or-Nothing Transforms and their Application in Secure Distributed Storage.

Navid Nasr Esfahani

PhD thesis, 2021

Rectangular, Range, and Restricted AONTs: Three Generalizations of All-or-Nothing Transforms.

Navid Nasr Esfahani, Douglas R. Stinson

IACR Cryptol. ePrint Arch., 2021

Asymmetric All-or-nothing Transforms.

Navid Nasr Esfahani, Douglas R. Stinson

IACR Cryptol. ePrint Arch., 2021

A scalable post-quantum hash-based group signature.

Masoumeh Shafieinejad, Navid Nasr Esfahani

Des. Codes Cryptogr., 2021

On security properties of all-or-nothing transforms.

Navid Nasr Esfahani, Douglas R. Stinson

Des. Codes Cryptogr., 2021

2019

A Scalable Post-quantum Hash-Based Group Signature.

Masoumeh Shafieinejad, Navid Nasr Esfahani, Reihaneh Safavi-Naini

IACR Cryptol. ePrint Arch., 2019

2018

Some Results on the Existence of t-All-or-Nothing Transforms Over Arbitrary Alphabets.

Navid Nasr Esfahani, Ian Goldberg, Douglas R. Stinson

IEEE Trans. Inf. Theory, 2018

2017

Computational results on invertible matrices with the maximum number of invertible 2×2 submatrices.

Navid Nasr Esfahani, Douglas R. Stinson

Australas. J Comb., 2017

2016

All or Nothing at All.

Paolo D'Arco, Navid Nasr Esfahani, Douglas R. Stinson

Electron. J. Comb., 2016

2012

A GRASP algorithm for the Closest String Problem using a probability-based heuristic.

Sayyed Rasoul Mousavi, Navid Nasr Esfahani

Comput. Oper. Res., 2012

2010

Proximity User Identification Using Correlogram.

Shervin Shahidi, Parisa Mazrooei, Navid Nasr Esfahani, Mohammad Saraee

Proceedings of the Intelligent Information Processing V, 2010

2009

A note on the P-time algorithms for solving the maximum independent set problem.

Navid Nasr Esfahani, Parisa Mazrooei, Kaveh Mahdaviani, Behnaz Omoomi

Proceedings of the 2nd Conference on Data Mining and Optimization, 2009