Amin Sakzad

According to our database1, Amin Sakzad authored at least 35 papers between 2010 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Lattice RingCT v2.0 with Multiple Input and Output Wallets.
IACR Cryptology ePrint Archive, 2019

Short Lattice-Based One-out-of-Many Proofs and Applications to Ring Signatures.
Proceedings of the Applied Cryptography and Network Security, 2019

Lattice RingCT V2.0 with Multiple Input and Multiple Output Wallets.
Proceedings of the Information Security and Privacy - 24th Australasian Conference, 2019

2018
Performance of Möbius Interleavers for Turbo Codes.
Wireless Personal Communications, 2018

Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather than the Statistical Distance.
J. Cryptology, 2018

FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers.
IACR Cryptology ePrint Archive, 2018

Platform-independent Secure Blockchain-Based Voting System.
IACR Cryptology ePrint Archive, 2018

A Neural Network Lattice Decoding Algorithm.
Proceedings of the IEEE Information Theory Workshop, 2018

Platform-Independent Secure Blockchain-Based Voting System.
Proceedings of the Information Security - 21st International Conference, 2018

Practical Backward-Secure Searchable Encryption from Symmetric Puncturable Encryption.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

Result Pattern Hiding Searchable Encryption for Conjunctive Queries.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

Post-Quantum One-Time Linkable Ring Signature and Application to Ring Confidential Transactions in Blockchain (Lattice RingCT v1.0).
Proceedings of the Information Security and Privacy - 23rd Australasian Conference, 2018

2017
Practical Encoder and Decoder for Power Constrained QC LDPC-Lattice Codes.
IEEE Trans. Communications, 2017

Middle-Product Learning With Errors.
IACR Cryptology ePrint Archive, 2017

Integer-Forcing Linear Receivers: A Design Criterion for Full-Diversity STBCs.
Proceedings of the 2017 IEEE Wireless Communications and Networking Conference, 2017

Middle-Product Learning with Errors.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

All-But-Many Lossy Trapdoor Functions and Selective Opening Chosen-Ciphertext Security from LWE.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016
Implementation of a two-way relay network with compute-and-forward in GNU Radio.
Trans. Emerging Telecommunications Technologies, 2016

An Efficient Non-interactive Multi-client Searchable Encryption with Support for Boolean Queries.
Proceedings of the Computer Security - ESORICS 2016, 2016

2015
Full Diversity Unitary Precoded Integer-Forcing.
IEEE Trans. Wireless Communications, 2015

Minimum free distance of CCSDS turbo encoders under (Truncated) Möbius interleavers.
Proceedings of the Iran Workshop on Communication and Information Theory, 2015

On massive MIMO physical layer cryptosystem.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Cross-packing lattices for the Rician fading channel.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

2014
Unitary precoding for integer-forcing MIMO linear receivers.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Phase precoded compute-and-forward with partial feedback.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Integer-Forcing MIMO Linear Receivers Based on Lattice Reduction.
IEEE Trans. Wireless Communications, 2013

Ambiguity and Deficiency of Permutations Over Finite Fields With Linearized Difference Map.
IEEE Trans. Information Theory, 2013

On the performance of 1-level LDPC lattices.
Proceedings of the Iran Workshop on Communication and Information Theory, 2013

On complex LLL algorithm for integer forcing linear receivers.
Proceedings of the Australian Communications Theory Workshop, AusCTW 2013, Adelaide, 2013

2012
Cycle structure of permutation functions over finite fields and their applications.
Adv. in Math. of Comm., 2012

On the ergodic rate for compute-and-forward.
Proceedings of the International Symposium on Network Coding, 2012

2011
Two New Measures for Permutations: Ambiguity and Deficiency.
IEEE Trans. Information Theory, 2011

Ambiguity and deficiency of permutations from finite fields.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

2010
Codes with girth 8 Tanner graph representation.
Des. Codes Cryptogr., 2010

On cycle-free lattices with high rate label codes.
Adv. in Math. of Comm., 2010


  Loading...