File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/11780656_19
- Scopus: eid_2-s2.0-33746354988
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Event-oriented k-times revocable-iff-linked group signatures
Title | Event-oriented k-times revocable-iff-linked group signatures |
---|---|
Authors | |
Keywords | Event-oriented Group signature K-TAA Revocable anonymity Artificial intelligence |
Issue Date | 2006 |
Publisher | Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ |
Citation | The 11th Australian Conference on Information Security and Privacy (ACISP 2006), Melbourne, Australia, 3-5 July 2006. In Lecture Notes in Computer Science, 2006, v. 4058, p. 223-234 How to Cite? |
Abstract | In this paper, we introduce the notion of event-oriented k-times revocable if and only if linked group signatures (k-EoRiffL group signatures). In k-EoRiffL group signatures, signers can sign on behalf of a group anonymously und unlinkably up to a permitted number of times (k) per event. No party, even the group manager, can revoke the anonymity of the signer. On the other hand, everyone can identify the signer if he signs more than k times for a particular event. We then show that k-EoRiffL group signatures can be used for k-times anonymous authentication(k-TAA), compact e- cash, e-voting, etc. We formally define security model for the new notion and propose constant-size construction, that is, size of our construction is independent of the size of the group and the number of permitted usage k. Our construction is secure based on the q-strong Diffie-Hellman assumption and the y-DDHI assumption. © Springer-Vorlag Berlin Heidelberg 2006. |
Description | LNCS v. 4058 is Proceedings of the 11th Australasian Conference, ACISP 2006 |
Persistent Identifier | http://hdl.handle.net/10722/93080 |
ISSN | 2023 SCImago Journal Rankings: 0.606 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Au, MH | en_HK |
dc.contributor.author | Susilo, W | en_HK |
dc.contributor.author | Yiu, SM | en_HK |
dc.date.accessioned | 2010-09-25T14:50:17Z | - |
dc.date.available | 2010-09-25T14:50:17Z | - |
dc.date.issued | 2006 | en_HK |
dc.identifier.citation | The 11th Australian Conference on Information Security and Privacy (ACISP 2006), Melbourne, Australia, 3-5 July 2006. In Lecture Notes in Computer Science, 2006, v. 4058, p. 223-234 | en_HK |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10722/93080 | - |
dc.description | LNCS v. 4058 is Proceedings of the 11th Australasian Conference, ACISP 2006 | - |
dc.description.abstract | In this paper, we introduce the notion of event-oriented k-times revocable if and only if linked group signatures (k-EoRiffL group signatures). In k-EoRiffL group signatures, signers can sign on behalf of a group anonymously und unlinkably up to a permitted number of times (k) per event. No party, even the group manager, can revoke the anonymity of the signer. On the other hand, everyone can identify the signer if he signs more than k times for a particular event. We then show that k-EoRiffL group signatures can be used for k-times anonymous authentication(k-TAA), compact e- cash, e-voting, etc. We formally define security model for the new notion and propose constant-size construction, that is, size of our construction is independent of the size of the group and the number of permitted usage k. Our construction is secure based on the q-strong Diffie-Hellman assumption and the y-DDHI assumption. © Springer-Vorlag Berlin Heidelberg 2006. | - |
dc.language | eng | en_HK |
dc.publisher | Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ | - |
dc.relation.ispartof | Lecture Notes in Computer Science | en_HK |
dc.rights | The original publication is available at www.springerlink.com | - |
dc.subject | Event-oriented | - |
dc.subject | Group signature | - |
dc.subject | K-TAA | - |
dc.subject | Revocable anonymity | - |
dc.subject | Artificial intelligence | - |
dc.title | Event-oriented k-times revocable-iff-linked group signatures | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.email | Au, MH: mhaa456@uow.edu.au | en_HK |
dc.identifier.email | Susilo, W: wsusilo@uow.edu.au | - |
dc.identifier.email | Yiu, SM: smyiu@cs.hku.hk | - |
dc.identifier.authority | Yiu, SM=rp00207 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/11780656_19 | - |
dc.identifier.scopus | eid_2-s2.0-33746354988 | - |
dc.identifier.hkuros | 161386 | en_HK |
dc.identifier.volume | 4058 | - |
dc.identifier.spage | 223 | en_HK |
dc.identifier.epage | 234 | en_HK |
dc.description.other | The 11th Australian Conference on Information Security and Privacy (ACISP 2006), Melbourne, Australia, 3-5 July 2006. In Lecture Notes in Computer Science, 2006, v. 4058, p. 223-234 | - |
dc.identifier.issnl | 0302-9743 | - |