首页> 外文期刊>ACM Transactions on Internet Technology >Moderately Hard, Memory-Bound Functions
【24h】

Moderately Hard, Memory-Bound Functions

机译:中等难度,具有存储限制的功能

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

摘要

A resource may be abused if its users incur little or no cost. For example, e-mail abuse is rampant because sending an e-mail has negligible cost for the sender. It has been suggested that such abuse may be discouraged by introducing an artificial cost in the form of a moderately expensive computation. Thus, the sender of an e-mail might be required to pay by computing for a few seconds before the e-mail is accepted. Unfortunately, because of sharp disparities across computer systems, this approach may be ineffective against malicious users with high-end systems, prohibitively slow for legitimate users with low-end systems, or both. Starting from this observation, we research moderately hard functions that most recent systems will evaluate at about the same speed. For this purpose, we rely on memory-bound computations. We describe and analyze a family of moderately hard, memory-bound functions, and we explain how to use them for protecting against abuses.
机译:如果资源的用户花费很少或没有花费,则资源可能会被滥用。例如,电子邮件滥用猖ramp,因为发送电子邮件对发件人而言可以忽略不计。已经提出,可以通过以适度昂贵的计算形式引入人为成本来阻止这种滥用。因此,在发送电子邮件之前,可能需要计算几秒钟来支付电子邮件的发送者。不幸的是,由于计算机系统之间的巨大差异,这种方法可能对具有高端系统的恶意用户无效,或者对于具有低端系统的合法用户而言速度太慢,或者两者兼而有之。从这一观察开始,我们研究了中等难度的功能,大多数最新系统将以大约相同的速度对其进行评估。为此,我们依赖于内存绑定计算。我们描述和分析了一系列中等难度的,内存受限的函数,并说明了如何使用它们来防止滥用。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号