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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Brian J. Matt

dblp:71/1728 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
0since 2021 · last 2010
—ORCID · none

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

Security and privacy · 6 · 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
3 papers
Biometric security · 58% Authentication and access control · 24% Malware analysis · 10%

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

TopicWeightPapersLastEvidence papers
Biometric security
biometric recognition
0.011998
On Enabling Secure Applications Through Off-Line Biometric Identification · S&P 1998
Biometric security
biometric authentication
0.011998
On Enabling Secure Applications Through Off-Line Biometric Identification · S&P 1998
Biometric security › biometric template protection
biometric key binding
0.011998
On Enabling Secure Applications Through Off-Line Biometric Identification · S&P 1998
Authentication and access control › identity management
user identification
0.011998
On Enabling Secure Applications Through Off-Line Biometric Identification · S&P 1998
Malware analysis
anti-virus
0.011989
Defending Systems against Viruses through Cryptographic Authentication · S&P 1989
Authentication and access control
cryptographic authentication
0.011989
Defending Systems against Viruses through Cryptographic Authentication · S&P 1989
Authentication and access control
authentication
0.011989
Defending Systems against Viruses through Cryptographic Authentication · S&P 1989

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

cryptographic authentication · 0.0
YearPublicationVenuePosition
2010 Identification of Multiple Invalid Pairing-Based Signatures in Constrained Batches
Brian J. Matt
Pairing1
2009 A coding-theoretic approach for efficient message verification over insecure channels
abstract
We address the problem of allowing authorized users, who have yet to establish a secret key, to securely and efficiently exchange key establishment messages over an insecure channel in the presence of jamming and message insertion attacks. This problem was first introduced by Strasser, Pöpper, Čapkun, and Čagalj in their recent work, leaving joint consideration of security and efficiency as an open problem. In this paper, we present three approaches based on coding theory which reduce the overall time required to verify the packets and reconstruct the original message in the presence of jamming and malicious insertion. We first present the Hashcluster scheme which reduces the total overhead included in the short packets. We next present the Merkleleaf scheme which uses erasure coding to reduce the average number of packet receptions required to reconstruct the message. We then present the Witnesscode scheme which uses one-way accumulators to individually verify packets and reduce redundancy. We demonstrate through analysis and simulation that our candidate protocols can significantly decrease the amount of time required for key establishment in comparison to existing approaches without degrading the guaranteed level of security.
David Slater, Patrick Tague, Radha Poovendran, Brian J. Matt
WISEC4
2007 Finding Invalid Signatures in Pairing-Based Batches
Laurie Law, Brian J. Matt
IMACC2
1998 On Enabling Secure Applications Through Off-Line Biometric Identification
abstract
In developing secure applications and systems, designers must often incorporate secure user identification in the design specification. In this paper, we study secure off-line authenticated user identification schemes based on a biometric system that can measure a user's biometrics accurately (up to some Hamming distance). The presented schemes enhance identification and authorization in secure applications by binding a biometric template with authorization information on a token such as a magnetic strip. Also developed are schemes specifically designed to minimize the compromising of a user's private biometrics data, encapsulated in the authorization information, without requiring secure hardware tokens. We also study the feasibility of biometrics performing as an enabling technology for secure systems and applications design. We investigate a new technology which allows a user's biometrics to facilitate cryptographic mechanisms.
George I. Davida, Yair Frankel, Brian J. Matt
S&P3
1989 Defending Systems against Viruses through Cryptographic Authentication
abstract
The author describes the use of cryptographic authentication for controlling computer viruses. The objective is to protect against viruses infecting software distributions, updates, and programs stored or executed on a system. The authentication determines the source and integrity of an executable, relying on the source to produce virus-free software. The scheme relies on a trusted (and verifiable, where possible) device, the authenticator, used to authenticate and update programs and convert programs between the various formats. In addition, each user's machine uses a similar device to perform run-time checking.>
George I. Davida, Yvo Desmedt, Brian J. Matt
S&P3
1987 Arbitration in Tamper Proof Systems
George I. Davida, Brian J. Matt
CRYPTO2