Efficient Key Authentication Service for Secure End-to-End Communications
Efficient Key Authentication Service for Secure End-to-End Communications
复制标题
高效的密钥认证服务，实现安全的端到端通信
DOI：
10.1007/978-3-319-26059-4_10
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
Alptekin Küpçü
中科院分区：
文献类型：
--
作者：
Mohammad Etemad;Alptekin Küpçü
经过四十年的公钥密码学，工业界和学术界都在寻求更好的公钥基础设施解决方案。最近的一个提议，证书透明性概念，试图使不受信任的服务器作为公钥服务器，这样任何密钥所有者都可以验证她的密钥是否正确地保存在这些服务器上。不幸的是，由于高计算和通信要求，现有的证书透明度的建议不能解决这个问题作为一个整体。
我们提出了一种新的高效的密钥认证服务KAS。它使用服务器端的闲谈作为信任的来源，并假设服务器并不都是串通的。KAS将每个用户的所有密钥存储在一个单独的哈希链中，并且总是在服务器之间共享链的最后一个环，确保所有服务器提供关于他们的相同视图，即，没有任何含糊之处。单独存储用户的密钥大大减少了服务器和客户端的计算和通信，使我们的KAS公钥认证的一个非常有效的方式。KAS仅使用O 1证明大小在O 1时间内处理密钥注册/更改操作;与用户数量无关。虽然之前的最佳提案CONIKS要求客户端每天下载100 KB的证明，但我们的提案每个密钥生命周期需要不到1 KB的证明，同时获得与CONIKS相同的概率保证。
After four decades of public key cryptography, both the industry and academia seek better solutions for the public key infrastructure. A recent proposal, the certificate transparency concept, tries to enable untrusted servers act as public key servers, such that any key owner can verify that her key is kept properly at those servers. Unfortunately, due to high computation and communication requirements, existing certificate transparency proposals fail to address the problem as a whole.
We propose a new efficient key authentication service KAS. It uses server-side gossiping as the source of trust, and assumes servers are not all colluding. KAS stores all keys of each user in a separate hash chain, and always shares the last ring of the chain among the servers, ensuring the users that all servers provide the same view about them i.e., no equivocation takes place. Storing users' keys separately reduces the server and client computation and communication dramatically, making our KAS a very efficient way of public key authentication. The KAS handles a key registration/change operation in O1 time using only O1 proof size; independent of the number of users. While the previous best proposal, CONIKS, requires the client to download 100 KB of proof per day, our proposal needs less than 1 KB of proof per key lifetime, while obtaining the same probabilistic guarantees as CONIKS.