Name
Abstract | ||
|---|---|---|
We show that the communication efficient t-out-of-m scheme proposed by De Santis, Di Crescenzo, and Persiano [Communicationefficient anonymous group identification, ACM Conference on Computer and Communications Security, (1998) 73-82] is incorrect; an authorized group may fail to prove the identity even though the verifier is honest. We rigorously discuss the condition where the scheme works correctly. In addition, we propose a new scheme attaining Θ(mn) communication complexity, where n is the security parameter. It improves the current best communication complexity Θ(mn) of the t-out-of-m scheme, and it can be also considered as a zero-knowledge proof for t out of m secrets. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-73458-1_27 | ACISP |
Keywords | Field | DocType |
communications security,current best communication complexity,acm conference,threshold anonymous group identification,de santis,authorized group,t-out-of-m scheme,communicationefficient anonymous group identification,new scheme attaining,communication complexity,zero-knowledge proof,communication efficient t-out-of-m scheme,zero knowledge proof | Computer science,Group identification,Theoretical computer science,Communication complexity,Security parameter,Zero-knowledge proof,Communications security,Distributed computing | Conference |
Volume | ISSN | Citations |
4586 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Akihiro Yamamura | 1 | 96 | 13.29 |
| Takashi Kurokawa | 2 | 0 | 0.68 |
| Junji Nakazato | 3 | 22 | 6.01 |