activity
20102023
most citedCycle structure of permutation functions over finite fields and their applications

20 citations · 97 across the 21 of their papers we have counts for

collaborators

23 papers

cs.IT2023★ 1 cited

Lattice Codes for CRYSTALS-Kyber

Shuiyin Liu, Amin Sakzad

This paper describes a constant-time lattice encoder for the National Institute of Standards and Technology (NIST) recommended post-quantum encryption algorithm: Kyber. The first m…

cs.CR2023

ACE: A Consent-Embedded privacy-preserving search on genomic database

Sara Jafarbeiki, Amin Sakzad, Ron Steinfeld +3

In this paper, we introduce ACE, a consent-embedded searchable encryption scheme. ACE enables dynamic consent management by supporting the physical deletion of associated data at t…

cs.CR2023★ 2 cited

SePEnTra: A secure and privacy-preserving energy trading mechanisms in transactive energy market

Rumpa Dasgupta, Amin Sakzad, Carsten Rudolph +1

In this paper, we design and present a novel model called SePEnTra to ensure the security and privacy of energy data while sharing with other entities during energy trading to dete…

cs.CR2022

Collaborative analysis of genomic data: vision and challenges

Sara Jafarbeiki, Raj Gaire, Amin Sakzad +2

The cost of DNA sequencing has resulted in a surge of genetic data being utilised to improve scientific research, clinical procedures, and healthcare delivery in recent years. Sinc…

cs.CR2021

PrivGenDB: Efficient and privacy-preserving query executions over encrypted SNP-Phenotype database

Sara Jafarbeiki, Amin Sakzad, Shabnam Kasra Kermanshahi +4

Searchable symmetric encryption (SSE) has been used to protect the confidentiality of genomic data while providing substring search and range queries on a sequence of genomic data,…

cs.IT2020

Comments on "Physical-layer cryptography through massive MIMO"

Amin Sakzad, Ron Steinfeld

We present two attacks on two different versions of physical layer cryptography schemes based on massive multiple-input multiple-output (MIMO). Both cryptosystems employ a singular…

cs.CR2020★ 17 cited

Towards Practical Encrypted Network Traffic Pattern Matching for Secure Middleboxes

Shangqi Lai, Xingliang Yuan, Shi-Feng Sun +4

Network Function Virtualisation (NFV) advances the adoption of composable software middleboxes. Accordingly, cloud data centres become major NFV vendors for enterprise traffic proc…

cs.CR2019★ 4 cited

Enabling Efficient Privacy-Assured Outlier Detection over Encrypted Incremental Datasets

Shangqi Lai, Xingliang Yuan, Amin Sakzad +3

Outlier detection is widely used in practice to track the anomaly on incremental datasets such as network traffic and system logs. However, these datasets often involve sensitive i…

cs.IT2019

Steepest Gradient-Based Orthogonal Precoder For Integer-Forcing MIMO

Mohammad Nur Hasan, Brian M. Kurkoski, Amin Sakzad +1

In this paper, we develop an orthogonal precoding scheme for integer-forcing (IF) linear receivers using the steepest gradient algorithm. Although this scheme can be viewed as a sp…

cs.IT2018★ 2 cited

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…

cs.IT2017

Integer-Forcing Linear Receivers: A Design Criterion for Full-Diversity STBCs

J. Harshan, Amin Sakzad, Emanuele Viterbo

In multiple-input multiple-output (MIMO) fading channels, the design criterion for full-diversity space-time block codes (STBCs) is primarily determined by the decoding method at t…

cs.IT2016★ 1 cited

Practical Encoder and Decoder for Power Constrained QC-LDPC lattices

Hassan Khodaiemehr, Mohammad-Reza Sadeghi, Amin Sakzad

LDPC lattices were the first family of lattices that equipped with iterative decoding algorithms under which they perform very well in high dimensions. In this paper, we introduce…

cs.IT2015

On Massive MIMO Physical Layer Cryptosystem

Ron Steinfeld, Amin Sakzad

In this paper, we present a zero-forcing (ZF) attack on the physical layer cryptography scheme based on massive multiple-input multiple-output (MIMO). The scheme uses singular valu…

cs.IT2015

Full Diversity Unitary Precoded Integer-Forcing

Amin Sakzad, Emanuele Viterbo

We consider a point-to-point flat-fading MIMO channel with channel state information known both at transmitter and receiver. At the transmitter side, a lattice coding scheme is emp…

cs.IT2014★ 8 cited

Phase Precoding for the Compute-and-Forward Protocol

Amin Sakzad, Emanuele Viterbo, Joseph Jean Boutros +1

The compute-and-forward (CoF) is a relaying protocol, which uses algebraic structured codes to harness the interference and remove the noise in wireless networks. We propose the us…

cs.IT2014★ 5 cited

Phase Precoded Compute-and-Forward with Partial Feedback

Amin Sakzad, Emanuele Viterbo, Joseph Jean Boutros +1

In this work, we propose phase precoding for the compute-and-forward (CoF) protocol. We derive the phase precoded computation rate and show that it is greater than the original com…

cs.IT2013

Full-Diversity Space-Time Block Codes for Integer-Forcing Linear Receivers

J. Harshan, Amin Sakzad, Emanuele Viterbo

In multiple-input multiple-output (MIMO) fading channels, the design criterion for full-diversity space-time block codes (STBCs) is primarily determined by the decoding method at t…

cs.IT2013★ 3 cited

On the performance of 1-level LDPC lattices

Mohammad-Reza Sadeghi, Amin Sakzad

The low-density parity-check (LDPC) lattices perform very well in high dimensions under generalized min-sum iterative decoding algorithm. In this work we focus on 1-level LDPC latt…

cs.IT2013★ 17 cited

On Complex LLL Algorithm for Integer Forcing Linear Receivers

Amin Sakzad, J. Harshan, Emanuele Viterbo

Integer-forcing (IF) linear receiver has been recently introduced for multiple-input multiple-output (MIMO) fading channels. The receiver has to compute an integer linear combinati…

cs.IT2012★ 1 cited

Integer-Forcing MIMO Linear Receivers Based on Lattice Reduction

Amin Sakzad, J. Harshan, Emanuele Viterbo

A new architecture called integer-forcing (IF) linear receiver has been recently proposed for multiple-input multiple-output (MIMO) fading channels, wherein an appropriate integer…

cs.IT2011★ 16 cited

Turbo Lattices: Construction and Error Decoding Performance

Amin Sakzad, Mohammad-Reza Sadeghi, Daniel Panario

In this paper a new class of lattices called turbo lattices is introduced and established. We use the lattice Construction D to produce turbo lattices. This method needs a set of n…

cs.IT2010★ 20 cited

Cycle structure of permutation functions over finite fields and their applications

Amin Sakzad, Mohammad-Reza Sadeghi, Daniel Panario

In this work we establish some new interleavers based on permutation functions. The inverses of these interleavers are known over a finite field . For the first time…

cs.IT2010

Capacity Achieving Low Density Parity Check Lattices

Mohammad-Reza Sadeghi, Amin Sakzad

The concept and existence of sphere-bound-achieving and capacity-achieving lattices has been explained on AWGN channels by Forney. LDPC lattices, introduced by Sadeghi, perform ver…