Skip to content

NuytsTech Security

  • Home
  • Terms of Use
    • Privacy Policy
  • Blog
  • Cloud Hosting
  • Contact

NuytsTech Security

  • Home
  • Terms of Use
    • Privacy Policy
  • Blog
  • Cloud Hosting
  • Contact
  • Vulnerabilities

CVE-2005-1175

by Fred · 17/07/2005

Heap-based buffer overflow in the Key Distribution Center (KDC) in MIT Kerberos 5 (krb5) 1.4.1 and earlier allows remote attackers to cause a denial of service (application crash) and possibly execute arbitrary code via a certain valid TCP or UDP request.

Date published : 2005-07-17

http://www-1.ibm.com/support/docview.wss?uid=swg1IY85474

http://lists.apple.com/archives/security-announce/2005/Aug/msg00000.html

Share this:

  • Click to share on X (Opens in new window) X
  • Click to share on Bluesky (Opens in new window) Bluesky
  • Click to share on Facebook (Opens in new window) Facebook
  • Click to share on LinkedIn (Opens in new window) LinkedIn
  • Click to share on Threads (Opens in new window) Threads
  • Click to share on Mastodon (Opens in new window) Mastodon

Similar

Tags: Cybersecurity Alert

  • Next story CVE-2005-1530
  • Previous story CVE-2005-1174

Recent Posts

  • CVE-2025-6081
  • CVE-2025-5967
  • CVE-2025-6940
  • CVE-2025-6939
  • CVE-2025-6938
  • CVE-2025-53096
  • CVE-2025-53095
  • CVE-2025-53003
  • CVE-2025-6937
  • CVE-2025-53005
  • CVE-2025-36056
  • CVE-2025-2141
  • CVE-2025-6936
  • CVE-2025-6935
  • CVE-2025-6932
  • CVE-2025-6931
  • CVE-2025-6930
  • CVE-2025-6554
  • CVE-2025-6929
  • CVE-2025-53004
  • CVE-2025-49521
  • CVE-2025-49520
  • CVE-2025-32463
  • CVE-2025-32462
  • CVE-2025-52997
  • CVE-2025-52996
  • CVE-2025-52995
  • CVE-2025-52901
  • CVE-2025-52491
  • CVE-2025-49493

Categories

  • Critical cyberalert
  • Vulnerabilities

Tags

CISA Cybersecurity Alert Shields Up

© 1999-2025 NUYTSTECH. All Rights Reserved. Use of the CVE (Common Vulnerabilities and Exposures) from this non-profit website are subject to the terms of use.

We use cookies to ensure that we give you the best experience on our website. If you continue to use this site we will assume that you are happy with it.