Yao Lu

Affiliations:
  • University of Tokyo, Department of Complexity Science and Engineering, Japan
  • Chinese Academy of Sciences, Institute of Information Engineering, State Key Laboratory of Information Security, Beijing, China (PhD 2015)


According to our database1, Yao Lu authored at least 23 papers between 2012 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Small CRT-Exponent RSA Revisited.
J. Cryptol., 2019

2018
Certifying Variant of RSA with Generalized Moduli.
Proceedings of the Information and Communications Security - 20th International Conference, 2018

A Deterministic Algorithm for Computing Divisors in an Interval.
Proceedings of the Information Security and Privacy - 23rd Australasian Conference, 2018

2017
Verifiable and Exculpable Outsourced Attribute-Based Encryption for Access Control in Cloud Computing.
IEEE Trans. Dependable Secur. Comput., 2017

Fine-grained access control system based on fully outsourced attribute-based encryption.
J. Syst. Softw., 2017

Cryptanalysis of an RSA variant with moduli N=prql.
J. Math. Cryptol., 2017

Cryptanalysis of Dual RSA.
Des. Codes Cryptogr., 2017

Provably secure cloud storage for mobile networks with less computation and smaller overhead.
Sci. China Inf. Sci., 2017

Recent Progress on Coppersmith's Lattice-Based Method: A Survey.
Proceedings of the Mathematical Modelling for Next-Generation Cryptography: CREST Crypto-Math Project, 2017

2016
Improved Results on Cryptanalysis of Prime Power RSA.
Proceedings of the Information Security and Cryptology - ICISC 2016 - 19th International Conference, Seoul, South Korea, November 30, 2016

An Improved Analysis on Three Variants of the RSA Cryptosystem.
Proceedings of the Information Security and Cryptology - 12th International Conference, 2016

2015
Towards Optimal Bounds for Implicit Factorization Problem.
Proceedings of the Selected Areas in Cryptography - SAC 2015, 2015

Implicit Factorization of RSA Moduli Revisited (Short Paper).
Proceedings of the Advances in Information and Computer Security, 2015

Cryptanalysis of Variants of RSA with Multiple Small Secret Exponents.
Proceedings of the Progress in Cryptology - INDOCRYPT 2015, 2015

Solving Linear Equations Modulo Unknown Divisors: Revisited.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014
New Results on Solving Linear Equations Modulo Unknown Divisors and its Applications.
IACR Cryptol. ePrint Arch., 2014

New Partial Key Exposure Attacks on CRT-RSA with Large Public Exponents.
Proceedings of the Applied Cryptography and Network Security, 2014

2013
Improved bounds for the implicit factorization problem.
Adv. Math. Commun., 2013

Factoring RSA Modulus with Known Bits from Both p and q: A Lattice Method.
Proceedings of the Network and System Security - 7th International Conference, 2013

Factoring Multi-power RSA Modulus N = p r q with Partial Known Bits.
Proceedings of the Information Security and Privacy - 18th Australasian Conference, 2013

2012
Stronger Security Model for Public-Key Encryption with Equality Test.
Proceedings of the Pairing-Based Cryptography - Pairing 2012, 2012

Applying Time-Memory-Data Trade-Off to Plaintext Recovery Attack.
Proceedings of the Information and Communications Security - 14th International Conference, 2012

A New Variant of Time Memory Trade-Off on the Improvement of Thing and Ying's Attack.
Proceedings of the Information and Communications Security - 14th International Conference, 2012


  Loading...