default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDParvin Rastegari
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Gelare Oudi Ghadim
, Mohammad Dakhilalian, Parvin Rastegari, Faramarz Hendessi, Willy Susilo:
On Secure and Energy-Efficient Message Communication Protocols for Internet of Vehicles: Cryptanalysis and Improvements. IEEE Access 12: 167944-167969 (2024)- 2023
- [j10]Parichehr Dadkhah, Mohammad Dakhilalian, Parvin Rastegari:
Security Analysis and Improvement of an Access Control Scheme for Wireless Body Area Networks. ISC Int. J. Inf. Secur. 15(3) (2023) - 2022
- [j9]Parvin Rastegari, Willy Susilo:
On Random-Oracle-Free Top-Level Secure Certificateless Signature Schemes. Comput. J. 65(12): 3049-3061 (2022) - [j8]Parvin Rastegari:
Attacks to Some Recently Proposed CL-SC Schemes and Presenting a Secure Scheme with KSSTIS. ISC Int. J. Inf. Secur. 14(2): 193-213 (2022) - [j7]Parvin Rastegari, Willy Susilo:
On delegatability of MDVS schemes. J. Comput. Virol. Hacking Tech. 18(2): 71-80 (2022) - 2021
- [c5]Parvin Rastegari, Mojtaba Khalili:
Cryptanalysis and Improvement of an Access Control Protocol for Wireless Body Area Networks. ISCISC 2021: 57-62 - 2020
- [c4]Parvin Rastegari:
On the Security of Some Recently Proposed Certificateless Signcryption Schemes. ISCISC 2020: 95-100
2010 – 2019
- 2019
- [j6]Parvin Rastegari, Willy Susilo, Mohammad Dakhilalian:
Efficient Certificateless Signcryption in the Standard Model: Revisiting Luo and Wan's Scheme from Wireless Personal Communications (2018). Comput. J. 62(8): 1178-1193 (2019) - [j5]Parvin Rastegari, Mohammad Dakhilalian, Mehdi Berenjkoub, Willy Susilo:
Multi-designated verifiers signature schemes with threshold verifiability: generic pattern and a concrete scheme in the standard model. IET Inf. Secur. 13(5): 459-468 (2019) - [j4]Parvin Rastegari, Willy Susilo, Mohammad Dakhilalian:
Certificateless designated verifier signature revisited: achieving a concrete scheme in the standard model. Int. J. Inf. Sec. 18(5): 619-635 (2019) - [j3]Parvin Rastegari, Mehdi Berenjkoub, Mohammad Dakhilalian, Willy Susilo:
Universal designated verifier signature scheme with non-delegatability in the standard model. Inf. Sci. 479: 321-334 (2019) - [c3]Parvin Rastegari, Mohammad Dakhilalian:
Cryptanalysis of a Certificateless Signcryption Scheme. ISCISC 2019: 67-71 - 2017
- [j2]Parvin Rastegari, Mehdi Berenjkoub:
An efficient certificateless signcryption scheme in the standard model. ISC Int. J. Inf. Secur. 9(1): 3-16 (2017) - 2016
- [c2]Parvin Rastegari, Mehdi Berenjkoub:
An improved certificateless signcryption scheme. ISCISC 2016: 106-111 - 2014
- [j1]Parvin Rastegari, Mohammadali Khosravifard, Hamed Narimani, T. Aaron Gulliver:
On the Structure of the Minimum Average Redundancy Code for Monotone Sources. IEEE Commun. Lett. 18(4): 664-667 (2014) - [c1]Parvin Rastegari, Mehdi Berenjkoub:
A multi-signer convertible limited multi-verifier signature scheme in the standard model. ISCISC 2014: 143-148
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 2025-01-21 00:00 CET 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:
