Amin Sakzad
Amin Sakzad
Senior Lecturer, Faculty of Information Technology, Monash University
Email verificata su - Home page
Citata da
Citata da
Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
S Bai, A Langlois, T Lepoint, A Sakzad, D Stehle, R Steinfeld, 2016
Practical backward-secure searchable encryption from symmetric puncturable encryption
SF Sun, X Yuan, JK Liu, R Steinfeld, A Sakzad, V Vo, S Nepal
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications …, 2018
Result pattern hiding searchable encryption for conjunctive queries
S Lai, S Patranabis, A Sakzad, JK Liu, D Mukhopadhyay, R Steinfeld, ...
Proceedings of the 2018 ACM SIGSAC conference on computer and communications …, 2018
An efficient non-interactive multi-client searchable encryption with support for boolean queries
SF Sun, JK Liu, A Sakzad, R Steinfeld, TH Yuen
European symposium on research in computer security, 154-172, 2016
Platform-independent secure blockchain-based voting system
B Yu, JK Liu, A Sakzad, S Nepal, R Steinfeld, P Rimba, MH Au
International Conference on Information Security, 369-386, 2018
Post-quantum one-time linkable ring signature and application to ring confidential transactions in blockchain (lattice RingCT v1. 0)
WA Alberto Torres, R Steinfeld, A Sakzad, JK Liu, V Kuchta, ...
Australasian Conference on Information Security and Privacy, 558-576, 2018
Integer-forcing MIMO linear receivers based on lattice reduction
A Sakzad, J Harshan, E Viterbo
IEEE Transactions on Wireless Communications 12 (10), 4905-4915, 2013
Short Lattice-based One-out-of-Many Proofs and Applications to Ring Signatures
MF Esgin, R Steinfeld, A Sakzad, JK Liu, D Liu, 2018
Privacy-preserving COVID-19 contact tracing app: a zero-knowledge proof approach
JK Liu, MH Au, TH Yuen, C Zuo, J Wang, A Sakzad, X Luo, L Li, ...
Cryptology ePrint Archive, 2020
Middle-product learning with errors
M Roşca, A Sakzad, D Stehlé, R Steinfeld
Annual International Cryptology Conference, 283-297, 2017
FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers
RK Zhao, R Steinfeld, A Sakzad, 2018
Measure-rewind-measure: tighter quantum random oracle model proofs for one-way to hiding and CCA security
V Kuchta, A Sakzad, D Stehlé, R Steinfeld, SF Sun
Annual International Conference on the Theory and Applications of …, 2020
Practical encoder and decoder for power constrained QC-LDPC lattices
H Khodaiemehr, MR Sadeghi, A Sakzad
IEEE Transactions on Communications 65 (2), 486-500, 2016
Construction of turbo lattices
A Sakzad, MR Sadeghi, D Panario
Communication, Control, and Computing (Allerton), 2010 48th Annual Allerton …, 2010
Turbo lattices: construction and error decoding performance
A Sakzad, MR Sadeghi, D Panario
arXiv preprint arXiv:1108.1873, 2011
All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
B Libert, A Sakzad, D Stehlé, R Steinfeld
Annual International Cryptology Conference, 332-364, 2017
Cycle structure of permutation functions over finite fields and their applications
A Sakzad, MR Sadeghi, D Panario
Advances in Mathematics of Communications 6, 347-361, 2010
Two new measures for permutations: ambiguity and deficiency
D Panario, A Sakzad, B Stevens, Q Wang
IEEE transactions on information theory 57 (11), 7648-7657, 2011
Practical Non-Interactive Searchable Encryption with Forward and Backward Privacy
SF Sun, R Steinfeld, S Lai, X Yuan, A Sakzad, JK Liu, S Nepal, D Gu
The Network and Distributed System Security Symposium (NDSS), 2021
Phase precoded compute-and-forward with partial feedback
A Sakzad, E Viterbo, J Boutros, Y Hong
2014 IEEE International Symposium on Information Theory, 2117-2121, 2014
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20