Weili Han

Weili Han

Auto-generated profile, based on publicly available information

Weili Han

Fudan University

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

12 May 2016 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
WHWeili Han
Weili Han
ZLZhigong Li
Zhigong Li
MNMinyue Ni
Minyue Ni
GGGuofei Gu
Guofei Gu
WXWenyuan Xu
Wenyuan Xu
With the proliferation of websites, the security level of password-protected accounts is no longer purely determined by individual ones. Users may register multiple accounts on the same site or across multiple sites, and these passwords from the same users are likely to be the same or similar. As a result, an adversary can compromise the account of a user on a web forum, then guess the accounts of the same user in sensitive accounts, e.g., online banking services, whose accounts could have the same or even stronger passwords. We name this attack as the shadow attack on passwords. To understand the situation, we examined the state-ofthe-art Intra-Site Password Reuses (ISPR) and Cross-Site Password Reuses (CSPR) based on the leaked passwords from the biggest Internet user group (i.e., 668 million members in China). With a collection of about 70 million real-world web passwords across four large websites in China, we obtained around 4.6 million distinct users who have multiple accounts on the same site or across different sites. We found that for the users with multiple accounts in a single website, 59.72 percent reused their passwords and for the users with multiple accounts on multiple websites, 33.16 + 8.91 percent reused their passwords across websites. For the users that have multiple accounts but different passwords, the set of passwords of the same user exhibits patterns that can help password guessing: a leaked weak password reveals partial information of a strong one, which degrades the strength of the strong one. Given the aforementioned findings, we conducted an experiment and achieved a 39.38 percent improvement of guessing success rate with John the Ripper guessing tool. To the best of our knowledge, we are the first to provide a large-scale, empirical, and quantitative measurement of web password reuses, especially ISPR, and shed light on the severity of such threat in the real world.

1 January 2007
Verified
Conference Paper
Closed access
TCTing Chen
Ting Chen
WHWei-Li Han
Wei-Li Han
HWHai-Dong Wang
Hai-Dong Wang
YZYi-Xun Zhou
Yi-Xun Zhou
BXBin Xu
Bin Xu
BZBin-Yu Zang
Bin-Yu Zang
Internet is overwhelming, personalized content recommendation system offers spam filtering service and suggests useful information to the end users. It is a hotspot in the research area of content management on WWW. Traditional recommendation systems do the data mining on web access logs, discover user's access patterns, and filter the information on behalf of the user at the server side. One critical limitation of traditional recommendation system is the lack of user's private daily data, such as schedules, favorite websites and personal emails. The reason for this limitation is the privacy leak issue when the server holds much more private user data. To solve this problem, this paper presents an agent-based personalized recommendation method called Content REcommendation System based on private Dynamic User Profile (CRESDUP). The system collects and mines the private data of user at the client side, discovers, stores and updates private Dynamic User Profile (DUP) at the client side. The system fetches preferred message from the content server according to DUP. An important usage of this technology is a personalized advertising system in the RSS (Rich Site Summary, or RDF Site Summary) reader application. Our experiment shows that the system can utilize DUP to identify the customers' potential preferences and deliver the more preferred messages, especially the advertisements, to people who are interested.

19 June 2020 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
WHWeili Han
Weili Han
MXMing Xu
Ming Xu
JZJunjie Zhang
Junjie Zhang
CWChuanwang Wang
Chuanwang Wang
KZKai Zhang
Kai Zhang
XWX. Sean Wang
X. Sean Wang
Long passwords are gaining popularity in password policy recommendations; however, data-driven guessing studies are woefully inadequate in adapting to long passwords, lacking in both guessing efficiency and their composition guidelines. For state-of-the-art data-driven password guessing methods such as PCFGs (Probabilistic Context-free Grammars), their guessing efficiency is limited by the presence of a large scale training data, or the lack thereof. Given that long passwords leaked in the real world are typically scarce, coupled with the fact that the data-driven methods’ performance depends on training data, obtaining good performance on long passwords has become a key challenge. To overcome the dataset limitation, we propose a framework TransPCFG, that transfers the knowledge, (i.e., grammars in PCFGs), from short passwords to facilitate long password guessing. We further perform an empirical evaluation based on three real-world datasets and the results demonstrate superior performance over the state-of-the-art data-driven guessing methods under 1014 offline guesses. For passwords with 16 characters, TransPCFG can compromise an average of 23.30% of the passwords, outperforming PCFG_v4.1 by 56.10%. Additionally,for better password-composition guidelines, we find that long password-composition policies requiring more segments are more resistant to guessing attacks. For the segment, the password 12zxcvbnword1997 has four segments since it follows the template Digit2Keyboard6Letter4Year4. We thus recommend users to create long passwords with four or more segments instead of the widely recommended more character classes for security.

10 August 2012 in Information Systems Frontiers
Verified
Journal Article
Closed access
PDF file
WHWeili Han
Weili Han
YGYun Gu
Yun Gu
WWWei Wang
Wei Wang
YZYin Zhang
Yin Zhang
YYYuliang Yin
Yuliang Yin
LIRONG ZHENGLIRONG ZHENG
LIRONG ZHENG

8 February 2018 in Science China Information Sciences
Verified
Journal Article
Closed access
PDF file
JLJiao Liang
Jiao Liang
WHWeili Han
Weili Han
ZGZeqing Guo
Zeqing Guo
YCYaoliang Chen
Yaoliang Chen
CCChang Cao
Chang Cao
FLFenghua Li
Fenghua Li