File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/978-3-642-33167-1_39
- Scopus: eid_2-s2.0-84865583485
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: PE(AR)2: privacy-enhanced anonymous authentication with reputation and revocation
Title | PE(AR)2: privacy-enhanced anonymous authentication with reputation and revocation |
---|---|
Authors | |
Keywords | Anonymous authentication Computation efficiency Efficiency improvement Reputation systems Service provider Third parties |
Issue Date | 2012 |
Publisher | Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ |
Citation | The 17th European Symposium on Research in Computer Security (ESORICS 2012), Pisa, Italy, 10-12 September 2012. In Lecture Notes in Computer Science, 2012, v. 7459, p. 679-696 How to Cite? |
Abstract | Anonymous authentication schemes allow users to act freely without being tracked. The users may not want to trust a third party in ensuring their privacy, yet a service provider (SP) should have the authority to blacklist a misbehaving user. They are seemingly contradicting requirements. PEREA was the most efficient solution to this problem. However, there are a few drawbacks which make it vulnerable and not practical enough. In this paper, we propose PE(AR)2, which not only fixes PEREA’s vulnerability, but also significantly improves its computation efficiency. Apart from revoking repeated misbehaving users, our system also rewards anonymous users via a built-in reputation system. Our scheme does not require the SP to timely review all previously authenticated sessions, and does not have the dependency on the blacklist size for user-side computation (c.f. EPID/BLAC(R)). Our benchmark on PE(AR)2 shows that an SP can handle over 160 requests/second – a 460-fold efficiency improvement over PEREA, when the credentials store 1000 single-use tickets. © 2012 Springer-Verlag. |
Persistent Identifier | http://hdl.handle.net/10722/184855 |
ISBN | |
ISSN | 2023 SCImago Journal Rankings: 0.606 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yu, KY | en_US |
dc.contributor.author | Yuen, TH | en_US |
dc.contributor.author | Chow, SSM | en_US |
dc.contributor.author | Yiu, SM | en_US |
dc.contributor.author | Hui, LCK | en_US |
dc.date.accessioned | 2013-07-15T10:14:41Z | - |
dc.date.available | 2013-07-15T10:14:41Z | - |
dc.date.issued | 2012 | en_US |
dc.identifier.citation | The 17th European Symposium on Research in Computer Security (ESORICS 2012), Pisa, Italy, 10-12 September 2012. In Lecture Notes in Computer Science, 2012, v. 7459, p. 679-696 | en_US |
dc.identifier.isbn | 978-364233166-4 | - |
dc.identifier.issn | 0302-9743 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/184855 | - |
dc.description.abstract | Anonymous authentication schemes allow users to act freely without being tracked. The users may not want to trust a third party in ensuring their privacy, yet a service provider (SP) should have the authority to blacklist a misbehaving user. They are seemingly contradicting requirements. PEREA was the most efficient solution to this problem. However, there are a few drawbacks which make it vulnerable and not practical enough. In this paper, we propose PE(AR)2, which not only fixes PEREA’s vulnerability, but also significantly improves its computation efficiency. Apart from revoking repeated misbehaving users, our system also rewards anonymous users via a built-in reputation system. Our scheme does not require the SP to timely review all previously authenticated sessions, and does not have the dependency on the blacklist size for user-side computation (c.f. EPID/BLAC(R)). Our benchmark on PE(AR)2 shows that an SP can handle over 160 requests/second – a 460-fold efficiency improvement over PEREA, when the credentials store 1000 single-use tickets. © 2012 Springer-Verlag. | - |
dc.language | eng | en_US |
dc.publisher | Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ | en_US |
dc.relation.ispartof | Lecture Notes in Computer Science | en_US |
dc.rights | The original publication is available at www.springerlink.com | - |
dc.subject | Anonymous authentication | - |
dc.subject | Computation efficiency | - |
dc.subject | Efficiency improvement | - |
dc.subject | Reputation systems | - |
dc.subject | Service provider | - |
dc.subject | Third parties | - |
dc.title | PE(AR)2: privacy-enhanced anonymous authentication with reputation and revocation | en_US |
dc.type | Conference_Paper | en_US |
dc.identifier.email | Yuen, TH: johnyuen@hku.hk | en_US |
dc.identifier.email | Chow, SSM: schow@cs.nyu.edu | en_US |
dc.identifier.email | Yiu, SM: smyiu@cs.hku.hk | en_US |
dc.identifier.email | Hui, LCK: hui@cs.hku.hk | - |
dc.identifier.authority | Yiu, SM=rp00207 | en_US |
dc.identifier.authority | Hui, LCK=rp00120 | en_US |
dc.identifier.doi | 10.1007/978-3-642-33167-1_39 | - |
dc.identifier.scopus | eid_2-s2.0-84865583485 | - |
dc.identifier.hkuros | 215062 | en_US |
dc.identifier.volume | 7459 | en_US |
dc.identifier.spage | 679 | en_US |
dc.identifier.epage | 696 | en_US |
dc.publisher.place | Germany | - |
dc.customcontrol.immutable | sml 131009 | - |
dc.identifier.issnl | 0302-9743 | - |