浏览代码

Proposal 121: Use first part of Diffie-Hellman handshake for replay protection instead of rendezvous cookie.

svn:r16327
Karsten Loesing 16 年之前
父节点
当前提交
666e179ded
共有 1 个文件被更改,包括 9 次插入4 次删除
  1. 9 4
      doc/spec/proposals/121-hidden-service-authentication.txt

+ 9 - 4
doc/spec/proposals/121-hidden-service-authentication.txt

@@ -28,6 +28,8 @@ Change history:
                with Nick
                with Nick
   31-Jul-2008  Limit maximum descriptor size to 20 kilobytes to prevent
   31-Jul-2008  Limit maximum descriptor size to 20 kilobytes to prevent
                abuse.
                abuse.
+  01-Aug-2008  Use first part of Diffie-Hellman handshake for replay
+               protection instead of rendezvous cookie.
 
 
 Overview:
 Overview:
 
 
@@ -385,10 +387,13 @@ Details:
   When receiving a v3 INTRODUCE2 cell, Bob checks whether a client has
   When receiving a v3 INTRODUCE2 cell, Bob checks whether a client has
   provided valid authorization data to him. He also requires that the
   provided valid authorization data to him. He also requires that the
   timestamp is no more than 30 minutes in the past or future and that the
   timestamp is no more than 30 minutes in the past or future and that the
-  rendezvous cookie has not been used in the past 60 minutes to prevent
+  first part of the Diffie-Hellman handshake has not been used in the past
-  replay attacks by rogue introduction points. If all checks pass, Bob
+  60 minutes to prevent replay attacks by rogue introduction points. (The
-  builds a circuit to the provided rendezvous point and otherwise drops the
+  reason for not using the rendezvous cookie to detect replays---even
-  cell.
+  though it is only sent once in the current design---is that it might be
+  desirable to re-use rendezvous cookies for multiple introduction requests
+  in the future.) If all checks pass, Bob builds a circuit to the provided
+  rendezvous point and otherwise drops the cell.
 
 
   1.4. Summary of authorization data fields
   1.4. Summary of authorization data fields