default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNavid Nasr Esfahani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Navid Nasr Esfahani, Douglas R. Stinson:
Rectangular, range, and restricted AONTs: Three generalizations of all-or-nothing transforms. Adv. Math. Commun. 18(1): 26-38 (2024)- [j8]Simon R. Blackburn
, Navid Nasr Esfahani, Donald L. Kreher, Douglas R. Stinson:
Constructions and Bounds for Codes With Restricted Overlaps. IEEE Trans. Inf. Theory 70(4): 2479-2490 (2024) - 2022
- [j7]Yujie Gu, Sonata Akao, Navid Nasr Esfahani, Ying Miao, Kouichi Sakurai:
On the Information-Theoretic Security of Combinatorial All-or-Nothing Transforms. IEEE Trans. Inf. Theory 68(10): 6904-6914 (2022) - [c3]Yujie Gu, Sonata Akao, Navid Nasr Esfahani, Ying Miao, Kouichi Sakurai:
On the Security Properties of Combinatorial All-or-nothing Transforms. ISIT 2022: 1447-1452 - [i12]Yujie Gu, Sonata Akao, Navid Nasr Esfahani, Ying Miao, Kouichi Sakurai:
On the Information-theoretic Security of Combinatorial All-or-nothing Transforms. CoRR abs/2202.10280 (2022) - [i11]Simon R. Blackburn, Navid Nasr Esfahani, Donald L. Kreher, Douglas R. Stinson:
Constructions and bounds for codes with restricted overlaps. CoRR abs/2211.10309 (2022) - 2021
- [b1]Navid Nasr Esfahani:
Generalizations of All-or-Nothing Transforms and their Application in Secure Distributed Storage. University of Waterloo, Ontario, Canada, 2021 - [j6]Masoumeh Shafieinejad, Navid Nasr Esfahani:
A scalable post-quantum hash-based group signature. Des. Codes Cryptogr. 89(5): 1061-1090 (2021) - [j5]Navid Nasr Esfahani, Douglas R. Stinson:
On security properties of all-or-nothing transforms. Des. Codes Cryptogr. 89(12): 2857-2867 (2021) - [i10]Navid Nasr Esfahani, Douglas R. Stinson:
Asymmetric All-or-nothing Transforms. CoRR abs/2105.14988 (2021) - [i9]Navid Nasr Esfahani, Douglas R. Stinson:
Rectangular, Range, and Restricted AONTs: Three Generalizations of All-or-Nothing Transforms. CoRR abs/2111.05961 (2021) - [i8]Navid Nasr Esfahani, Douglas R. Stinson:
On Security Properties of All-or-nothing Transforms. IACR Cryptol. ePrint Arch. 2021: 314 (2021) - [i7]Navid Nasr Esfahani, Douglas R. Stinson:
Asymmetric All-or-nothing Transforms. IACR Cryptol. ePrint Arch. 2021: 726 (2021) - [i6]Navid Nasr Esfahani, Douglas R. Stinson:
Rectangular, Range, and Restricted AONTs: Three Generalizations of All-or-Nothing Transforms. IACR Cryptol. ePrint Arch. 2021: 1498 (2021)
2010 – 2019
- 2019
- [i5]Masoumeh Shafieinejad, Navid Nasr Esfahani, Reihaneh Safavi-Naini:
A Scalable Post-quantum Hash-Based Group Signature. IACR Cryptol. ePrint Arch. 2019: 1377 (2019) - 2018
- [j4]Navid Nasr Esfahani, Ian Goldberg, Douglas R. Stinson:
Some Results on the Existence of t-All-or-Nothing Transforms Over Arbitrary Alphabets. IEEE Trans. Inf. Theory 64(4): 3136-3143 (2018) - 2017
- [j3]Navid Nasr Esfahani, Douglas R. Stinson:
Computational results on invertible matrices with the maximum number of invertible 2×2 submatrices. Australas. J Comb. 69: 130-144 (2017) - [i4]Navid Nasr Esfahani, Ian Goldberg, Douglas R. Stinson:
Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets. CoRR abs/1702.06612 (2017) - [i3]Navid Nasr Esfahani, Ian Goldberg, Douglas R. Stinson:
Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets. IACR Cryptol. ePrint Arch. 2017: 177 (2017) - 2016
- [j2]Paolo D'Arco, Navid Nasr Esfahani, Douglas R. Stinson:
All or Nothing at All. Electron. J. Comb. 23(4): 4 (2016) - 2015
- [i2]Paolo D'Arco, Navid Nasr Esfahani, Douglas R. Stinson:
All or Nothing at All. CoRR abs/1510.03655 (2015) - [i1]Paolo D'Arco, Navid Nasr Esfahani, Douglas R. Stinson:
All or Nothing at All. IACR Cryptol. ePrint Arch. 2015: 998 (2015) - 2012
- [j1]Sayyed Rasoul Mousavi, Navid Nasr Esfahani:
A GRASP algorithm for the Closest String Problem using a probability-based heuristic. Comput. Oper. Res. 39(2): 238-248 (2012) - 2010
- [c2]Shervin Shahidi, Parisa Mazrooei, Navid Nasr Esfahani, Mohammad Saraee:
Proximity User Identification Using Correlogram. Intelligent Information Processing 2010: 343-351
2000 – 2009
- 2009
- [c1]Navid Nasr Esfahani, Parisa Mazrooei, Kaveh Mahdaviani, Behnaz Omoomi:
A note on the P-time algorithms for solving the maximum independent set problem. DMO 2009: 65-70
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-02 20:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
