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

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

Abstract

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

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

Figures/Tables 4

References 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.

Metrics

Recommended 0

No Suggested Reading articles found!

方案	客户端	服务提供者端
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

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 4

References 19

Related Articles 12

Metrics

Recommended 0

[1]	Xia FENG, Kaiping CUI, Qingqing XIE, Liangmin WANG. Distributed anonymous authentication scheme based on the blockchain in VANET [J]. Journal on Communications, 2022, 43(9): 134-147.
[2]	Shun ZHANG,Hongli FAN,Hong ZHONG,Miaomiao TIAN. Efficient revocable certificateless remote anonymous authentication protocol for wireless body area network [J]. Journal on Communications, 2018, 39(4): 100-111.
[3]	Cheng SONG,Ming-yue ZHANG,Wei-ping PENG,Zong-pu JIA,Zhi-zhong LIU,Xi-xi YAN. Research on batch anonymous authentication scheme for VANET based on bilinear pairing [J]. Journal on Communications, 2017, 38(6): 49-57.
[4]	Cheng SONG,Ming-yue ZHANG,Wei-ping PENG,Zong-pu JIA,Zhi-zhong LIU,Xi-xi YAN. Research on pairing-free certificateless batch anonymous authentication scheme for VANET [J]. Journal on Communications, 2017, 38(11): 35-43.
[5]	Jin CAO,Yi-qing ZHENG,Hui LI. Conditional privacy-protection remote user authentication mechanism for WBAN [J]. Journal on Communications, 2016, 37(Z1): 63-71.
[6]	Jian-hong ZHANG,Wei-na ZHEN,Jian-cheng ZOU. New chameleon Hashing of secure and privacy-preserving vehicular communications [J]. Journal on Communications, 2014, 35(Z2): 191-195.
[7]	. New chameleon Hashing of secure and privacy-preserving vehicular communications [J]. Journal on Communications, 2014, 35(Z2): 26-195.
[8]	. Efficient anonymous reputation-based revocation without TTP [J]. Journal on Communications, 2014, 35(7): 2-21.
[9]	. Secure anonymous authentication scheme based on elliptic curve and zero-knowledge proof in VANET [J]. Journal on Communications, 2013, 34(5): 6-61.
[10]	Fang-bin LIU,Kun ZHANG,Hai LI,Hong ZHANG. Threshold traceability anonymous authentication scheme without trusted center for ad hoc network [J]. Journal on Communications, 2012, 33(8): 208-213.
[11]	Xin LIU,Qiu-liang XU. Unclonable dynamic k-times anonymous authentication [J]. Journal on Communications, 2012, 33(7): 75-89.
[12]	Chang-yuan LUO,Shi-wei HUO,Hong-zhi XING. Anonymous authentication scheme based on one-off public key in pervasive computing environments [J]. Journal on Communications, 2012, 33(2): 93-98.