On the Possibility of Constructing Meaningful Hash Collisions for Public Keys

No abstract is available for this paper.

• Publication year

  2005

• Venue

  Australasian Conference on Information Security and Privacy

• Publication date

  2005-07-04

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/11506157_23
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• An attack on hash function HAVAL-128

  2007cited by this paper
• How to Break MD5 and Other Hash Functions

  2005cited by this paper
• An attack on hash function HAVAL-128

  2005cited by this paper
• Digital Signature Standard

  2005cited by this paper
• What's the Worst That Could Happen?

  2005cited by this paper
• Cryptanalysis of the Hash Functions MD4 and RIPEMD

  2005cited by this paper
• Second Preimages on n-bit Hash Functions for Much Less than 2n Work

  2005cited by this paper
• Advances in Cryptology - EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005, Proceedings

  2005cited by this paper
• Colliding X.509 Certificates

  2005cited by this paper
• Twin RSA

  2005cited by this paper
• Γ and B

  2004cited by this paper
• Practical Attacks on Digital Signatures Using MD5 Message Digest

  2004cited by this paper
• MD5 To Be Considered Harmful Someday

  2004cited by this paper
• The Full Cost of Cryptanalytic Attacks

  2004cited by this paper
• Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD

  2004cited by this paper
• Advances in Cryptology — ASIACRYPT’98

  2002cited by this paper
• Advances in Cryptology — EUROCRYPT ’96

  2001cited by this paper
• Circuits for Integer Factorization: A Proposal

  2001cited by this paper
• Formal aspects of mobile code security

  1999cited by this paper
• Generating RSA Moduli with a Predetermined Portion

  1998cited by this paper
• Generating EIGamal Signatures Without Knowing the Secret Key

  1996cited by this paper
• On the number of positive integers ≦ x and free of prime factors > y

  1986cited by this paper
• On the number of positive integers $\leq x$ and free of prime factors $>y$

  1951cited by this paper

• Public-Algorithm Substitution Attacks: Subverting Hashing and Verification

  2025cites this paper
• Highly-Effective Backdoors for Hash Functions and Beyond

  2024cites this paper
• All your Credentials are Belong to Us: On Insecure WPA2-Enterprise Configurations

  2021cites this paper
• A Survey of Chosen-Prefix Collision Attacks

  2021cites this paper
• Elementary Attestation of Cryptographically Useful Composite Moduli

  2020cites this paper
• Protocols for Authentication and Key Establishment

  2020cites this paper
• Mitigating TLS compromise with ECDHE and SRP

  2020cites this paper
• When TLS Meets Proxy on Mobile

  2020cites this paper
• Modified Timed Efficient Stream Loss-tolerant Authentication to Secure Power Line Communication

  2019cites this paper
• A metric to assess the trustworthiness of certificate authorities

  2019cites this paper
• MERCAT: A Metric for the Evaluation and Reconsideration of Certificate Authority Trustworthiness

  2019cites this paper
• ON FINDING SOLUTIONS TO EXPONENTIAL CONGRUENCES

  2018cites this paper
• Validation of forensic images for assurance of digital evidence integrity

  2014cites this paper
• A Survey on Security Considerations forMicrocontrollers in Traffic Light Networks

  2013cites this paper
• Reconstructing the Cryptanalytic Attack behind the Flame Malware

  2013cites this paper
• Chosen-prefix collisions for MD 5 and applications 323

  2012cites this paper
• Chosen-prefix collisions for MD5 and applications

  2012influential citation
• The power of recognition: secure single sign-on using TLS channel bindings

  2011cites this paper
• Security Analysis of Randomize-Hash-then-Sign Digital Signatures

  2011cites this paper
• Betula HUC with Terminal Mode - A Terminal Mode implementation and evaluation

  2011cites this paper
• A Diskless Cluster Architecture for Hashing Operations

  2010cites this paper
• Construction et Analyse de fonctions de Hachage

  2010cites this paper
• Cryptanalysis of MD2

  2010cites this paper
• From the editor

  2009cites this paper
• Secure Set Membership Using 3 SAT Doctoral Dissertation

  2009cites this paper
• An implementation of the Linux software repository model for other operating systems

  2009cites this paper
• On Randomizing Hash Functions to Strengthen the Security of Digital Signatures

  2009cites this paper
• Extended Password Recovery Attacks against APOP, SIP, and Digest Authentication

  2009cites this paper
• Cryptographic hash functions

  2009cites this paper
• Post-Quantum Cryptography Using Complexity Doctoral Dissertation

  2009cites this paper
• The Skein Hash Function Family

  2009cites this paper
• Cube attacks on cryptographic hash functions

  2009cites this paper
• À LA FACULTÉ INFORMATIQUE ET COMMUNICATIONS LABORATOIRE DE SÉCURITÉ ET DE CRYPTOGRAPHIE PROGRAMME DOCTORAL EN INFORMATIQUE, COMMUNICATIONS ET INFORMATION

  2009cites this paper
• Analyse de fonctions de hachage cryptographiques

  2008cites this paper
• Towards an Efficient and Extensible Grid-Based Data Storage Solution

  2008cites this paper
• Practical key-recovery attack against APOP, an MD5-based challenge-response authentication

  2008cites this paper
• ECRYPT Yearly Report on Algorithms and Keysizes (2007-2008)

  2008cites this paper
• Validating digital evidence for legal argument

  2008cites this paper
• Classical and Quantum Algorithms for Exponential Congruences

  2008cites this paper
• Characterizing the impact of rigidity on the security of cellular telecommunications networks

  2008cites this paper
• Security of MD5 Challenge and Response: Extension of APOP Password Recovery Attack

  2008cites this paper
• Analysis of Modern Dedicated Cryptographic Hash Functions

  2007cites this paper
• When Cryptographers Turn Lead into Gold

  2007cites this paper
• Current Status of SHA-1

  2007cites this paper
• On Collisions for MD5

  2007cites this paper
• Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities

  2007cites this paper
• Crypto Corner

  2007cites this paper
• When Cryptographers Turn Lead into Gold

  2007cites this paper
• Architectural Mismatch in Service-Oriented Architectures

  2007cites this paper
• Efficient Hash Collision Search Strategies on Special-Purpose Hardware

  2007cites this paper
• Message Freedom in MD4 and MD5 Collisions: Application to APOP

  2007cites this paper
• Network Working Group

  2007cites this paper
• A survey of recent developments in cryptographic algorithms for smart cards

  2007cites this paper
• Cryptographic hash functions : cryptanalysis, design and applications

  2007cites this paper
• Secure Set Membership Using 3Sat

  2006cites this paper
• Target Collisions for MD5 and Colliding X.509 Certificates for Different Identities

  2006cites this paper
• A Note on the Practical Value of Single Hash Collisions for Special File Formats

  2006cites this paper
• An Optimal Non-interactive Message Authentication Protocol

  2006cites this paper
• Attacks on MD5 and SHA-1: Is this the "Sword of Damocles" for Electronic Commerce?

  2006cites this paper
• Compare-by-Hash: A Reasoned Analysis

  2006cites this paper
• On the Performance and Analysis of DNS Security Extensions

  2005cites this paper
• A Failure-Friendly Design Principle for Hash Functions

  2005cites this paper
• A Note on the Practical Value of Single Hash Collisions for Special File Formats

  2005cites this paper
• Cryptanalysis of Hash functions of the MD4-family

  2005cites this paper
• Twin RSA

  2005influential citation
• Algorithm Substitution Attacks on Public Functions

  year unknowncites this paper