Mohammad Reza Aref

Mohammad Reza Aref

Auto-generated profile, based on publicly available information

Mohammad Reza Aref

Department of Electrical Engineering Sharif University of Technology Tehran Iran

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 December 2014 in Wireless Networks
Verified
Journal Article
Closed access
PDF file
MBMajid Bayat
Majid Bayat
MBMostafa Barmshoory
Mostafa Barmshoory
MRMajid Rahimi
Majid Rahimi
MAMohammd Reza Aref
Mohammd Reza Aref

23 May 2011 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
MYMohammad Hossein Yassaee
Mohammad Hossein Yassaee
MAMohammad Reza Aref
Mohammad Reza Aref
This paper deals with the problem of multicasting a set of discrete memoryless correlated sources (DMCS) over a cooperative relay network. Necessary conditions with cut-set interpretation are presented. A Joint source-Wyner-Ziv encoding/sliding window decoding scheme is proposed, in which decoding at each receiver is done with respect to an ordered partition of other nodes. For each ordered partition a set of feasibility constraints is derived. Then, utilizing the submodular property of the entropy function and a novel geometrical approach, the results of different ordered partitions are consolidated, which lead to sufficient conditions for our problem. The proposed scheme achieves operational separation between source coding and channel coding. It is shown that sufficient conditions are indeed necessary conditions in two special cooperative networks, namely, Aref network and finite-field deterministic network. Also, in Gaussian cooperative networks, it is shown that reliable transmission of all DMCS whose Slepian-Wolf region intersects the cut-set bound region within a constant number of bits, is feasible. In particular, all results of the paper are specialized to obtain an achievable rate region for cooperative relay networks which includes relay networks and two-way relay networks.

28 May 2019 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
RRReyhaneh Rabaninejad
Reyhaneh Rabaninejad
MAMahmoud Ahmadian Attari
Mahmoud Ahmadian Attari
MAMaryam Rajabzadeh Asaar
Maryam Rajabzadeh Asaar
MAMohammad Reza Aref
Mohammad Reza Aref
As data sharing has become one of the most popular services offered by cloud storage, designing public auditing mechanisms for integrity of shared data becomes more important. Two problems which arise in shared data auditing include preserving users identity and collusion resistant revocation of users. When data stored at the cloud is shared among a group of users, different users may modify and sign different data blocks which leaks signer identities to the public verifier. Also, when a user is revoked from the group, signatures generated by this user should be re-signed by the cloud server using re-signature keys. In addition, collusion of cloud server and the revoked user should leak no information about the private key of other users. In this paper, by employing a new proxy re-signature scheme, we propose a public shared data auditing mechanism that provides identity privacy and collusion resistant user revocation, simultaneously. The proposed protocol requires only lightweight computations at the user side for signing data blocks in real-time online phase. Moreover, our protocol supports large dynamic group of users, batch auditing and dynamic data operations. Experimental results demonstrate excellent efficiency of our scheme in comparison to the state of the art.

5 June 2015 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
CLCarl Löndahl
Carl Löndahl
TJThomas Johansson
Thomas Johansson
MSMasoumeh Koochak Shooshtari
Masoumeh Koochak Shooshtari
MAMahmoud Ahmadian-Attari
Mahmoud Ahmadian-Attari
MAMohammad Reza Aref
Mohammad Reza Aref

13 June 2024 in International Journal of Computational Intelligence Systems
Verified
Journal Article
Open access
PDF file
AGAli Mohammad Norouzzadeh Gilmolk
Ali Mohammad Norouzzadeh Gilmolk
MAMohammad Reza Aref
Mohammad Reza Aref
Recently, the field of lightweight cryptography (LWC) has emerged in response to the security needs of low-cost, widely used technology. It is essential to implement an encryption approach with access control to give less complex, more flexible, and safe access to sensitive data. In this work, a novel lightweight chaotic encryption approach with fuzzy access control is presented to encrypt light images in the IoT domain, while maintaining image quality. With the aid of multiplexer modeling and information shift register technology, the algorithm’s design combines random and chaotic mapping approach based on a specific password key with a predetermined number of fuzzy logic shifts on the password key for the image pixels. Further, to extract the private key with complexity and boost defense against attacks, a shift register and logical xor combination is employed. The simulation of the proposed model for AVR microcontroller has been done under MATLAB software and the design of various encryption components has been used to implement lightweight mapping. The proposed system has been evaluated in terms of histogram analysis, adjacent pixel correlation analysis, contrast analysis, homogeneity analysis, energy analysis, NIST analysis, error mean square analysis, information entropy, pixel number change rate, integrated mean change intensity, peak signal-to-noise ratio, and time complexity. Remarkably, the proposed technique has demonstrated high efficiency. The simulation results show that the homogeneity, energy, contrast, NPCR, and UACI criteria have improved by 11.5%, 13.1%, 19%, 0.53%, and 0.12%, respectively, compared to other methods in other articles.

1 September 2014
Verified
Conference Paper
Closed access
RHR. Hooshmand
R. Hooshmand
MSM. Koochak Shooshtari
M. Koochak Shooshtari
TETaraneh Eghlidos
Taraneh Eghlidos
MAM. R. Aref
M. R. Aref
This paper introduces a public key scheme based on polar codes to improve the performance of McEliece cryptosystem. By exploiting the interesting properties of polar codes, we put the encryption matrix of the proposed scheme in systematic form. Moreover, the nonsingular matrix is constructed from the generator matrix of used polar code. These proceedings lead to decrease the public and private key lengths compared with the original McEliece public key cryptosystem. We analyze the proposed scheme against known attacks on the public key cryptosystems based on channel coding. Moreover, it benefits from high code rate and proper error correction capability for reliable communication.