页面顶部 Top
文件:  root - text - article - 2016 - 06 - CVE-2016-4581.txt
标签: 安全, security, | 英文 | 主页 | 类别: 计算机科学 | 818 次阅读, 23667 次搜索 | 175 个单词

定阅此目录的博客 | 浏览 | 博客存档
New Vulnerabilities (CVE-2016-4581) have been detected in CentOS/RHEL/CloudLinux 7
Distributions have yet to patch CVE-2016-4581 in CentOS/RHEL/CloudLinux 7 kernels and the vulnerability is already known to be used in attacks against hosting providers to crash servers.

About the vulnerability:

fs/pnode.c in the Linux kernel before 4.5.4 does not properly traverse a mount propagation tree in a certain case involving a slave mount, which allows local users to cause a denial of service (NULL pointer dereference and OOPS) via a crafted series of mount system calls.

What can I do:

If you are a QuickHostUK Managed Hosting customer this has already been patched. If you are not a QuickHostUK Managed Hosting customer please ensure you have also taken the appropriate actions to secure your own servers.

Alternatively, we can handle this for you with our adhoc management scheme, which for this occurrence would be £10 /month per server and would cover all future security patches automatically.

Please contact us if you wish to utilise this service or if you have any questions.
标签: 安全, security, | 英文 | 主页 | 类别: 计算机科学 | 818 次阅读, 23667 次搜索 | 175 个单词 定阅此目录的博客

猜您喜欢...

  1. Daily Interview Puzzle: Ways to Traverse a Grid
  2. Daily Interview Puzzle: Minimum Size Subarray Sum
  3. Daily Interview Problem: Running Median
  4. Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
  5. [Daily Problem] Angles of a Clock
  6. Number of Ways to Climb Stairs
  7. Daily Interview Puzzle: Intersection of Linked Lists
  8. Daily Interview Problem:Create a balanced binary search tree
  9. Daily Interview Problem: Contiguous Subarray with Maximum Sum
  10. Daily Interview Problem: Find the k-th Largest Element in a List

评论 (0)

您的邮件 (不公开域名部分):

您的评论:

悄悄话(发邮件) 颜色 更多笑脸 S x y @

验证码 (点击图片更新):

    当前页暂时没有评论。


最后更新: October 30 2020 14:21:12 | RSS Subscription
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />