首页> 外文会议>Advance in cryptology - ASIACRYPT 2009 >Security Notions and Generic Constructions for Client Puzzles
【24h】

Security Notions and Generic Constructions for Client Puzzles

机译:客户难题的安全概念和泛型构造

获取原文
获取原文并翻译 | 示例

摘要

By a computational puzzle we mean a mildly difficult computational problem that requires resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in security. In this paper we are concerned with client puzzles: a type of puzzle used as a defense against Denial of Service (DoS) attacks. The main contribution of this paper is a formal model for the security of client puzzles. We clarify the interface that client puzzles should offer and give two security notions for puzzles. Both functionality and security are inspired by, and tailored to, the use of puzzles as a defense against DoS attacks. Our definitions fill an important gap: breaking either of the two properties immediately leads to successful DoS attacks. We illustrate this point with an attack against a previously proposed puzzle construction. We also provide a generic construction of a client puzzle which meets our security definitions.
机译:所谓计算难题,是指需要资源(处理器周期,内存或两者)来解决的中等难度的计算问题。难题已发现在安全方面有多种用途。在本文中,我们关注客户难题:这是一种用于防御拒绝服务(DoS)攻击的难题。本文的主要贡献是针对客户难题安全性的正式模型。我们阐明了客户端难题应提供的界面,并给出了两个安全难题概念。功能和安全性均受难题的启发,并针对这些难题进行了量身定制,以解决DoS攻击。我们的定义填补了一个重要空白:破坏这两个属性中的任何一个都会立即导致成功的DoS攻击。我们通过攻击先前提出的拼图构造来说明这一点。我们还提供了满足我们的安全性定义的客户难题的通用构造。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号