EDBT 2026 Demo / reviewers in the wild / expert
Mahdi Sajadieh
dblp:115/6532
· DBLP profile ↗
8ranked-venue papers
6as first author
2since 2021 · last 2022
0000-0003-1445-1593ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 8 · 6 first-author · 2 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Novel lightweight RFID authentication protocols for inexpensive tags
Alireza Abdellahi Khorasgani, Mahdi Sajadieh, Mohammad Rouhollah Yazdani |
J. Inf. Secur. Appl. | 2 |
| 2021 | Construction of MDS matrices from generalized Feistel structures
Mahdi Sajadieh, Mohsen Mousavi |
Des. Codes Cryptogr. | 1 |
| 2019 | Sigma protocol for faster proof of simultaneous homomorphism relationsabstractThe ‐protocols for homomorphism relations are one of the cryptographic protocols which are used to prove knowledge of homomorphism relations. The Schnorr protocol is one of the most famous ‐protocols used for proving knowledge of discrete logarithm (DL) relation in which the verifier essentially performs one double‐exponentiation (i.e. a group computation of the form a x b y ). A direct application of the Schnorr protocol for proving simultaneous knowledge of n DLs with a common base leads to a ‐protocol in which the verifier performs n double‐exponentiations. In this study, the authors propose another ‐protocol for homomorphism relations. The proposed ‐protocol has fast verification when is used to prove the simultaneous homomorphism relations with a common homomorphism. Also, when the DL instantiation (DL‐instantiation) of the proposed ‐protocol is used to prove simultaneous knowledge of n DLs with a common base, it leads to a ‐protocol in which the verifier performs n +1 single‐exponentiations. Bagher Bagherpour, Ali Zaghian, Mahdi Sajadieh |
IET Inf. Secur. | 3 |
| 2017 | A new counting method to bound the number of active S-boxes in Rijndael and 3D
Mahdi Sajadieh, Arash Mirzaei, Hamid Mala, Vincent Rijmen |
Des. Codes Cryptogr. | 1 |
| 2015 | Efficient Recursive Diffusion Layers for Block Ciphers and Hash Functions
Mahdi Sajadieh, Mohammad Dakhilalian, Hamid Mala, Pouyan Sepehrdad |
J. Cryptol. | 1 |
| 2012 | Recursive Diffusion Layers for Block Ciphers and Hash Functions
Mahdi Sajadieh, Mohammad Dakhilalian, Hamid Mala, Pouyan Sepehrdad |
FSE | 1 |
| 2012 | On construction of involutory MDS matrices from Vandermonde Matrices in GF(2 q )
Mahdi Sajadieh, Mohammad Dakhilalian, Hamid Mala, Behnaz Omoomi |
Des. Codes Cryptogr. | 1 |
| 2011 | Perfect involutory diffusion layers based on invertibility of some linear functionsabstractOne of the most important structures used in modern block ciphers is the substitution–permutation network (SPN) structure. Many block ciphers with this structure widely use Maximun Distance Separable (MDS) matrices over finite fields as their diffusion layers, for example, advanced encryption standard (AES) uses a 4×4 MDS matrix as the main part of its diffusion layer and the block cipher Khazad has an involutory 8×8 matrix. In this study, first a construction is proposed for a 4×4 linear diffusion layer that can intermix four words of arbitrary size with branch number 5. Then extend this idea for 8×8 diffusion layer using low-cost linear functions. In this construction, first, certain binary linear combinations of inputs are fed into two or three different invertible linear functions and then combined using XOR operation. In order to show the efficiency of the proposed diffusion layer, the authors exploit it in a nested SPN structure and compare its efficiency with some well-known diffusion layers such as the diffusion layer of Hierocrypt. Mahdi Sajadieh, Mohammad Dakhilalian, Hamid Mala |
IET Inf. Secur. | 1 |