Michele Finelli | Searcharxiv

arXiv2021

How many years can a tiny unbalanced parenthesis go unnoticed on a widely accessed Internet document, older than the World Wide Web itself ?

We conducted an investigation to find when a mistake was introduced in a widely accessed Internet document, namely the RFC index. With great surprise, we discovered that a it may go unnoticed for a very long period, namely more that twenty-six years. This raises some questions to what does it mean to have open access and the meaning of Linus' laws that "given enough eyeballs, all bugs are shallow"

cs.DL↗

arXiv2005

Pathwords: a user-friendly schema for common passwords management

Many computer-based authentication schemata are based on pass- words. Logging on a computer, reading email, accessing content on a web server are all examples of applications where the identification of the user is usually accomplished matching the data provided by the user with data known by the application. Such a widespread approach relies on some assumptions, whose satisfaction is of foremost importance to guarantee the robustness of the solution. Some of these assumptions, like having a "secure" chan- nel to transmit data, or having sound algorithms to check the correct- ness of the data, are not addressed by this paper. We will focus on two simple issues: the problem of using adequate passwords and the problem of managing passwords. The proposed solution, the pathword, is a method that guarantees: 1 that the passwords generated with the help of a pathword are adequate (i.e. that they are not easy to guess), 2 that managing pathwords is more user friendly than managing passwords and that pathwords are less amenable to problems typical of passwords.

cs.CR↗