#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2009

2017

- This year (0)
- Last 5 years (3)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Navid Nasr Esfahani, Ian Goldberg, Douglas R. Stinson
- IEEE Transactions on Information Theory
- 2017

A <inline-formula> <tex-math notation="LaTeX">$(t, s, v)$ </tex-math></inline-formula>-all-or-nothing transform (AONT) is a bijective mapping defined on <inline-formula> <tex-math… (More)

- Sayyed Rasoul Mousavi, Navid Nasr Esfahani
- Computers & OR
- 2012

- Shervin Shahidi, Parisa Mazrooei, Navid Nasr Esfahani, Mohammad Saraee
- Intelligent Information Processing
- 2010

This paper represents a technique, applying user action patterns in order to distinguish between users and identify them. In this method, users’ actions sequences are mapped to numerical sequences… (More)

- Navid Nasr Esfahani, Parisa Mazrooei, Kaveh Mahdaviani, Behnaz Omoomi
- 2nd Conference on Data Mining and Optimization
- 2009

In this article, the problem of finding maximum (weight) independent set (M(W)IS) is investigated. It is known that this problem belongs to the class of NP-hard problems. Although, there are… (More)

- Paolo D'Arco, Navid Nasr Esfahani, Douglas R. Stinson
- IACR Cryptology ePrint Archive
- 2015

We continue a study of unconditionally secure all-or-nothing transforms (AONT) begun by Stinson (2001). An AONT is a bijective mapping that constructs s outputs from s inputs. We consider the… (More)

- Navid Nasr Esfahani, Douglas R. Stinson
- Australasian J. Combinatorics
- 2017

A linear 2-All-or-Nothing Transform can be considered as an invertible matrix with all 2 × 2 submatrices invertible. It is known [P. D’Arco, N. Nasr Esfahani and D.R. Stinson, Electron. J. Combin.… (More)

- ‹
- 1
- ›