Server-Aided Verification: Theory and Practice
Server-Aided Verification: Theory and Practice
复制标题
DOI：
10.1007/11593447_33
复制
发表时间：
2005-12
期刊：
影响因子：
--
通讯作者：
M. Girault;David Lefranc
中科院分区：
文献类型：
--
作者：
M. Girault;David Lefranc
我们介绍了服务器辅助验证（SAV）概念，它通过将大部分计算委托给功能强大（但可能不受信任）的服务器来加快身份验证/签名方案的验证步骤。在给出了设计SAV协议的一些动机之后，我们提供了一个简单但现实的模型，它捕获了人们在实践中可能遇到的大多数情况（注意，这个模型比Hohenberger和Lysyanskaya最近提出的模型要通用得多，他们要求服务器由两个不相互通信的软件组成）。然后，我们在该模型中分析并证明了现有的两种SAV协议的安全性，即Schnorr方案的lin - lee[15]修改方案[28]和GPS方案的Girault-Quisquater变体[10][7,24]。最后，我们提出了一种基于双线性映射的方案SAV版本设计的通用方法，该方法可应用于Boneh-Boyen签名方案[3]、Zhang-Safavi-Naini-Susilo签名方案[32]和Shao-Lu-Cao识别方案[30]。
We introduce the server-aided verification (SAV) concept, which consists in speeding up the verification step of an authentication/signature scheme, by delegating a substantial part of computations to a powerful (but possibly untrusted) server. After giving some motivations for designing SAV protocols, we provide a simple but realistic model, which captures most situations one can meet in practice (note that this model is much more general than the one recently proposed by Hohenberger and Lysyanskaya, who require the server to be made of two softwares which do not communicate with each other [14]). Then, we analyze and prove in this model the security of two existing SAV protocols, namely the Lim-Lee [15] modification of Schnorr scheme [28] and the Girault-Quisquater variant [10] of GPS scheme [7,24]. Finally, we propose a generic method for designing SAV versions of schemes based on bilinear maps, which can be applied to the Boneh-Boyen signature schemes [3], the Zhang-Safavi-Naini-Susilo [32] signature scheme and the Shao-Lu-Cao identification scheme [30].