首页> 外文会议>Advances in cryptology-CRYPTO 2009 >Private Mutual Authentication and Conditional Oblivious Transfer
【24h】

Private Mutual Authentication and Conditional Oblivious Transfer

机译:私人相互身份验证和有条件的遗忘转移

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

摘要

A bi-directional Private Authentication, or Unlinkable Secret Handshake, allows two parties to authenticate each other as certified by given certification authorities (i.e. affiliated with given groups), in a mutually private way, in the sense that the protocol leaks no information about either participant to a party which does not satisfy that participant's authentication policy. In particular, the protocol hides what group this participant belongs to, and protocol instances involving the same participant are unlinkable. We construct the first realization of such private authentication using O(1) exponentiations and bilinear maps, secure under Strong Diffie-Hellman and Decisional Linear assumptions.rnOur protocols rely on a novel technical tool, a family of efficient Private Conditional Oblivious Transfer (COT) protocols, secure under DDH, for languages defined by modular arithmetic constraints (e.g. equality, inequality, sums, products) on discrete-log representations of some group elements. (Recall that (w_1,..., w_n) is a representation of C in bases (g_1,..., g_n) if C = g_1~(w_1)...g_n~(w_n).) A COT protocol for language L allows sender S to encrypt message m "under" statement x so that receiver R gets m only if R holds a witness for membership of x in L, while S learns nothing. A private COT for L hides not only message m but also statement x from any R that does not know a witness for x in L.
机译:双向专用身份验证或不可链接的秘密握手,允许双方以给定证书颁发机构(即,与给定组关联的成员)以相互私有的方式彼此进行身份验证,在某种意义上,该协议不会泄漏任何有关两者的信息不满足该参与者的身份验证策略的一方的参与者。特别是,协议隐藏了该参与者所属的组,并且涉及同一参与者的协议实例是不可链接的。我们使用O(1)幂和双线性映射构造这种私有认证的第一个实现,并在强Diffie-Hellman和决策线性假设下保证了安全性。在DDH下安全的协议,用于由某些组元素的离散对数表示形式上的模块化算术约束(例如,相等,不相等,和,乘积)定义的语言。 (回想一下,如果C = g_1〜(w_1)... g_n〜(w_n),则(w_1,...,w_n)是C在基数(g_1,...,g_n)中的表示。)语言L允许发送方S在“ x”语句x下方对消息m进行加密,以便接收方R仅在R持有L中x的隶属关系的见证方时才获得m,而S却一无所获。 L的专用COT不仅对消息m隐藏,而且对不知道L中x的见证人的任何R隐藏语句x。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号