Follow
Navid Nasr Esfahani
Navid Nasr Esfahani
Memorial University of Newfoundland
No verified email
Title
Cited by
Cited by
Year
All or Nothing at All
P D'Arco, NN Esfahani, DR Stinson
arXiv preprint arXiv:1510.03655, 2015
262015
Some Results on the Existence of -All-or-Nothing Transforms Over Arbitrary Alphabets
NN Esfahani, I Goldberg, DR Stinson
IEEE Transactions on Information Theory 64 (4), 3136-3143, 2017
16*2017
A Scalable Post-quantum Hash-Based Group Signature.
M Shafieinejad, N Nasr Esfahani
IACR Cryptol. ePrint Arch. 2019, 1377, 2019
142019
Computational results on invertible matrices with the maximum number of invertible 2× 2 submatrices
NN Esfahani, DR Stinson
AUSTRALASIAN JOURNAL OF COMBINATORICS 69 (1), 130-144, 2017
112017
A GRASP algorithm for the Closest String Problem using a probability-based heuristic
SR Mousavi, NN Esfahani
Computers & operations research 39 (2), 238-248, 2012
82012
On security properties of all-or-nothing transforms
NN Esfahani, DR Stinson
Designs, Codes and Cryptography 89, 2857-2867, 2021
72021
Generalizations of All-or-Nothing Transforms and their Application in Secure Distributed Storage
NE Navid
University of Waterloo, 2021
62021
A note on the p-time algorithms for solving the maximum independent set problem
NN Esfahani, P Mazrooei, K Mahdaviani, B Omoomi
2009 2nd Conference on Data Mining and Optimization, 65-70, 2009
62009
Constructions and bounds for codes with restricted overlaps
SR Blackburn, NN Esfahani, DL Kreher, DR Stinson
IEEE Transactions on Information Theory, 2023
52023
Asymmetric All-or-nothing Transforms
N Nasr Esfahani, DR Stinson
arXiv e-prints, arXiv: 2105.14988, 2021
3*2021
A list of close to AONT matrices found by computer search
NN Esfahani, DR Stinson
Technical Report. Cheriton School of Computer Science, University of …, 2016
22016
Proximity user identification using correlogram
S Shahidi, P Mazrooei, NN Esfahani, M Saraee
Intelligent Information Processing V: 6th IFIP TC 12 International …, 2010
22010
On the security properties of combinatorial all-or-nothing transforms
Y Gu, S Akao, NN Esfahani, Y Miao, K Sakurai
2022 IEEE International Symposium on Information Theory (ISIT), 1447-1452, 2022
12022
On the Information-Theoretic Security of Combinatorial All-or-Nothing Transforms
Y Gu, S Akao, NN Esfahani, Y Miao, K Sakurai
IEEE Transactions on Information Theory 68 (10), 6904-6914, 2022
12022
The relationship between (16, 6, 3)-balanced incomplete block designs and (25, 12) self-orthogonal codes
NN Esfahani
University of Manitoba, 2014
12014
Rectangular, range, and restricted AONTs: Three generalizations of all-or-nothing transforms
NN Esfahani, D Stinson
arXiv preprint arXiv:2111.05961, 2021
2021
Rectangular, Range, and Restricted AONTs: Three Generalizations of All-or-Nothing Transforms
N Nasr Esfahani, D Stinson
arXiv e-prints, arXiv: 2111.05961, 2021
2021
Asymmetric All-or-nothing Transforms
D Stinson, NN Esfahani
Mathematical Cryptology 1 (1), 89-102, 2021
2021
On The Relationship between (16, 6, 3)-Designs and (25, 12) Self-Orthogonal Codes
NN Esfahani, GHJ van Rees
Journal of Combinatorial Mathematics and Combinatorial Computing 107, 137-147, 2018
2018
The relationship between (16, 6, 3)-balanced incomplete block designs and (25, 12) self-orthogonal codes
N Nasr Esfahani
2014
The system can't perform the operation now. Try again later.
Articles 1–20