English
Related papers

Related papers: A Canonical Password Strength Measure

200 papers

The traditional methods for data compression are typically based on the symbol-level statistics, with the information source modeled as a long sequence of i.i.d. random variables or a stochastic process, thus establishing the fundamental…

Computation and Language · Computer Science 2023-04-04 Mingxiao Li , Rui Jin , Liyao Xiang , Kaiming Shen , Shuguang Cui

Cryptography with quantum states exhibits a number of surprising and counterintuitive features. In a 2002 work, Barnum et al. argue that these features imply that digital signatures for quantum states are impossible (Barnum et al., FOCS…

Quantum Physics · Physics 2021-12-22 Gorjan Alagic , Tommaso Gagliardoni , Christian Majenz

In recent years, numerous incidents involving the leakage of website accounts and text passwords (referred to as passwords) have raised significant concerns regarding the potential exposure of personal information. These events underscore…

Cryptography and Security · Computer Science 2026-04-07 Abel C. H. Chen

Correctly evaluating defenses against adversarial examples has proven to be extremely difficult. Despite the significant amount of recent work attempting to design defenses that withstand adaptive attacks, few have succeeded; most papers…

Quantum computer is no longer a hypothetical idea. It is the worlds most important technology and there is a race among countries to get supremacy in quantum technology. Its the technology that will reduce the computing time from years to…

Cryptography and Security · Computer Science 2022-04-07 Manish Kumar

The avoidability, or unavoidability of patterns in words over finite alphabets has been studied extensively. A word (pattern) over a finite set is said to be unavoidable if, for all but finitely many words, there exists a morphism mapping…

Formal Languages and Automata Theory · Computer Science 2019-07-16 Paul Sauer

Since the introduction of bcrypt in 1999, adaptive password hashing functions, whereby brute-force resistance increases symmetrically with computational difficulty for legitimate users, have been our most powerful post-breach countermeasure…

Cryptography and Security · Computer Science 2023-08-31 Vivek Nair , Dawn Song

Enhancing word usage is a desired feature for writing assistance. To further advance research in this area, this paper introduces "Smart Word Suggestions" (SWS) task and benchmark. Unlike other works, SWS emphasizes end-to-end evaluation…

Computation and Language · Computer Science 2023-05-18 Chenshuo Wang , Shaoguang Mao , Tao Ge , Wenshan Wu , Xun Wang , Yan Xia , Jonathan Tien , Dongyan Zhao

Passwords are a fragile, inadequate, and insecure tool for authenticating users, and are especially fraught with problems when used to secure access to network resources and services. In many cases, passwords provide a false sense of…

Cryptography and Security · Computer Science 2012-09-06 Travis Z. Suel

Hidden structural patterns in written texts have been subject of considerable research in the last decades. In particular, mapping a text into a time series of sentence lengths is a natural way to investigate text structure. Typically,…

Computation and Language · Computer Science 2018-05-07 Denner S. Vieira , Sergio Picoli , Renio S. Mendes

Cybersecurity incidents such as data breaches have become increasingly common, affecting millions of users and organizations worldwide. The complexity of cybersecurity threats challenges the effectiveness of existing security communication…

Cryptography and Security · Computer Science 2025-04-04 Carolina Carreira , Alexandra Mendes , João F. Ferreira , Nicolas Christin

Web password recovery, enabling a user who forgets their password to re-establish a shared secret with a website, is very widely implemented. However, use of such a fall-back system brings with it additional vulnerabilities to user…

Cryptography and Security · Computer Science 2018-01-31 Fatma Al Maqbali , Chris J Mitchell

In a variety of applications, there is a need to authenticate content that has experienced legitimate editing in addition to potential tampering attacks. We develop one formulation of this problem based on a strict notion of security, and…

Information Theory · Computer Science 2007-07-13 Emin Martinian , Gregory W. Wornell , Brian Chen

In applications such as end-to-end encrypted instant messaging, secure email, and device pairing, users need to compare key fingerprints to detect impersonation and adversary-in-the-middle attacks. Key fingerprints are usually computed as…

Cryptography and Security · Computer Science 2023-06-16 Dan Turner , Siamak F. Shahandashti , Helen Petrie

Passwords are a good idea, in theory. They have the potential to act as a fairly strong gateway. In practice though, passwords are plagued with problems. They are (1) easily shared, (2) trivial to observe and (3) maddeningly elusive when…

Cryptography and Security · Computer Science 2015-08-25 Joseph Maguire , Karen Renaud

We characterize the words that can be mapped to arbitrarily high powers by injective morphisms. For all other words, we prove a linear upper bound for the highest power that they can be mapped to, and this bound is optimal up to a constant…

Formal Languages and Automata Theory · Computer Science 2025-03-04 Aleksi Saarela

We address the question whether quantum memory is more powerful than classical memory. In particular, we consider a setting where information about a random n-bit string X is stored in r classical or quantum bits, for r<n, i.e., the stored…

Quantum Physics · Physics 2016-11-17 Robert Koenig , Ueli Maurer , Renato Renner

Cyber security advice is a broad church: it is thematically expansive, comprising expert texts, user-generated data consumed by individual users via informal learning, and much in-between. While there is evidence that cyber security news…

Human-Computer Interaction · Computer Science 2024-10-17 Mark Quinlan , Aaron Ceross , Andrew Simpson

Let $f$ denote length preserving function on words. A classical algorithm can be considered as $T$ iterated applications of black box representing $f$, beginning with input word $x$ of length $n$. It is proved that if $T=O(2^{n/(7+e)}), e…

Quantum Physics · Physics 2007-05-23 Yuri Ozhigov

Background. In recent years, cyber security security user studies have been appraised in meta-research, mostly focusing on the completeness of their statistical inferences and the fidelity of their statistical reporting. However, estimates…

Human-Computer Interaction · Computer Science 2020-10-06 Thomas Groß