paper-with-me

Papers

SE#PCFG: Semantically Enhanced PCFG for Password Analysis and Cracking

2023-06-12 · Yangde Wang, Weidong Qiu, Peng Tang, Hao Tian, Shujun Li

Much research has been done on user-generated textual passwords. Surprisingly, semantic information in such passwords remain under-investigated, with passwords created by English- and/or Chinese-speaking users being more studied with limited semantics. This paper fills this gap by proposing a general framework based on semantically enhanced PCFG (probabilistic context-free grammars) named SE#PCFG. It allowed us to consider 43 types of semantic information, the richest set considered so far, for password analysis. Applying SE#PCFG to 17 large leaked password databases of user speaking four languages (English, Chinese, German and French), we demonstrate its usefulness and report a wide range of new insights about password semantics at different levels such as cross-website password correlations. Furthermore, based on SE#PCFG and a new systematic smoothing method, we proposed the Semantically Enhanced Password Cracking Architecture (SEPCA), and compared its performance against three SOTA (state-of-the-art) benchmarks in terms of the password coverage rate: two other PCFG variants and neural network. Our experimental results showed that SEPCA outperformed all the three benchmarks consistently and significantly across 52 test cases, by up to 21.53%, 52.55% and 7.86%, respectively, at the user-level (with duplicate passwords). At the level of unique passwords, SEPCA also beats the three counterparts by up to 43.83%, 94.11% and 11.16%, respectively.

📄 PDF Abstract BibTeX arXiv:2306.06824

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Extraction de PCFG et analyse de phrases pr\'e-typ\'ees (PCFG Extraction and Pre-typed Sentences Analysis) [in French]

2012-06-01 · JEPTALNRECITAL 2012 6 · S, No{\'e}mie-Fleur illon-Rezer

An Empirical Study of Compound PCFGs

2021-03-03 · EACL (AdaptNLP) 2021 4 · Yanpeng Zhao, Ivan Titov

Compound probabilistic context-free grammars (C-PCFGs) have recently established a new state of the art for unsupervised phrase-structure grammar induction. However, due to the high space and time complexities of chart-b…

Sentence

Simple Hardware-Efficient PCFGs with Independent Left and Right Productions

2023-10-23 · Wei Liu, Songlin Yang, Yoon Kim, Kewei Tu

Scaling dense PCFGs to thousands of nonterminals via a low-rank parameterization of the rule probability tensor has been shown to be beneficial for unsupervised parsing. However, PCFGs scaled this way still perform poorl…

Constituency Grammar InductionConstituency ParsingLanguage ModelingLanguage Modelling

Holographic Neural PCFG for Unsupervised Parsing

2026-07-09 · Ryosuke Yamaki, Daichi Mochihashi, Nobutaka Shimada, Tadahiro Taniguchi arxiv

Unsupervised constituency parsing aims to accurately induce latent tree structures from raw text alone. Recent neural parameterizations of PCFGs achieve strong performance in both supervised and unsupervised parsing, yet…

Constituency Parsing

Neural Bi-Lexicalized PCFG Induction

2021-05-31 · ACL 2021 5 · Songlin Yang, Yanpeng Zhao, Kewei Tu

Neural lexicalized PCFGs (L-PCFGs) have been shown effective in grammar induction. However, to reduce computational complexity, they make a strong independence assumption on the generation of the child word and thus bile…

Constituency Grammar Induction