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

Martin Cochran

dblp:38/6500 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · none

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

Security and privacy · 5

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
Cryptographic primitives and cryptanalysis · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › hash functions › hash function constructions
blockcipher-based hash function
0.122009
On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions · J. Cryptol. 2009
On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions · EUROCRYPT 2005
Cryptographic primitives and cryptanalysis
hash functions
0.122009
On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions · J. Cryptol. 2009
On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions · EUROCRYPT 2005

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

provable security · 0.1
YearPublicationVenuePosition
2009 MAC Reforgeability
John Black, Martin Cochran
FSE2
2009 On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
John Black, Martin Cochran, Thomas Shrimpton
J. Cryptol.2
2006 A Study of the MD5 Attacks: Insights and Improvements
John Black, Martin Cochran, Trevor Highland
FSE2
2005 Lessons Learned: A Security Analysis of the Internet Chess Club
abstract
The Internet Chess Club (ICC) is a popular online chess server with more than 30,000 members worldwide including various celebrities and the best chess players in the world. Although the ICC Web site assures its users that the security protocol used between client and server provides sufficient security for sensitive information to be transmitted (such as credit card numbers), we show this is not true. In particular we show how a passive adversary can easily read all communications with a trivial amount of computation, and how an active adversary can gain virtually unlimited powers over an ICC user. We also show simple methods for defeating the timestamping mechanism used by ICC. For each problem we uncover, we suggest repairs and draw conclusions on how to best avoid repeating these types of problems in the future
John Black, Martin Cochran, Ryan W. Gardner
ACSAC2
2005 On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
John Black, Martin Cochran, Thomas Shrimpton
EUROCRYPT2