Secret Handshakes From Pairing-Based Key Agreements

SP '03: Proceedings of the 2003 IEEE Symposium on Security and Privacy(2003)

引用 381|浏览55
暂无评分
摘要
Consider a CIA agent who wants to authenticate herself to a server but does not want to reveal her CIA credentials unless the server is a genuine CIA outlet. Consider also that the CIA server does not want to reveal its CIA credentials to anyone but CIA agents - not even to other CIA servers.In this paper we first show how pairing-based cryptography can be used to implement such secret handshakes. We then propose a formal definition for secure secret handshakes, and prove that our pairing-based schemes are secure under the Bilinear Diffie-Hellman assumption. Our protocols support role-based group membership authentication, traceability, indistinguishability to eavesdroppers, unbounded collusion resistance, and forward repudiability.Our secret-handshake scheme can be implemented as a TLS cipher suite. We report on the performance of our preliminary Java implementation.
更多
查看译文
关键词
CIA agent,CIA credentials,CIA outlet,pairing-based cryptography,secure secret handshakes,Bilinear Diffie-Hellman assumption,role-based group membership authentication,traceability,indistinguishability,unbounded collusion resistance,forward repudiability,TLS cipher suite,Java implementation,pairing-based key agreements
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要