default search action
Samaneh Mashhadi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j30]Massoud Hadian Dehkordi
, Seyed Taghi Farahi
A verifiable essential secret image sharing scheme based on HLRs (VESIS-(t, s, k, n)). CAAI Trans. Intell. Technol. 9(2): 388-410 (2024) - [j29]Zahra Saeidi
Two meaningful secret image sharing schemes based on integer wavelet transform and LWE. Comput. Appl. Math. 43(3): 149 (2024) - [j28]Zahra Saeidi
High performance image steganography integrating IWT and Hamming code within secret sharing. IET Image Process. 18(1): 129-139 (2024) - [j27]Massoud Hadian Dehkordi
LWE-based verifiable essential secret image sharing scheme ( ( t , s , k , n ) $( {t,s,k,n} )$ - VESIS). IET Image Process. 18(4): 1053-1072 (2024) - [j26]Massoud Hadian Dehkordi, Samaneh Mashhadi
OPTP: A new steganography scheme with high capacity and security. Multim. Tools Appl. 83(6): 17579-17599 (2024) - [j25]Sara Charoghchi, Samaneh Mashhadi
A secure secret image sharing with steganography and authentication by Hamming code (15,11) for compressed images. Multim. Tools Appl. 83(11): 31933-31955 (2024) - [j24]Massoud Hadian Dehkordi, Samaneh Mashhadi, Seyed Taghi Farahi
Changeable essential threshold secret image sharing scheme with verifiability using bloom filter. Multim. Tools Appl. 83(20): 58745-58781 (2024) - [j23]Massoud Hadian Dehkordi, Samaneh Mashhadi, Seyed Taghi Farahi
Verifiable Changeable Threshold Secret Image Sharing Scheme Based on LWE Problem. Wirel. Pers. Commun. 137(2): 1099-1118 (2024) - 2023
- [j22]Samaneh Mashhadi
Game-based security proofs for verifiable secret sharing schemes in the standard model. Inf. Secur. J. A Glob. Perspect. 32(3): 163-172 (2023) - [j21]Niloofar Kiamari, Massoud Hadian Dehkordi, Samaneh Mashhadi
Non-interactive verifiable LWE-based multi secret sharing scheme. Multim. Tools Appl. 82(14): 22175-22187 (2023) - [j20]Samaneh Mashhadi
A (t,n)- Secret image sharing with steganography based on Rook polynomial and LWE problem. Multim. Tools Appl. 82(25): 39077-39097 (2023) - 2022
- [j19]Samaneh Mashhadi
A non-interactive (t, n)-publicly verifiable multi-secret sharing scheme. Des. Codes Cryptogr. 90(8): 1761-1782 (2022) - 2021
- [j18]Sara Charoghchi, Samaneh Mashhadi
Three (t, n)-secret image sharing schemes based on homogeneous linear recursion. Inf. Sci. 552: 220-243 (2021) - 2020
- [j17]Samaneh Mashhadi
Toward a formal proof for multi-secret sharing in the random oracle model. Inf. Secur. J. A Glob. Perspect. 29(5): 244-249 (2020)
2010 – 2019
- 2019
- [j16]Samaneh Mashhadi
General secret sharing based on quantum Fourier transform. Quantum Inf. Process. 18(4): 114 (2019) - [j15]Massoud Hadian Dehkordi, Samaneh Mashhadi
A Proactive Multi Stage Secret Sharing Scheme for Any Given Access Structure. Wirel. Pers. Commun. 104(1): 491-503 (2019) - 2017
- [j14]Samaneh Mashhadi
Provably secure verifiable multi-stage secret sharing scheme based on monotone span program. IET Inf. Secur. 11(6): 326-331 (2017) - [j13]Samaneh Mashhadi
New multi-stage secret sharing in the standard model. Inf. Process. Lett. 127: 43-48 (2017) - [j12]Samaneh Mashhadi
Secure publicly verifiable and proactive secret sharing schemes with general access structure. Inf. Sci. 378: 99-108 (2017) - 2016
- [j11]Samaneh Mashhadi
Analysis of Warrant Attacks on Some Threshold Proxy Signature Schemes. J. Inf. Process. Syst. 12(2): 249-262 (2016) - [j10]Samaneh Mashhadi
Share secrets stage by stage with homogeneous linear feedback shift register in the standard model. Secur. Commun. Networks 9(17): 4495-4504 (2016) - [j9]Samaneh Mashhadi
How to Fairly Share Multiple Secrets Stage by Stage. Wirel. Pers. Commun. 90(1): 93-107 (2016) - 2015
- [j8]Samaneh Mashhadi
Two verifiable multi secret sharing schemes based on nonhomogeneous linear recursion and LFSR public-key cryptosystem. Inf. Sci. 294: 31-40 (2015) - [j7]Samaneh Mashhadi
Computationally secure multiple secret sharing: models, schemes, and formal security analysis. ISC Int. J. Inf. Secur. 7(2): 91-99 (2015) - 2013
- [j6]Samaneh Mashhadi:
A Novel Non-repudiable Threshold Proxy Signature Scheme with Known Signers. Int. J. Netw. Secur. 15(4): 274-279 (2013) - 2012
- [j5]Samaneh Mashhadi:
A Novel Secure Self Proxy Signature Scheme. Int. J. Netw. Secur. 14(1): 22-26 (2012) - [j4]Samaneh Mashhadi
Analysis of frame attack on Hsu et al.'s non-repudiable threshold multi-proxy multi-signature scheme with shared verification. Sci. Iran. 19(3): 674-679 (2012)
2000 – 2009
- 2008
- [j3]Massoud Hadian Dehkordi, Samaneh Mashhadi
Verifiable secret sharing schemes based on non-homogeneous linear recursions and elliptic curves. Comput. Commun. 31(9): 1777-1784 (2008) - [j2]Massoud Hadian Dehkordi, Samaneh Mashhadi
An efficient threshold verifiable multi-secret sharing. Comput. Stand. Interfaces 30(3): 187-190 (2008) - [j1]Massoud Hadian Dehkordi, Samaneh Mashhadi
New efficient and practical verifiable multi-secret sharing schemes. Inf. Sci. 178(9): 2262-2274 (2008)
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-08-07 22:25 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: