default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShahram Khazaei
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Mohammad Hajiabadi, Shahram Khazaei, Behzad Vahdani:
Randomness Recoverable Secret Sharing Schemes. J. Cryptol. 37(4): 34 (2024)- 2023
- [j16]Reza Kaboli, Shahram Khazaei, Maghsoud Parviz:
On ideal and weakly-ideal access structures. Adv. Math. Commun. 17(3): 697-713 (2023) - [j15]Amir Jafari, Shahram Khazaei
:
Partial Secret Sharing Schemes. IEEE Trans. Inf. Theory 69(8): 5364-5385 (2023) - [c14]Mohammad Hajiabadi, Shahram Khazaei, Behzad Vahdani:
Randomness Recoverable Secret Sharing Schemes. ITC 2023: 12:1-12:25 - [i20]Mohammad Hajiabadi, Shahram Khazaei, Behzad Vahdani:
Randomness Recoverable Secret Sharing Schemes. IACR Cryptol. ePrint Arch. 2023: 959 (2023) - 2022
- [j14]Shahram Khazaei, Mojtaba Rafiee:
Towards More Secure Constructions of Adjustable Join Schemes. IEEE Trans. Dependable Secur. Comput. 19(2): 1078-1089 (2022) - [j13]Mojtaba Rafiee, Shahram Khazaei:
Security of Multi-Adjustable Join Schemes: Separations and Implications. IEEE Trans. Dependable Secur. Comput. 19(4): 2535-2545 (2022) - 2021
- [j12]Mojtaba Rafiee, Shahram Khazaei:
Private Set Operations Over Encrypted Cloud Dataset and Applications. Comput. J. 64(8): 1145-1162 (2021) - [j11]Fatemeh Ghasemi, Reza Kaboli, Shahram Khazaei, Maghsoud Parviz, Mohammad-Mahdi Rafiei:
On ideal homomorphic secret sharing schemes and their decomposition. Des. Codes Cryptogr. 89(9): 2079-2096 (2021) - [j10]Amir Jafari, Shahram Khazaei:
On Abelian and Homomorphic Secret Sharing Schemes. J. Cryptol. 34(4): 43 (2021) - [j9]Reza Kaboli, Shahram Khazaei, Maghsoud Parviz:
On group-characterizability of homomorphic secret sharing schemes. Theor. Comput. Sci. 891: 116-130 (2021) - 2020
- [i19]Amir Jafari, Shahram Khazaei:
Partial Secret Sharing Schemes. IACR Cryptol. ePrint Arch. 2020: 448 (2020) - [i18]Reza Kaboli, Shahram Khazaei, Maghsoud Parviz:
On Ideal and Weakly-Ideal Access Structures. IACR Cryptol. ePrint Arch. 2020: 483 (2020) - [i17]Mojtaba Rafiee, Shahram Khazaei:
Security of Multi-Adjustable Join Schemes: Separations and Implications. IACR Cryptol. ePrint Arch. 2020: 732 (2020)
2010 – 2019
- 2019
- [j8]Azam Soleimanian, Shahram Khazaei:
Publicly verifiable searchable symmetric encryption based on efficient cryptographic components. Des. Codes Cryptogr. 87(1): 123-147 (2019) - [j7]Motahhareh Gharahi, Shahram Khazaei:
Optimal linear secret sharing schemes for graph access structures on six participants. Theor. Comput. Sci. 771: 1-8 (2019) - [j6]Karim Baghery, Behzad Abdolmaleki, Shahram Khazaei, Mohammad Reza Aref:
Breaking anonymity of some recent lightweight RFID authentication protocols. Wirel. Networks 25(3): 1235-1252 (2019) - [i16]Shahram Khazaei, Mojtaba Rafiee:
Multi-Adjustable Join Scheme. IACR Cryptol. ePrint Arch. 2019: 562 (2019) - [i15]Amir Jafari, Shahram Khazaei:
On Abelian Secret Sharing: duality and separation. IACR Cryptol. ePrint Arch. 2019: 575 (2019) - [i14]Reza Kaboli, Shahram Khazaei, Maghsoud Parviz:
Group-homomorphic Secret Sharing Schemes Are Group-characterizable with Normal Subgroups. IACR Cryptol. ePrint Arch. 2019: 576 (2019) - [i13]Shahram Khazaei:
A Candidate Access Structure for Super-polynomial Lower Bound on Information Ratio. IACR Cryptol. ePrint Arch. 2019: 597 (2019) - [i12]Karim Baghery, Behzad Abdolmaleki, Shahram Khazaei, Mohammad Reza Aref:
Breaking Anonymity of Some Recent Lightweight RFID Authentication Protocols. IACR Cryptol. ePrint Arch. 2019: 1125 (2019) - 2018
- [j5]Motahhareh Gharahi, Shahram Khazaei:
Reduced access structures with four minimal qualified subsets on six participants. Adv. Math. Commun. 12(1): 199-214 (2018) - [j4]Shahram Khazaei, Mehri Rezaei-Aliabadi:
A rigorous security analysis of a decentralized electronic voting protocol in the universal composability framework. J. Inf. Secur. Appl. 43: 99-109 (2018) - [i11]Shahram Khazaei:
Conjecturally Superpolynomial Lower Bound for Share Size. IACR Cryptol. ePrint Arch. 2018: 143 (2018) - 2017
- [j3]Shahram Khazaei, Siavash Ahmadi:
Ciphertext-only attack on d × d Hill in O(d13d). Inf. Process. Lett. 118: 25-29 (2017) - [j2]Shahram Khazaei, Farokhlagha Moazami:
On the computational complexity of finding a minimal basis for the guess and determine attack. ISC Int. J. Inf. Secur. 9(2): 101-110 (2017) - [j1]Behzad Abdolmaleki, Karim Baghery, Shahram Khazaei, Mohammad Reza Aref:
Game-Based Privacy Analysis of RFID Security Schemes for Confident Authentication in IoT. Wirel. Pers. Commun. 95(4): 5057-5080 (2017) - [c13]Shahram Khazaei, Douglas Wikström:
Return Code Schemes for Electronic Voting Systems. E-VOTE-ID 2017: 198-209 - [i10]Motahhareh Gharahi, Shahram Khazaei:
Optimal Linear Secret Sharing Schemes for Graph Access Structures on Six Participants. IACR Cryptol. ePrint Arch. 2017: 1232 (2017) - 2016
- [i9]Behzad Abdolmaleki, Karim Baghery, Shahram Khazaei, Mohammad Reza Aref:
Game-Based Privacy Analysis of RFID Security Schemes for Confident Au-thentication in IoT. IACR Cryptol. ePrint Arch. 2016: 649 (2016) - 2015
- [i8]Shahram Khazaei, Siavash Ahmadi:
Ciphertext-only attack on d*d Hill in O(d13d). IACR Cryptol. ePrint Arch. 2015: 802 (2015) - 2013
- [c12]Shahram Khazaei, Douglas Wikström:
Randomized Partial Checking Revisited. CT-RSA 2013: 115-128 - 2012
- [c11]Shahram Khazaei, Tal Moran, Douglas Wikström:
A Mix-Net from Any CCA2 Secure Cryptosystem. ASIACRYPT 2012: 607-625 - [c10]Shahram Khazaei, Björn Terelius, Douglas Wikström:
Cryptanalysis of a Universally Verifiable Efficient Re-encryption Mixnet. EVT/WOTE 2012 - [i7]Shahram Khazaei, Douglas Wikström:
Randomized Partial Checking Revisited. IACR Cryptol. ePrint Arch. 2012: 63 (2012) - [i6]Shahram Khazaei, Björn Terelius, Douglas Wikström:
Cryptanalysis of a Universally Verifiable Efficient Re-encryption Mixnet. IACR Cryptol. ePrint Arch. 2012: 100 (2012) - 2010
- [b1]Shahram Khazaei:
Neutrality-Based Symmetric Cryptanalysis. EPFL, Switzerland, 2010 - [c9]Shahram Khazaei, Simon Knellwolf, Willi Meier, Deian Stefan:
Improved Linear Differential Attacks on CubeHash. AFRICACRYPT 2010: 407-418
2000 – 2009
- 2009
- [c8]Eric Brier, Shahram Khazaei, Willi Meier, Thomas Peyrin:
Linearization Framework for Collision Attacks: Application to CubeHash and MD6. ASIACRYPT 2009: 560-577 - [i5]Eric Brier, Shahram Khazaei, Willi Meier, Thomas Peyrin:
Linearization Framework for Collision Attacks: Application to CubeHash and MD6. IACR Cryptol. ePrint Arch. 2009: 382 (2009) - 2008
- [c7]Simon Fischer, Shahram Khazaei, Willi Meier:
Chosen IV Statistical Analysis for Key Recovery Attacks on Stream Ciphers. AFRICACRYPT 2008: 236-245 - [c6]Jean-Philippe Aumasson, Simon Fischer, Shahram Khazaei, Willi Meier, Christian Rechberger:
New Features of Latin Dances: Analysis of Salsa, ChaCha, and Rumba. FSE 2008: 470-488 - [c5]Shahram Khazaei, Willi Meier:
New Directions in Cryptanalysis of Self-Synchronizing Stream Ciphers. INDOCRYPT 2008: 15-26 - [c4]Shahram Khazaei, Willi Meier:
On Reconstruction of RC4 Keys from Internal States. MMICS 2008: 179-189 - [i4]Shahram Khazaei, Willi Meier:
New Directions in Cryptanalysis of Self-Synchronizing Stream Ciphers. IACR Cryptol. ePrint Arch. 2008: 369 (2008) - 2007
- [c3]Shahram Khazaei, Simon Fischer, Willi Meier:
Reduced Complexity Attacks on the Alternating Step Generator. Selected Areas in Cryptography 2007: 1-16 - [i3]Jean-Philippe Aumasson, Simon Fischer, Shahram Khazaei, Willi Meier, Christian Rechberger:
New Features of Latin Dances: Analysis of Salsa, ChaCha, and Rumba. IACR Cryptol. ePrint Arch. 2007: 472 (2007) - 2006
- [c2]Mohammad S. Kiaei, Shahrokh Ghaemmaghami, Shahram Khazaei:
Efficient Fully Format Compliant Selective Scrambling Methods for Compressed Video Streams. AICT/ICIW 2006: 42 - [c1]Tor Helleseth, Cees J. A. Jansen, Shahram Khazaei, Alexander Kholosha:
Security of Jump Controlled Sequence Generators for Stream Ciphers. SETA 2006: 141-152 - [i2]Shahram Khazaei, Mahdi M. Hasanzadeh, Mohammad S. Kiaei:
Linear Sequential Circuit Approximation of Grain and Trivium Stream Ciphers. IACR Cryptol. ePrint Arch. 2006: 141 (2006) - 2005
- [i1]Shahram Khazaei, Mahmoud Salmasizadeh, Javad Mohajeri:
On the Statistically Optimal Divide and Conquer Correlation Attack on the Shrinking Generator. IACR Cryptol. ePrint Arch. 2005: 126 (2005)
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-09-07 01:02 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:
