【24h】

Convergence of IPsec in presence of resets

机译:IPsec在重置存在下的融合

获取原文

摘要

IPsec is the current security standard for the Internet Protocol IP. According to IPsec, a selected computer pair (p, q) in the Internet can be designated a "security association ". This designation guarantees that all sent IP messages whose original source is computer p and whose ultimate destination is computer q cannot be replayed in the future (by an adversary between p and q) and still be received by q as fresh messages from p. This guarantee Is provided by adding increasing sequence numbers to all IP messages sent from p to q. Thus, p needs to always remember the sequence number of the last sent message, and q need to always remember the sequence number of the last received message. Unfortunately, when computer p or q is reset these sequence numbers can be forgotten, and this leads to two bad possibilities: unbounded number of fresh messages from p can be discarded by q, and unbounded number of replayed messages can be accepted by q. In this paper, we propose two operations, "SAVE" and "FETCH", to prevent these possibilities. The SAVE operation can be used to store the last sent sequence number in persistent memory of p once every K{sub}p, sent messages, and can be used to store the last received sequence number in persistent memory of q once every K{sub}q received messages. The FETCH operation can be used to fetch the last stored sequence number for a computer when that computer wakes up after a reset. We show that the following three conditions hold when SAVE and FETCH are adopted in both p and q. First, when p is reset, at most 2K{sub}p sequence numbers will be lost but no fresh message sent from p to q will be discarded if no message reorder occurs. Second, when q is reset, the number of discarded fresh messages is bounded by 2K{sub}q. In either case, no replayed message will be accepted by q.
机译:IPsec是Internet协议IP当前的安全标准。据的IPsec,所选计算机对(P,Q)中的因特网可被指定为“安全关联”。这种指定保证所有发送的IP消息,其原始源是计算机p和其最终目的地是计算机Q无法在未来被重放(由p和q之间的对手),并且仍然用q被接收作为从对新鲜的消息。这种保证是通过将递增的序列号以聆听p发送到q所有的IP报文提供。因此,对需要永远记住上次发送的消息的序列号,和q必须始终记住上次接收到的消息的序列号。不幸的是,当计算机P或Q复位这些序列号可以被遗忘,这会导致两个坏的可能性:由对新鲜消息的无限数量的可以由Q被丢弃,并重播的消息的无限数量的可以由Q所接受。在本文中,我们提出了两种操作,“保存”和“Fetch”,以防止这些可能性。保存操作可以被用于存储在一次每K {子} P,发送的邮件P的持久性存储器中的最后一个发送的序列号,并且可以被用于存储在一次每K {子Q的持久性存储器中的最后接收到的顺序号} q接收的消息。提取操作时,可以使用该计算机复位后醒来以读取最后存储的序列号为一台计算机。我们发现,以下三个条件成立时节省和FETCH在p和q为采用。首先,当p是复位,至多2K {子} p个序列号将被丢失,但如果没有发生重排的消息,从p发送到q没有新鲜消息将被丢弃。其次,当q是复位时,丢弃新的消息的数量由2K {子} q为界。在任一种情况下,没有重放的消息将用q被接受。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号