Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Omid Hajihassani

dblp:212/1641 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
1since 2021 · last 2022
0000-0001-9818-3121ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 1 first-authorComputer networks · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
GPUs and heterogeneous computing · 87% Parallel and multicore computing · 13%
Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › block cipher
AES
0.412019
Fast AES Implementation: A High-Throughput Bitsliced Approach · IEEE Trans. Parallel Distributed Syst. 2019
Cryptographic primitives and cryptanalysis
symmetric cryptography
0.412019
Fast AES Implementation: A High-Throughput Bitsliced Approach · IEEE Trans. Parallel Distributed Syst. 2019
GPUs and heterogeneous computing › GPU computing
cryptographic acceleration
0.412019
Fast AES Implementation: A High-Throughput Bitsliced Approach · IEEE Trans. Parallel Distributed Syst. 2019
GPUs and heterogeneous computing
GPU computing
0.412019
Fast AES Implementation: A High-Throughput Bitsliced Approach · IEEE Trans. Parallel Distributed Syst. 2019

Methods — techniques the papers use, named apart from their topics

s-box logic circuit · 0.8bitsliced implementation · 0.8
YearPublicationVenuePosition
2022 Anonymizing Sensor Data on the Edge: A Representation Learning and Transformation Approach
abstract
The abundance of data collected by sensors in Internet of Things (IoT) devices, and the success of deep neural networks in uncovering hidden patterns in time series data have led to mounting privacy concerns. This is because private and sensitive information can be potentially learned from sensor data by applications that have access to this data. In this paper, we aim to examine the tradeoff between utility and privacy loss by learning low-dimensional representations that are useful for data obfuscation. We propose deterministic and probabilistic transformations in the latent space of a variational autoencoder to synthesize time series data such that intrusive inferences are prevented while desired inferences can still be made with sufficient accuracy. In the deterministic case, we use a linear transformation to move the representation of input data in the latent space such that the reconstructed data is likely to have the same public attribute but a different private attribute than the original input data. In the probabilistic case, we apply the linear transformation to the latent representation of input data with some probability. We compare our technique with autoencoder-based anonymization techniques and additionally show that it can anonymize data in real time on resource-constrained edge devices.
Omid Hajihassani, Omid Ardakanian, Hamzeh Khazaei
ACM Trans. Internet Things1
2019 Fast AES Implementation: A High-Throughput Bitsliced Approach
abstract
In this work, a high-throughput bitsliced AES implementation is proposed, which builds upon a new data representation scheme that exploits the parallelization capability of modern multi/many-core platforms. This representation scheme is employed as a building block to redesign all of the AES stages to tailor them for multi/many-core AES implementation. With the proposed bitsliced approach, each parallelization unit processes an unprecedented number of thirty-two 128-bit input data. Hence, a high order of prallelization is achieved by the proposed implementation technique. Based on the characteristics of this new implementation model, the ShiftRows stage can be implicitly handled through input rearrangement and is simplified to the point where its computing process can be neglected. In this implementation, costly Byte-wise operations are performed through register shift and swapping. In addition, the need for look-up table based I/O operations, which are used by the Substitute Bytes stage is eliminated through using S-box logic circuit. The S-box logic circuit is optimized to simultaneously process 32 chunks of 128-bit input data. We develop high-throughput CTR and ECB AES encryption/decryption on 6 CUDA-enabled GPUs, which achieve 1.47 and 1.38 Tbps of encryption throughput on Tesla V100 GPU, respectively.
Omid Hajihassani, Saleh Khalaj Monfared, Seyed Hossein Khasteh, Saeid Gorgin 0001
IEEE Trans. Parallel Distributed Syst.1
2018 A high-performance and energy-efficient exhaustive key search approach via GPU on DES-like cryptosystems
Armin Ahmadzadeh, Omid Hajihassani, Saeid Gorgin 0001
J. Supercomput.2