Users are normally authenticated via their passwords in computer systems. Since people tend to choose passwords that can be easily remembered, the systems are under the threat of guessing attacks. Many authentication and key distribution protocols have been proposed to protect user passwords from guessing attacks. However, these protocols either are limited to some specific environments or incu...

We consider various versions of the 4 principle. This principle is a known consequence of 0. It is well known that or is not sensitive to minor changes in its definition, e.g.. changing the guessing requirement form "guessing exactly" to "guessing module a finite set". We show however. that this is not true for 4. We consider some other variants of 4 as well. ?

The problem of guessing a random string is studied. It arises in the analysis of the strength of secret-key cryptosystems against guessing attacks. Expected number of guesses, or more generally moments of the number of guesses needed to break the cryptosystem grow exponentially with the length of the string. This thesis studies the rate of exponential growth of these moments using the theory of...

The guessing game introduced by Riis [Electron. J. Combin. 2007] is a variant of the “guessing your own hats” game and can be played on any simple directed graph G on n vertices. For each digraph G, it is proved that there exists a unique guessing number gn(G) associated to the guessing game played on G. When we consider the directed edge to be bidirected, in other words, the graph G is undirec...

Human-chosen text passwords, today’s dominant form of authentication, are vulnerable to guessing attacks. Unfortunately, existing approaches for evaluating password strength by modeling adversarial password guessing are either inaccurate or orders of magnitude too large and too slow for real-time, client-side password checking. We propose using artificial neural networks to model text passwords...

Users are typically authenticated by their passwords. Because people are known to choose convenient passwords, which tend to be easy to guess, authenti-cation protocols have been developed that protect user passwords from guessing attacks. These proposed protocols , however, use more messages and rounds than those protocols that are not resistant to guessing attacks. This paper gives new protoc...

This study highlights the relationship between guessing strategy and the acquisition of passive and controlled active vocabulary knowledge among Malaysian university students. Two strategies make up the guessing strategy in this study namely using backward knowledge and using linguistic cues. Vocabulary Learning Questionnaire was used to measure the preference level of guessing strategy as one ...

Reflection principles (or dually speaking, compactness principles) often give rise to combinatorial guessing principles. Uniformization properties, on the other hand, are examples of anti-guessing We discuss tension and compatibility between reflection uniformization properties at level second uncountable cardinal.

This study examined possible age-related differences in recall, guessing, and metacognition on free recall tests and forced recall tests. Participants studied categorised and unrelated word lists and were asked to recall the items under one of the following test conditions: standard free recall, free recall with a penalty for guessing, free recall with no penalty for guessing, or forced recall....

A possible interpretation, in terms offuzzy classification models (fuzzy classifiers), of one pf the general principles of choosing a scientific theory a consistency principle is considered. Supervised self-guessing fuzzy classifiers are determined. A theorem on character of restrictions induced on a set of supervised fuzzy classifiers by a self-guessing requirement is proved. FeaSible alternat...