default search action
Nizamuddin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j7]Shamsher Ullah, Jiangbin Zheng, Nizamud Din, Muhammad Tanveer Hussain, Farhan Ullah, Mahwish Yousaf:
Elliptic Curve Cryptography; Applications, challenges, recent advances, and future trends: A comprehensive survey. Comput. Sci. Rev. 47: 100530 (2023) - [j6]Nizamud Din, Abdul Waheed, Shamsher Ullah, Noor Ul Amin, Gautam Srivastava, Farhan Ullah, Jerry Chun-Wei Lin:
A typology of secure multicast communication over 5 G/6 G networks. Int. J. Inf. Sec. 22(4): 1055-1073 (2023) - 2022
- [j5]Shamsher Ullah, Jiangbin Zheng, Muhammad Tanveer Hussain, Nizamud Din, Farhan Ullah, Muhammad Umar Farooq:
A perspective trend of hyperelliptic curve cryptosystem for lighted weighted environments. J. Inf. Secur. Appl. 70: 103346 (2022) - 2021
- [j4]Nizamud Din, Abdul Waheed, Mahdi Zareei, Faisal S. Alanazi:
An Improved Identity-Based Generalized Signcryption Scheme for Secure Multi-Access Edge Computing Empowered Flying Ad Hoc Networks. IEEE Access 9: 120704-120714 (2021) - [j3]Shamsher Ullah, Nizamud Din:
Blind signcryption scheme based on hyper elliptic curves cryptosystem. Peer-to-Peer Netw. Appl. 14(2): 917-932 (2021) - 2020
- [j2]Abdul Waheed, Arif Iqbal Umar, Mahdi Zareei, Nizamud Din, Noor Ul Amin, Jawaid Iqbal, Yousaf Saeed, Ehab Mahmoud Mohamed:
Cryptanalysis and Improvement of a Proxy Signcryption Scheme in the Standard Computational Model. IEEE Access 8: 131188-131201 (2020)
2010 – 2019
- 2019
- [c6]Tanveer Akhtar, Nizamud Din, Jamal Uddin:
Substitution Box Design Based on Chaotic Maps and Cuckoo Search Algorithm. CommNet 2019: 1-7 - 2015
- [j1]Shehzad Ashraf Chaudhry, Nizamuddin, Muhammad Sher, Anwar Ghani, Husnain Naqvi, Azeem Irshad:
An efficient signcryption scheme with forward secrecy and public verifiability based on hyper elliptic curve cryptography. Multim. Tools Appl. 74(5): 1711-1723 (2015) - [i1]Nizamud Din, Arif Iqbal Umar, Abdul Waheed, Noor Ul Amin:
An Efficient Multi-Message Multi-Receiver Signcryption Scheme with Forward Secrecy on Elliptic Curves. IACR Cryptol. ePrint Arch. 2015: 655 (2015) - 2013
- [c5]Hizbullah Khattak, Nizamuddin:
A hybrid approach for preventing Black and Gray hole attacks in MANET. ICDIM 2013: 55-57 - [c4]Mohib Ullah, Arif Iqbal Umar, Noor Ul Amin, Nizamuddin:
An efficient and secure mobile phone voting system. ICDIM 2013: 332-336 - [c3]Hizbullah Khattak, Nizamuddin, Fahad Khurshid, Noor Ul Amin:
Preventing black and gray hole attacks in AODV using optimal path routing and hash. ICNSC 2013: 645-648 - 2012
- [c2]Shehzad Ashraf Chaudhry, Nizamuddin, Muhammad Sher:
Public Verifiable Signcryption Schemes with Forward Secrecy Based on Hyperelliptic Curve Cryptosystem. ICISTM 2012: 135-142 - [c1]Noor Ul Amin, Muhammad Asad, Nizamuddin, Shehzad Ashraf Chaudhry:
An authenticated key agreement with rekeying for secured body sensor networks based on hybrid cryptosystem. ICNSC 2012: 118-121
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-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint