Shuai Han

Orcid: 0000-0002-8156-7089

Affiliations:
  • Shanghai Jiao Tong University, Shanghai, China


According to our database1, Shuai Han authored at least 43 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Multi-Hop Fine-Grained Proxy Re-Encryption.
IACR Cryptol. ePrint Arch., 2024

Universal Composable Password Authenticated Key Exchange for the Post-Quantum World.
IACR Cryptol. ePrint Arch., 2024

2023
Simulatable verifiable random function from the LWE assumption.
Theor. Comput. Sci., May, 2023

Fine-Grained Proxy Re-Encryption: Definitions & Constructions from LWE.
IACR Cryptol. ePrint Arch., 2023

EKE Meets Tight Security in the Universally Composable Framework.
IACR Cryptol. ePrint Arch., 2023

Almost Tight Multi-User Security under Adaptive Corruptions from LWE in the Standard Model.
IACR Cryptol. ePrint Arch., 2023

More Efficient Public-Key Cryptography with Leakage and Tamper Resilience.
IACR Cryptol. ePrint Arch., 2023

Almost Tight Multi-User Security under Adaptive Corruptions & Leakages in the Standard Model.
IACR Cryptol. ePrint Arch., 2023

On the Opportunities of Green Computing: A Survey.
CoRR, 2023

Fine-Grained Verifier NIZK and Its Applications.
Proceedings of the Public-Key Cryptography - PKC 2023, 2023

Fine-Grained Proxy Re-encryption: Definitions and Constructions from LWE.
Proceedings of the Advances in Cryptology - ASIACRYPT 2023, 2023

2022
Generic Construction of 1-out-of-<i>n</i> Oblivious Signatures.
IEICE Trans. Inf. Syst., November, 2022

Tightly CCA-secure inner product functional encryption scheme.
Theor. Comput. Sci., 2022

Privacy-Preserving Authenticated Key Exchange in the Standard Model.
IACR Cryptol. ePrint Arch., 2022

Anonymous Public Key Encryption under Corruptions.
IACR Cryptol. ePrint Arch., 2022

Fuzzy Authenticated Key Exchange with Tight Security.
Proceedings of the Computer Security - ESORICS 2022, 2022

2021
Key Encapsulation Mechanism with Tight Enhanced Security in the Multi-User Setting: Impossibility Result and Optimal Tightness.
IACR Cryptol. ePrint Arch., 2021

Authenticated Key Exchange and Signatures with Tight Security in the Standard Model.
IACR Cryptol. ePrint Arch., 2021

Pseudorandom functions in NC class from the standard LWE assumption.
Des. Codes Cryptogr., 2021

Authentication System Based on Fuzzy Extractors.
Proceedings of the Wireless Algorithms, Systems, and Applications, 2021

Optimized Paillier's Cryptosystem with Fast Encryption and Decryption.
Proceedings of the ACSAC '21: Annual Computer Security Applications Conference, Virtual Event, USA, December 6, 2021

2020
Multilinear Maps from Obfuscation.
J. Cryptol., 2020

New insights on linear cryptanalysis.
Sci. China Inf. Sci., 2020

2019
QANIZK for adversary-dependent languages and their applications.
Theor. Comput. Sci., 2019

Proofs of retrievability from linearly homomorphic structure-preserving signatures.
Int. J. Inf. Comput. Secur., 2019

Tight Leakage-Resilient CCA-Security from Quasi-Adaptive Hash Proof System.
IACR Cryptol. ePrint Arch., 2019

Strong Leakage and Tamper-Resilient PKE from Refined Hash Proof System.
Proceedings of the Applied Cryptography and Network Security, 2019

2018
Tightly SIM-SO-CCA Secure Public Key Encryption from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2018

Reusable fuzzy extractor from the decisional Diffie-Hellman assumption.
Des. Codes Cryptogr., 2018

Tightly CCA-secure identity-based encryption with ciphertext pseudorandomness.
Des. Codes Cryptogr., 2018

Super-strong RKA secure MAC, PKE and SE from tag-based hash proof system.
Des. Codes Cryptogr., 2018

Computational Robust Fuzzy Extractor.
Comput. J., 2018

Public-Key Encryption with Tight Simulation-Based Selective-Opening Security.
Comput. J., 2018

Tightly Secure Encryption Schemes against Related-Key Attacks.
Comput. J., 2018

2017
Efficient KDM-CCA Secure Public-Key Encryption via Auxiliary-Input Authenticated Encryption.
Secur. Commun. Networks, 2017

KDM-Secure Public-Key Encryption from Constant-Noise LPN.
IACR Cryptol. ePrint Arch., 2017

2016
Public key cryptosystems secure against memory leakage attacks.
IET Inf. Secur., 2016

Efficient KDM-CCA Secure Public-Key Encryption for Polynomial Functions.
IACR Cryptol. ePrint Arch., 2016

How to Make the Cramer-Shoup Cryptosystem Secure Against Linear Related-Key Attacks.
Proceedings of the Information Security and Cryptology - 12th International Conference, 2016

Homomorphic Linear Authentication Schemes from (ε)-Authentication Codes.
Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security, 2016

2014
Proofs of Retrievability Based on MRD Codes.
Proceedings of the Information Security Practice and Experience, 2014

2013
Proofs of Data Possession and Retrievability Based on MRD Codes.
IACR Cryptol. ePrint Arch., 2013

2012
Improved bounds on negativity of superpositions.
Quantum Inf. Comput., 2012


  Loading...