42 citations · 114 across the 25 of their papers we have counts for
6 papers · 1 filter
On the security of the hierarchical attribute based encryption scheme proposed by Wang et al
Mohammad Ali, Javad Mohajeri, Mohammad-Reza Sadeghi
Ciphertext-policy hierarchical attribute-based encryption (CP-HABE) is a promising cryptographic primitive for enforcing the fine-grained access control with scalable key delegatio…
Edge Coloring Technique to Remove Small Elementary Trapping Sets from Tanner Graph of QC-LDPC Codes with Column Weight 4
Mohammad-Reza Sadeghi, Farzane Amirzade
One of the phenomena that causes high decoding failure rates is trapping sets. Characterization of elementary trapping sets (ETSs), their graphical properties and the lower…
A Neural Network Lattice Decoding Algorithm
Mohammad-Reza Sadeghi, Farzane Amirzade, Daniel Panario +1
Neural network decoding algorithms are recently introduced by Nachmani et al. to decode high-density parity-check (HDPC) codes. In contrast with iterative decoding algorithms such…
Efficient Search of QC-LDPC Codes with Girths 6 and 8 and Free of Elementary Trapping Sets with Small Size
Farzane Amirzade, Mohammad-Reza Sadeghi
One of the phenomena that influences significantly the performance of low-density parity-check codes is known as trapping sets. An elementary trapping set, or simply an ETS…
On the algorithmic complexity of decomposing graphs into regular/irregular structures
Arash Ahadi, Ali Dehghan, Mohammad-Reza Sadeghi +1
A locally irregular graph is a graph whose adjacent vertices have distinct degrees, a regular graph is a graph where each vertex has the same degree and a locally regular graph is…
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
A Not-All-Equal (NAE) decomposition of a graph is a decomposition of the vertices of into two parts such that each vertex in has at least one neighbor in each part. Als…