VLDB 2026 Research / reviewers in the wild / expert
Yao Lu 0002
dblp:26/5662-2
· DBLP profile ↗
17ranked-venue papers
7as first author
0since 2021 · last 2019
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 15 · 7 first-authorSoftware engineering, systems software and programming languages · 1Applied, interdisciplinary, general and emerging computing · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
5 papers |
Cryptographic primitives and cryptanalysis · 81% Systems and software security · 9% Cryptographic protocols and secure computation · 9% | |
| Computer architecture, parallel and distributed computing, and storage systems
2 papers |
Cloud and datacenter computing · 100% |
Topics — the 10 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › public-key cryptography
RSA |
0.7 | 2 | 2019 | Small CRT-Exponent RSA Revisited · J. Cryptol. 2019 Small CRT-Exponent RSA Revisited · EUROCRYPT (2) 2017 |
Cryptographic primitives and cryptanalysis › public-key cryptography › RSA
small CRT-exponent RSA |
0.7 | 2 | 2019 | Small CRT-Exponent RSA Revisited · J. Cryptol. 2019 Small CRT-Exponent RSA Revisited · EUROCRYPT (2) 2017 |
Cryptographic primitives and cryptanalysis
public-key cryptography |
0.4 | 1 | 2019 | Small CRT-Exponent RSA Revisited · J. Cryptol. 2019 |
Cryptographic primitives and cryptanalysis › functional encryption
attribute-based encryption |
0.3 | 1 | 2017 | Verifiable and Exculpable Outsourced Attribute-Based Encryption for Access Control in Cloud Computing · IEEE Trans. Dependable Secur. Comput. 2017 |
Systems and software security › cloud security
cloud storage security |
0.3 | 1 | 2017 | Provably secure cloud storage for mobile networks with less computation and smaller overhead · Sci. China Inf. Sci. 2017 |
Cryptographic primitives and cryptanalysis › functional encryption › attribute-based encryption
outsourced decryption |
0.3 | 1 | 2017 | Verifiable and Exculpable Outsourced Attribute-Based Encryption for Access Control in Cloud Computing · IEEE Trans. Dependable Secur. Comput. 2017 |
Cryptographic protocols and secure computation › verifiable computation
verifiable outsourced computation |
0.3 | 1 | 2017 | Verifiable and Exculpable Outsourced Attribute-Based Encryption for Access Control in Cloud Computing · IEEE Trans. Dependable Secur. Comput. 2017 |
Cryptographic primitives and cryptanalysis › lattice attack
coppersmith's method |
0.2 | 1 | 2015 | Solving Linear Equations Modulo Unknown Divisors: Revisited · ASIACRYPT (1) 2015 |
Cloud and datacenter computing › cloud security
cloud access control |
0.1 | 1 | 2017 | Verifiable and Exculpable Outsourced Attribute-Based Encryption for Access Control in Cloud Computing · IEEE Trans. Dependable Secur. Comput. 2017 |
Cloud and datacenter computing › cloud storage
mobile cloud storage |
0.1 | 1 | 2017 | Provably secure cloud storage for mobile networks with less computation and smaller overhead · Sci. China Inf. Sci. 2017 |
Methods — techniques the papers use, named apart from their topics
provable security · 0.6cryptographic protocol design · 0.6ciphertext-policy attribute-based key encapsulation · 0.6lattice-based cryptanalysis · 0.4cryptanalysis · 0.3lattice reduction · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Small CRT-Exponent RSA Revisited
Atsushi Takayasu, Yao Lu 0002, Liqiang Peng |
J. Cryptol. | 2 |
| 2018 | A Deterministic Algorithm for Computing Divisors in an Interval
Liqiang Peng, Yao Lu 0002, Noboru Kunihiro, Rui Zhang 0002, Lei Hu 0003 |
ACISP | 2 |
| 2018 | Certifying Variant of RSA with Generalized Moduli
Yao Lu 0002, Noboru Kunihiro, Rui Zhang 0002, Liqiang Peng, Hui Ma 0002 |
ICICS | 1 |
| 2017 | Small CRT-Exponent RSA Revisited
Atsushi Takayasu, Yao Lu 0002, Liqiang Peng |
EUROCRYPT (2) | 2 |
| 2017 | Provably secure cloud storage for mobile networks with less computation and smaller overhead
Rui Zhang 0002, Hui Ma 0002, Yao Lu 0002, Yang Li 0192 |
Sci. China Inf. Sci. | 3 |
| 2017 | Cryptanalysis of Dual RSA
Liqiang Peng, Lei Hu 0003, Yao Lu 0002, Jun Xu 0022, Zhangjie Huang |
Des. Codes Cryptogr. | 3 |
| 2017 | Fine-grained access control system based on fully outsourced attribute-based encryption
Rui Zhang 0002, Hui Ma 0002, Yao Lu 0002 |
J. Syst. Softw. | 3 |
| 2017 | Verifiable and Exculpable Outsourced Attribute-Based Encryption for Access Control in Cloud ComputingabstractWe propose two ciphertext-policy attribute-based key encapsulation mechanism (CP-AB-KEM) schemes that for the first time achieve both outsourced encryption and outsourced decryption in two system storage models and give corresponding security analysis. In our schemes, heavy computations are outsourced to Encryption Service Providers (ESPs) or Decryption Service Providers (DSPs), leaving only one modular exponentiation computation for the sender or the receiver. Moreover, we propose a general verification mechanism for a wide class of ciphertext-policy (cf. key-policy) AB-KEM schemes, which can check the correctness of the outsourced encryption and decryption efficiently. Concretely, we introduce a stronger version of verifiability (cf. [1] ) and a new security notion for outsourced decryption called exculpability, which guarantees that a user cannot accuse DSP of returning incorrect results while it is not the case. With all these mechanisms, any dispute between a user and an outsource computation service provider can be easily resolved, furthermore, a service provider will be less motivated to give out wrong results. Finally, we implement our schemes in Charm [2] , and the results indicate that the proposed schemes/mechanisms are efficient and practical. Hui Ma 0002, Rui Zhang 0002, Zhiguo Wan, Yao Lu 0002, Suqing Lin |
IEEE Trans. Dependable Secur. Comput. | 4 |
| 2016 | An Improved Analysis on Three Variants of the RSA Cryptosystem
Liqiang Peng, Lei Hu 0003, Yao Lu 0002, Hongyun Wei |
Inscrypt | 3 |
| 2015 | Solving Linear Equations Modulo Unknown Divisors: Revisited
Yao Lu 0002, Rui Zhang 0002, Liqiang Peng, Dongdai Lin |
ASIACRYPT (1) | 1 |
| 2015 | Towards Optimal Bounds for Implicit Factorization Problem
Yao Lu 0002, Liqiang Peng, Rui Zhang 0002, Lei Hu 0003, Dongdai Lin |
SAC | 1 |
| 2014 | New Partial Key Exposure Attacks on CRT-RSA with Large Public Exponents
Yao Lu 0002, Rui Zhang 0002, Dongdai Lin |
ACNS | 1 |
| 2013 | Factoring Multi-power RSA Modulus N = p r q with Partial Known Bits
Yao Lu 0002, Rui Zhang 0002, Dongdai Lin |
ACISP | 1 |
| 2013 | Factoring RSA Modulus with Known Bits from Both p and q: A Lattice Method
Yao Lu 0002, Rui Zhang 0002, Dongdai Lin |
NSS | 1 |
| 2012 | A New Variant of Time Memory Trade-Off on the Improvement of Thing and Ying's Attack
Zhenqi Li, Yao Lu 0002, Wenhao Wang 0001, Bin Zhang 0003, Dongdai Lin |
ICICS | 2 |
| 2012 | Applying Time-Memory-Data Trade-Off to Plaintext Recovery Attack
Zhenqi Li, Bin Zhang 0003, Yao Lu 0002, Dongdai Lin |
ICICS | 3 |
| 2012 | Stronger Security Model for Public-Key Encryption with Equality Test
Yao Lu 0002, Rui Zhang 0002, Dongdai Lin |
Pairing | 1 |