default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAli Zaghian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j12]Samaneh Mashhadi
, Bagher Bagherpour, Ali Zaghian:
A non-interactive (t, n)-publicly verifiable multi-secret sharing scheme. Des. Codes Cryptogr. 90(8): 1761-1782 (2022)- 2021
- [j11]Mohsen Mousavi, Ali Zaghian, Morteza Esmaeili:
Involutory-Multiple-Lightweight MDS Matrices based on Cauchy-type Matrices. Adv. Math. Commun. 15(4): 589-610 (2021) - 2020
- [j10]Ali Zaghian, Bagher Bagherpour:
A Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions. ISC Int. J. Inf. Secur. 12(2): 91-99 (2020) - 2019
- [j9]Bagher Bagherpour, Shahrooz Janbaz, Ali Zaghian:
Optimal information ratio of secret sharing schemes on Dutch windmill graphs. Adv. Math. Commun. 13(1): 89-99 (2019) - [j8]Bagher Bagherpour, Ali Zaghian, Mahdi Sajadieh:
Sigma protocol for faster proof of simultaneous homomorphism relations. IET Inf. Secur. 13(5): 508-514 (2019) - [j7]Mohsen Mousavi, Morteza Esmaeili, Ali Zaghian:
Companion matrices and Golden-Fibonacci sequences. J. Appl. Math. Comput. 61(1-2): 101-116 (2019) - 2018
- [j6]Hadi Roohani Ghehsareh, Ali Zaghian, Sayyed Mahmood Zabetzadeh:
The use of local radial point interpolation method for solving two-dimensional linear fractional cable equation. Neural Comput. Appl. 29(10): 745-754 (2018) - 2017
- [j5]Ali Zaghian, Fakhroddin Noorbehbahani:
A novel supervised cluster adjustment method using a fast exact nearest neighbor search algorithm. Pattern Anal. Appl. 20(3): 701-715 (2017) - [j4]Ali Nakhaei Amroudi, Ali Zaghian, Mahdi Sajadieh:
A Verifiable (k, n, m)-Threshold Multi-secret Sharing Scheme Based on NTRU Cryptosystem. Wirel. Pers. Commun. 96(1): 1393-1405 (2017) - 2016
- [j3]Ali Zaghian, Hossein Mostafaei:
An MILP model for scheduling the operation of a refined petroleum products distribution system. Oper. Res. 16(3): 513-542 (2016) - 2015
- [j2]Ali Zaghian, Adel Aghajan, T. Aaron Gulliver:
The Optimal Fix-Free Code for Anti-Uniform Sources. Entropy 17(3): 1379-1386 (2015) - 2009
- [j1]Morteza Esmaeili, Ali Zaghian:
On the combinatorial structure of a class of I shortened Hamming codes and their dual-codes. Discret. Appl. Math. 157(2): 356-363 (2009)
Conference and Workshop Papers
- 2020
- [c1]Shahrooz Janbaz, Rahim Asghari, Bagher Bagherpour, Ali Zaghian:
A fast non-interactive publicly verifiable secret sharing scheme. ISCISC 2020: 7-13
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-05 21:03 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:
