Unclonable dynamic k-times anonymous authentication

In previous works of k-times anonymous authentication,two problems have not been properly solved:1)how to allow application providers to assign different maximal numbers of access for each user without weakened anonymity,and 2)how to protect against massive clone attacks mounted by malicious users.T...

Full description

Saved in:
Bibliographic Details
Main Authors: Xin LIU, Qiu-liang XU
Format: Article
Language:zho
Published: Editorial Department of Journal on Communications 2012-07-01
Series:Tongxin xuebao
Subjects:
Online Access:http://www.joconline.com.cn/zh/article/doi/1000-436X(2012)07-0075-15/
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1841539920723705856
author Xin LIU
Qiu-liang XU
author_facet Xin LIU
Qiu-liang XU
author_sort Xin LIU
collection DOAJ
description In previous works of k-times anonymous authentication,two problems have not been properly solved:1)how to allow application providers to assign different maximal numbers of access for each user without weakened anonymity,and 2)how to protect against massive clone attacks mounted by malicious users.To overcome these obstacles,a revised scheme was proposed.It incorporated several crucial tools including the proof that a committed value is less than another committed value,dynamic accumulator,the method of cloning detection based on n-times show e-tokens,etc.The new scheme is proven secure in a new security model which was obtained by modifying the security model of Teranishi et al.Moreover,the registration protocol of the new scheme is concurrently-secure,so it is fit for the deployment in realistic asynchronous network setting(e.g.,Internet).
format Article
id doaj-art-c5168eac912f4dd29e805f5bc1930dc8
institution Kabale University
issn 1000-436X
language zho
publishDate 2012-07-01
publisher Editorial Department of Journal on Communications
record_format Article
series Tongxin xuebao
spelling doaj-art-c5168eac912f4dd29e805f5bc1930dc82025-01-14T06:32:21ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2012-07-0133758959663478Unclonable dynamic k-times anonymous authenticationXin LIUQiu-liang XUIn previous works of k-times anonymous authentication,two problems have not been properly solved:1)how to allow application providers to assign different maximal numbers of access for each user without weakened anonymity,and 2)how to protect against massive clone attacks mounted by malicious users.To overcome these obstacles,a revised scheme was proposed.It incorporated several crucial tools including the proof that a committed value is less than another committed value,dynamic accumulator,the method of cloning detection based on n-times show e-tokens,etc.The new scheme is proven secure in a new security model which was obtained by modifying the security model of Teranishi et al.Moreover,the registration protocol of the new scheme is concurrently-secure,so it is fit for the deployment in realistic asynchronous network setting(e.g.,Internet).http://www.joconline.com.cn/zh/article/doi/1000-436X(2012)07-0075-15/k-times anonymous authenticationzero-knowledge proofthe cloning attackOmega-protocolconcurrent zero-knowledge
spellingShingle Xin LIU
Qiu-liang XU
Unclonable dynamic k-times anonymous authentication
Tongxin xuebao
k-times anonymous authentication
zero-knowledge proof
the cloning attack
Omega-protocol
concurrent zero-knowledge
title Unclonable dynamic k-times anonymous authentication
title_full Unclonable dynamic k-times anonymous authentication
title_fullStr Unclonable dynamic k-times anonymous authentication
title_full_unstemmed Unclonable dynamic k-times anonymous authentication
title_short Unclonable dynamic k-times anonymous authentication
title_sort unclonable dynamic k times anonymous authentication
topic k-times anonymous authentication
zero-knowledge proof
the cloning attack
Omega-protocol
concurrent zero-knowledge
url http://www.joconline.com.cn/zh/article/doi/1000-436X(2012)07-0075-15/
work_keys_str_mv AT xinliu unclonabledynamicktimesanonymousauthentication
AT qiuliangxu unclonabledynamicktimesanonymousauthentication