短暂配对问题
The Ephemeral Pairing Problem
摘要：
在无线ad-hoc广播网络中，配对问题包括在网络中两个彼此不认识的特定物理节点之间建立（长期）连接。我们专注于这个问题的短暂版本。例如，当两个人在见面时交换电子名片，或者当一个人在结账时使用无线钱包付款时，就会发生短暂的配对。这个问题，在更抽象的术语，可以被表述为一个短暂的密钥交换问题：给定两个节点之间的低带宽的真实（或私人）的通信信道，和一个高带宽的广播信道，我们可以建立一个高熵的共享秘密会话密钥之间的两个节点，而不依赖于任何先验的共享秘密信息。除了引入这个新的问题，我们提出了几个短暂的密钥交换协议，无论是真实的渠道的情况下，以及私人渠道的情况下。
英文摘要：
In wireless ad-hoc broadcast networks the pairing problem consists of establishing a (long-term) connection between two specific physical nodes in the network that do not yet know each other. We focus on the ephemeral version of this problem. Ephemeral pairings occur, for example, when electronic business cards are exchanged between two people that meet, or when one pays at a check-out using a wireless wallet. This problem can, in more abstract terms, be phrased as an ephemeral key exchange problem: given a low bandwidth authentic (or private) communication channel between two nodes, and a high bandwidth broadcast channel, can we establish a high-entropy shared secret session key between the two nodes without relying on any a priori shared secret information. Apart from introducing this new problem, we present several ephemeral key exchange protocols, both for the case of authentic channels as well as for the case of private channels.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
