Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

T. Mark A. Lomas

dblp:15/3130 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 1997
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 2 · 1 first-authorComputer networks · 1Software engineering, systems software and programming languages · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
2 papers
Authentication and access control · 75% Cryptographic protocols and secure computation · 25%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Authentication and access control
password authentication
0.021993
Protecting Poorly Chosen Secrets from Guessing Attacks · IEEE J. Sel. Areas Commun. 1993
Reducing Risks from Poorly Chosen Keys · SOSP 1989
Cryptographic protocols and secure computation › security protocol analysis
protocol vulnerability analysis
0.011993
Protecting Poorly Chosen Secrets from Guessing Attacks · IEEE J. Sel. Areas Commun. 1993
Authentication and access control › authentication
authentication protocols
0.011989
Reducing Risks from Poorly Chosen Keys · SOSP 1989
Authentication and access control › password authentication
dictionary attack resistance
0.011989
Reducing Risks from Poorly Chosen Keys · SOSP 1989
Authentication and access control › password security
password creation
0.011993
Protecting Poorly Chosen Secrets from Guessing Attacks · IEEE J. Sel. Areas Commun. 1993

Methods — techniques the papers use, named apart from their topics

cryptographic protocol design · 0.0protocol design · 0.0dictionary attack analysis · 0.0
YearPublicationVenuePosition
1997 Strong Authentication and Privacy with Standard Browsers
abstract
A framework for secure WWW client/server communication is proposed. Strong end-to-end encryption and authentication is achieved by means of public key techniques. A particular certification infrastructure is developed that helps assign responsibilities in case of disputes. Such issues are increasin gly important in WWW applications and are not dealt with in a satisfactory way by current certification schemes. Actual communication is done with the HTTP protocol unchanged and by using standard commercial browsers, because widespread usability is a goal. Encryption and authentication is done separately based on the execution of applets running on the client machine.
Francesco Bergadano, Bruno Crispo, T. Mark A. Lomas
J. Comput. Secur.3
1993 Encrypting Network Traffic
T. Mark A. Lomas
FSE1
1993 Protecting Poorly Chosen Secrets from Guessing Attacks
abstract
In a security system that allows people to choose their own passwords, people tend to choose passwords that can be easily guessed. This weakness exists in practically all widely used systems. Instead of forcing users to choose secrets that are likely to be difficult for them to remember, solutions that maintain user convenience and a high level of security at the same time are proposed. The basic idea is to ensure that data available to the attacker is sufficiently unpredictable to prevent an offline verification of whether a guess is successful or not. Common forms of guessing attacks are examined, examples of cryptographic protocols that are immune to such attacks are developed, and a systematic way to examine protocols to detect vulnerabilities to such attacks is suggested.>
T. Mark A. Lomas, Roger M. Needham, Jerome H. Saltzer
IEEE J. Sel. Areas Commun.2
1989 Reducing Risks from Poorly Chosen Keys
abstract
It is well-known that, left to themselves, people will choose passwords that can be rather readily guessed. If this is done, they are usually vulnerable to an attack based on copying the content of messages forming part of an authentication protocol and experimenting, e.g. with a dictionary, offline. The most usual counter to this threat is to require people to use passwords which are obscure, or even to insist on the system choosing their passwords for them. In this paper we show alternatively how to construct an authentication protocol in which offline experimentation is impracticable; any attack based on experiment must involve the real authentication server and is thus open to detection by the server noticing multiple attempts.
T. Mark A. Lomas, Jerome H. Saltzer, Roger M. Needham
SOSP1