Jiang Zhang

Orcid: 0000-0002-4787-0316

Affiliations:
  • State Key Laboratory of Cryptology, Beijing, China


According to our database1, Jiang Zhang authored at least 51 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
NTRU-based Bootstrapping for MK-FHEs without using Overstretched Parameters.
IACR Cryptol. ePrint Arch., 2024

Analysis and Construction of Zero-Knowledge Proofs for the MinRank Problem.
Comput. J., 2024

2023
Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge.
Theor. Comput. Sci., March, 2023

Hardness of Module-LWE with Semiuniform Seeds from Module-NTRU.
IET Inf. Secur., 2023

NEV: Faster and Smaller NTRU Encryption using Vector Decoding.
IACR Cryptol. ePrint Arch., 2023

Fast Blind Rotation for Bootstrapping FHEs.
IACR Cryptol. ePrint Arch., 2023

Blockwise Rank Decoding Problem and LRPC Codes: Cryptosystems with Smaller Sizes.
IACR Cryptol. ePrint Arch., 2023

2022
Non-Malleable Functions and their Applications.
J. Cryptol., 2022

Half-Tree: Halving the Cost of Tree Expansion in COT and DPF.
IACR Cryptol. ePrint Arch., 2022

2021
An Efficient NIZK Scheme for Privacy-Preserving Transactions Over Account-Model Blockchain.
IEEE Trans. Dependable Secur. Comput., 2021

An improved algorithm for learning sparse parities in the presence of noise.
Theor. Comput. Sci., 2021

Pushing the Limits of Valiant's Universal Circuits: Simpler, Tighter and More Compact.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
Interactive Proofs for Quantum Black-Box Computations.
IACR Cryptol. ePrint Arch., 2020

Smoothing Out Binary Linear Codes and Worst-case Sub-exponential Hardness for LPN.
IACR Cryptol. ePrint Arch., 2020

Ferret: Fast Extension for coRRElated oT with small communication.
IACR Cryptol. ePrint Arch., 2020

Pushing the Limits of Valiant's Universal Circuits: Simpler, Tighter and More Compact.
IACR Cryptol. ePrint Arch., 2020

Improved lattice-based CCA2-secure PKE in the standard model.
Sci. China Inf. Sci., 2020

A Practical NIZK Argument for Confidential Transactions over Account-Model Blockchain.
Proceedings of the Provable and Practical Security - 14th International Conference, ProvSec 2020, Singapore, November 29, 2020

Lattice-Based Cryptosystems - A Design Perspective
Springer, ISBN: 978-981-15-8426-8, 2020

2019
KDM security for identity-based encryption: Constructions and separations.
Inf. Sci., 2019

On the (Quantum) Random Oracle Methodology: New Separations and More.
IACR Cryptol. ePrint Arch., 2019

Tweaking the Asymmetry of Asymmetric-Key Cryptography on Lattices: KEMs and Signatures of Smaller Sizes.
IACR Cryptol. ePrint Arch., 2019

More Efficient MPC from Improved Triple Generation and Authenticated Garbling.
IACR Cryptol. ePrint Arch., 2019

Attribute-Based Keyword Search from Lattices.
Proceedings of the Information Security and Cryptology - 15th International Conference, 2019

Collision Resistant Hashing from Sub-exponential Learning Parity with Noise.
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

2018
Valiant's Universal Circuits Revisited: an Overall Improvement and a Lower Bound.
IACR Cryptol. ePrint Arch., 2018

On the Hardness of Learning Parity with Noise over Rings.
Proceedings of the Provable Security, 2018

2017
Anonymous Password Authenticated Key Exchange Protocol in the Standard Model.
Wirel. Pers. Commun., 2017

Towards Secure Data Distribution Systems in Mobile Cloud Computing.
IEEE Trans. Mob. Comput., 2017

Two-Round PAKE from Approximate SPH and Instantiations from Lattices.
IACR Cryptol. ePrint Arch., 2017

Collision Resistant Hashing from Learning Parity with Noise.
IACR Cryptol. ePrint Arch., 2017

Universally composable anonymous password authenticated key exchange.
Sci. China Inf. Sci., 2017

2016
Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes.
IACR Cryptol. ePrint Arch., 2016

Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN.
IACR Cryptol. ePrint Arch., 2016

Generic constructions of integrated PKE and PEKS.
Des. Codes Cryptogr., 2016

2015
Simpler Efficient Group Signatures from Lattices.
IACR Cryptol. ePrint Arch., 2015

Secure and efficient data-sharing in clouds.
Concurr. Comput. Pract. Exp., 2015

Security of the SM2 Signature Scheme Against Generalized Key Substitution Attacks.
Proceedings of the Security Standardisation Research - Second International Conference, 2015

Authenticated Key Exchange from Ideal Lattices.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

2014
PRE: Stronger security notions and efficient construction with non-interactive opening.
Theor. Comput. Sci., 2014

Authenticated Key Exchange from Ideal Lattices.
IACR Cryptol. ePrint Arch., 2014

Security Analysis of EMV Channel Establishment Protocol in An Enhanced Security Model.
Proceedings of the Information and Communications Security - 16th International Conference, 2014

Proxy Re-encryption with Unforgeable Re-encryption Keys.
Proceedings of the Cryptology and Network Security - 13th International Conference, 2014

Black-Box Separations for One-More (Static) CDH and Its Generalization.
Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

2013
Security Analysis of a Privacy-Preserving Decentralized Key-Policy Attribute-Based Encryption Scheme.
IEEE Trans. Parallel Distributed Syst., 2013

Towards a Secure Certificateless Proxy Re-Encryption Scheme.
Proceedings of the Provable Security - 7th International Conference, 2013

2012
PRE - Stronger Security Notion and Efficient Construction with New Property.
IACR Cryptol. ePrint Arch., 2012

Integrated PKE and PEKS - Stronger Security Notions and New Constructions.
IACR Cryptol. ePrint Arch., 2012

Ciphertext policy attribute-based encryption from lattices.
Proceedings of the 7th ACM Symposium on Information, Compuer and Communications Security, 2012

2011
A Ciphertext Policy Attribute-Based Encryption Scheme without Pairings.
Proceedings of the Information Security and Cryptology - 7th International Conference, 2011

A Generic Construction from Selective-IBE to Public-Key Encryption with Non-interactive Opening.
Proceedings of the Information Security and Cryptology - 7th International Conference, 2011


  Loading...