基于信誉的快速无可信第三方匿名撤销方案

doi:10.3969/j.issn.1000-436x.2014.07.002

通信学报 ›› 2014, Vol. 35 ›› Issue (7): 10-21.doi: 10.3969/j.issn.1000-436x.2014.07.002

• 论文Ⅰ：密码算法与安全协议 • 上一篇下一篇

基于信誉的快速无可信第三方匿名撤销方案

奚瓅^1,²,冯登国¹

¹ 中国科学院软件研究所可信计算与信息保障实验室，北京 100190
² 中国科学院大学，北京 100049

出版日期:2014-07-25 发布日期:2017-06-24
基金资助:
国家自然科学基金资助项目;国家自然科学基金资助项目;国家重点基础研究发展规划（“973”计划）基金资助项目

Efficient anonymous reputation-based revocation without TTP

Li XI^1,²,ENGDeng-guo F¹

¹ TCA, Institute of Software, Chinese Academy of Sciences, Beijing 100190, China
² University of Chinese Academy Sciences, Beijing 100049, China

Online:2014-07-25 Published:2017-06-24
Supported by:
The National Natural Science Foundation of China;The National Natural Science Foundation of China;The National Basic Research Pro-gram of China (973 Program)

摘要/Abstract

摘要：

首先指出ESORICS 2012中匿名撤销方案PE(AR)²的安全问题，然后提出一个基于信誉的不依赖可信第三方的快速匿名撤销方案。该方案允许服务提供者赋予匿名会话正分或者负分并封禁信誉过低的用户，实验结果表明，当K=80时，本方案可以支持每分钟820次的登录请求，而此前最快速的方案PERM只能支持每分钟21次的登录请求。

关键词: 匿名撤销, 匿名信誉, 无可信第三方, 匿名认证

Abstract:

The security problems in PE(AR)²are pointed out then a new TTP-free scheme is proposed to supports anony-mous reputation-based revocation. This scheme allows the SP(service provider) to assign positive or negative scores to anonymous sessions and block users whose reputations are not high enough. The benchmark shows that for proposed scheme the SP can handle 820 authentications per minute while PERM can only handle 21 authentications per minute.

Key words: anonymous revocation, anonymous reputation, TTP-free, anonymous authentication

奚瓅,冯登国. 基于信誉的快速无可信第三方匿名撤销方案[J]. 通信学报, 2014, 35(7): 10-21.

Li XI,ENGDeng-guo F. Efficient anonymous reputation-based revocation without TTP[J]. Journal on Communications, 2014, 35(7): 10-21.

图/表 4

参考文献 19

[1]	LI J , LI N , XUE R . Universal accumulators with efficient nonmembership proofs[A]. Proceedings of ACNS 2007[C]. Springer, 2007. 253-269.
[2]	BONEH D , SHACHAM H . Group signatures with verifier-local revocation[A]. Proceedings of ACM CCS 2004[C]. ACM, 2004. 168-177.
[3]	TSANG P P , KAPADIA A , CORNELIUS C , et al. Nymble:blockingmisbehaving users in anonymizing networks[J]. IEEE Transactions on Dependable and Secure Computing 2011,8(2):256-269.
[4]	TSANG P P , AU M H , KAPADIA A , et al. BLAC: Revoking repeatedlymisbehaving anonymous users without relying on TTPs[J]. ACM Transactions on Information and System Security (TISSEC) 2010,13(4):39-46.
[5]	BRICKELL E , LI J . Enhanced privacy ID: a direct anonymous attestation schemewith enhanced revocation capabilities[A]. Proceedings of WPES 2007[C]. ACM, 2007. 21-30.
[6]	AU M H , TSANG P P , KAPADIA A , et al. PEREA: practical TTP-free revocation of repeatedly misbehaving anonymous users[J]. ACM Transactions on Information and System Security (TISSEC) 2011,14(4):29.
[7]	CAMENISCH J , HOHENBERGER S , et al. How to win theclonewars:efficient periodic n-times anonymousauthentication[A]. Proceedings of ACM CCS 2006[C]. ACM, 2006. 201-210.
[8]	LOFGREN P , HOPPER N . Faust: efficient, TTP-free abuse prevention by anonymouswhitelisting[A]. Proceedings of WPES 2011[C]. ACM, 2011. 125-130.
[9]	YU K Y , YUEN T H , CHOW S S , et al. PE (AR)2: Privacy-enhanced anonymous authentication with reputation and revocation[A]. Proceedings of ESORICS 2012[C]. Springer, 2012. 679-696.
[10]	AU M H , KAPADIA A , SUSILO W . BlACR: TTP-free blacklistable anonymous credentials with reputation[A]. Proceedings of NDSS 2012[C]. San Diego, CA, USA.
[11]	AU M H , KAPADIA A . PERM: Practical reputation-based blacklisting withoutTTP[A]. Proceedings of ACM CCS 2012[C]. ACM, 2012. 929-940.
[12]	DAMGARD I . On σ-protocols[[R]. Lecture notes for CPT, 2002.
[13]	CAMENISCH J , STADLER M . Efficient group signature schemes for large groups[A]. CRYPTO'97[C]. Springer, 1997. 410-424.
[14]	FUJISAKI E , OKAMOTO T . Statistical zero knowledge protocols to prove modularpolynomial relations[A]. CRYPTO'97[C]. Springer, 1997. 16-30.
[15]	DAMG?RD I , FUJISAKI E . A statistically-hiding integer commitment scheme basedon groups with hidden order[A]. ASIACRYPT 2002[C]. Springer, 2002. 125-142.
[16]	PENG K , BAO F . Vulnerability of a non-membership proof scheme[A]. ISECRYPT 2010[C]. IEEE, 2010. 1-4.
[17]	CAMENISCH J , LYSYANSKAYA A . A signature scheme with efficient protocols[A]. Security in Communication Networks[C]. Springer, 2003. 268-289.
[18]	CAMENISCH J , CHAABOUNI R , et al. Efficient protocols for set membership andrange proofs[A]. ASIACRYPT 2008[C]. Springer, 2008. 234-252.
[19]	DUSART P . The k th prime is greater than k (ln k+ln ln k-1) for k＞2[J]. Mathematics of Computation,68, Springer, 1999. 411-415.

方案	客户端	服务提供者端
ARBRE	O(ΔL)	O(K)
PEREA	O(KΔL)	O(K)
BLACR	O(ΔL)	O(ΔL)
PERM	O(K)	O(K)

基于信誉的快速无可信第三方匿名撤销方案

Efficient anonymous reputation-based revocation without TTP

在线阅读

PDF下载

可视化

被引次数

摘要/Abstract

引用本文

使用本文

图/表 4

参考文献 19

相关文章 11

Metrics

推荐阅读 0

[1]	冯霞, 崔凯平, 谢晴晴, 王良民. VANET中基于区块链的分布式匿名认证方案[J]. 通信学报, 2022, 43(9): 134-147.
[2]	张顺,范鸿丽,仲红,田苗苗. 无线体域网中高效可撤销的无证书远程匿名认证协议[J]. 通信学报, 2018, 39(4): 100-111.
[3]	宋成,张明月,彭维平,贾宗璞,刘志中,闫玺玺. 基于双线性对的车联网批量匿名认证方案研究[J]. 通信学报, 2017, 38(6): 49-57.
[4]	宋成,张明月,彭维平,贾宗璞,刘志中,闫玺玺. 基于非线性对的车联网无证书批量匿名认证方案研究[J]. 通信学报, 2017, 38(11): 35-43.
[5]	曹进,郑怡清,李晖. WBAN网络中条件隐私保护的远程用户认证方案[J]. 通信学报, 2016, 37(Z1): 63-71.
[6]	奚瓅，冯登国. 基于信誉的快速无可信第三方匿名撤销方案[J]. 通信学报, 2014, 35(7): 2-21.
[7]	李晋国1,2，林亚平1,2，李睿1,2，周四望1,2. 车载自组织网络中基于椭圆曲线零知识证明的匿名安全认证机制[J]. 通信学报, 2013, 34(5): 6-61.
[8]	刘方斌,张琨,李海,张宏. 无可信中心的门限追踪ad hoc网络匿名认证[J]. 通信学报, 2012, 33(8): 208-213.
[9]	柳欣,徐秋亮. 不可克隆的动态k次匿名认证方案[J]. 通信学报, 2012, 33(7): 75-89.
[10]	罗长远,霍士伟,邢洪智. 普适环境中基于一次性公钥的匿名认证方案[J]. 通信学报, 2012, 33(2): 93-98.
[11]	甄鸿鹄,陈越,谭鹏许,郭渊博. 基于非对称双线性对的直接匿名认证方案[J]. 通信学报, 2010, 31(8A): 37-43.