default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYao Lu 0002
Person information
- affiliation: University of Tokyo, Department of Complexity Science and Engineering, Japan
- affiliation (PhD 2015): Chinese Academy of Sciences, Institute of Information Engineering, State Key Laboratory of Information Security, Beijing, China
Other persons with the same name
- Yao Lu — disambiguation page
- Yao Lu 0001
![[0000-0003-3760-1638]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0003-3760-1638")
— Beijing Institute of Technology, School of Computer Science, Beijing Laboratory of Intelligent Information Technology, China (and 1 more) - Yao Lu 0003 — National University of Defense Technology, College of Computer, Changsha, China
- Yao Lu 0004 — Guizhou Normal University, Technology Engineering Centre of Manufacturing Service and Knowledge Engineering, Guiyang, China (and 1 more)
- Yao Lu 0005 — Tianjin University, School of Electrical and Information Engineering, China
- Yao Lu 0006 — Google (and 1 more)
- Yao Lu 0007 — Sun Yat-sen University, School of Data and Computer Science, Guangzhou, China (and 1 more)
- Yao Lu 0008 — Harbin Institute of Technology at Shenzhen, Department of Computer of Science and Technology, Shenzhen, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j7]Atsushi Takayasu, Yao Lu, Liqiang Peng:
Small CRT-Exponent RSA Revisited. J. Cryptol. 32(4): 1337-1382 (2019)- 2018
- [c15]Liqiang Peng, Yao Lu, Noboru Kunihiro, Rui Zhang, Lei Hu:
A Deterministic Algorithm for Computing Divisors in an Interval. ACISP 2018: 3-12 - [c14]Yao Lu, Noboru Kunihiro, Rui Zhang, Liqiang Peng, Hui Ma:
Certifying Variant of RSA with Generalized Moduli. ICICS 2018: 598-608 - 2017
- [j6]Rui Zhang, Hui Ma, Yao Lu, Yang Li:
Provably secure cloud storage for mobile networks with less computation and smaller overhead. Sci. China Inf. Sci. 60(12): 122104:1-122104:13 (2017) - [j5]Liqiang Peng, Lei Hu, Yao Lu, Jun Xu, Zhangjie Huang:
Cryptanalysis of Dual RSA. Des. Codes Cryptogr. 83(1): 1-21 (2017) - [j4]Yao Lu, Liqiang Peng, Santanu Sarkar:
Cryptanalysis of an RSA variant with moduli N=prql. J. Math. Cryptol. 11(2): 117 (2017) - [j3]Rui Zhang, Hui Ma, Yao Lu:
Fine-grained access control system based on fully outsourced attribute-based encryption. J. Syst. Softw. 125: 344-353 (2017) - [j2]Hui Ma, Rui Zhang, Zhiguo Wan, Yao Lu, Suqing Lin:
Verifiable and Exculpable Outsourced Attribute-Based Encryption for Access Control in Cloud Computing. IEEE Trans. Dependable Secur. Comput. 14(6): 679-692 (2017) - [c13]Atsushi Takayasu, Yao Lu, Liqiang Peng:
Small CRT-Exponent RSA Revisited. EUROCRYPT (2) 2017: 130-159 - [p1]Yao Lu, Liqiang Peng, Noboru Kunihiro:
Recent Progress on Coppersmith's Lattice-Based Method: A Survey. CREST Crypto-Math Project 2017: 297-312 - [i2]Atsushi Takayasu, Yao Lu, Liqiang Peng:
Small CRT-Exponent RSA Revisited. IACR Cryptol. ePrint Arch. 2017: 92 (2017) - 2016
- [c12]Liqiang Peng, Lei Hu, Yao Lu, Hongyun Wei:
An Improved Analysis on Three Variants of the RSA Cryptosystem. Inscrypt 2016: 140-149 - [c11]Liqiang Peng, Lei Hu, Yao Lu:
Improved Results on Cryptanalysis of Prime Power RSA. ICISC 2016: 287-303 - 2015
- [c10]Yao Lu, Rui Zhang, Liqiang Peng, Dongdai Lin:
Solving Linear Equations Modulo Unknown Divisors: Revisited. ASIACRYPT (1) 2015: 189-213 - [c9]Liqiang Peng, Lei Hu, Yao Lu, Santanu Sarkar, Jun Xu, Zhangjie Huang:
Cryptanalysis of Variants of RSA with Multiple Small Secret Exponents. INDOCRYPT 2015: 105-123 - [c8]Liqiang Peng, Lei Hu, Yao Lu, Zhangjie Huang, Jun Xu:
Implicit Factorization of RSA Moduli Revisited (Short Paper). IWSEC 2015: 67-76 - [c7]Yao Lu, Liqiang Peng, Rui Zhang, Lei Hu, Dongdai Lin:
Towards Optimal Bounds for Implicit Factorization Problem. SAC 2015: 462-476 - 2014
- [c6]Yao Lu, Rui Zhang, Dongdai Lin:
New Partial Key Exposure Attacks on CRT-RSA with Large Public Exponents. ACNS 2014: 151-162 - [i1]Yao Lu, Rui Zhang, Dongdai Lin:
New Results on Solving Linear Equations Modulo Unknown Divisors and its Applications. IACR Cryptol. ePrint Arch. 2014: 343 (2014) - 2013
- [j1]Yao Lu, Rui Zhang, Dongdai Lin:
Improved bounds for the implicit factorization problem. Adv. Math. Commun. 7(3): 243-251 (2013) - [c5]Yao Lu, Rui Zhang, Dongdai Lin:
Factoring Multi-power RSA Modulus N = p r q with Partial Known Bits. ACISP 2013: 57-71 - [c4]Yao Lu, Rui Zhang, Dongdai Lin:
Factoring RSA Modulus with Known Bits from Both p and q: A Lattice Method. NSS 2013: 393-404 - 2012
- [c3]Zhenqi Li, Yao Lu, Wenhao Wang, Bin Zhang, Dongdai Lin:
A New Variant of Time Memory Trade-Off on the Improvement of Thing and Ying's Attack. ICICS 2012: 311-320 - [c2]Zhenqi Li, Bin Zhang, Yao Lu, Jing Zou, Dongdai Lin:
Applying Time-Memory-Data Trade-Off to Plaintext Recovery Attack. ICICS 2012: 321-330 - [c1]Yao Lu, Rui Zhang, Dongdai Lin:
Stronger Security Model for Public-Key Encryption with Equality Test. Pairing 2012: 65-82
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-22 20:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
