File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/INFCOM.2009.5062030
- Scopus: eid_2-s2.0-70349653422
- WOS: WOS:000275366200131
- Find via
Supplementary
- Citations:
- Appears in Collections:
Conference Paper: MIX-crowds, an anonymity scheme for file retrieval systems
Title | MIX-crowds, an anonymity scheme for file retrieval systems |
---|---|
Authors | |
Keywords | Communications Computer applications |
Issue Date | 2009 |
Publisher | IEEE, Computer Society. The Journal's web site is located at http://www.ieee-infocom.org/ |
Citation | The 28th International Conference on Computer Communications (IEEE INFOCOM 2009), Rio de Janeiro, Brazil, 19-25 April 2009. In Proceedings of the IEEE Infocom, 2009, p. 1170-1178 How to Cite? |
Abstract | In this paper, we propose an anonymous scheme for file retrieval systems, MIX-Crowds, in which it is harder for an attacker to identify the requester of the file by making use of the idea of MIX [7] and Crowds [20] to establish a path from the requester to the file holder. Result shows that predecessor attack [26] is much more difficult to succeed compared with Crowds [20]. We are able to reduce the estimated number of rounds needed for successful predecessor attack for MIX-Crowds. We also propose a file transfer strategy according to file size. With such strategy, requests for small size files can be completed faster while the downloading time of large size files only increases slightly. © 2009 IEEE. |
Persistent Identifier | http://hdl.handle.net/10722/125705 |
ISBN | |
ISSN | 2023 SCImago Journal Rankings: 2.865 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Tang, WH | en_HK |
dc.contributor.author | Chan, HW | en_HK |
dc.date.accessioned | 2010-10-31T11:47:06Z | - |
dc.date.available | 2010-10-31T11:47:06Z | - |
dc.date.issued | 2009 | en_HK |
dc.identifier.citation | The 28th International Conference on Computer Communications (IEEE INFOCOM 2009), Rio de Janeiro, Brazil, 19-25 April 2009. In Proceedings of the IEEE Infocom, 2009, p. 1170-1178 | en_HK |
dc.identifier.isbn | 978-1-4244-3513-5 | - |
dc.identifier.issn | 0743-166X | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/125705 | - |
dc.description.abstract | In this paper, we propose an anonymous scheme for file retrieval systems, MIX-Crowds, in which it is harder for an attacker to identify the requester of the file by making use of the idea of MIX [7] and Crowds [20] to establish a path from the requester to the file holder. Result shows that predecessor attack [26] is much more difficult to succeed compared with Crowds [20]. We are able to reduce the estimated number of rounds needed for successful predecessor attack for MIX-Crowds. We also propose a file transfer strategy according to file size. With such strategy, requests for small size files can be completed faster while the downloading time of large size files only increases slightly. © 2009 IEEE. | en_HK |
dc.language | eng | en_HK |
dc.publisher | IEEE, Computer Society. The Journal's web site is located at http://www.ieee-infocom.org/ | en_HK |
dc.relation.ispartof | Proceedings of the IEEE Infocom | en_HK |
dc.rights | ©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. | - |
dc.subject | Communications | - |
dc.subject | Computer applications | - |
dc.title | MIX-crowds, an anonymity scheme for file retrieval systems | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=978-1-4244-3513-5&volume=&spage=1170&epage=1178&date=2009&atitle=MIX-crowds:+an+anonymous+scheme+for+file+retrieval+systems | - |
dc.identifier.email | Chan, HW:hwchan@cs.hku.hk | en_HK |
dc.identifier.authority | Chan, HW=rp00091 | en_HK |
dc.description.nature | published_or_final_version | - |
dc.identifier.doi | 10.1109/INFCOM.2009.5062030 | en_HK |
dc.identifier.scopus | eid_2-s2.0-70349653422 | en_HK |
dc.identifier.hkuros | 180313 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-70349653422&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.spage | 1170 | en_HK |
dc.identifier.epage | 1178 | en_HK |
dc.identifier.isi | WOS:000275366200131 | - |
dc.publisher.place | United States | en_HK |
dc.description.other | The 28th International Conference on Computer Communications (IEEE INFOCOM 2009), Rio de Janeiro, Brazil, 19-25 April 2009. In Proceedings of the IEEE Infocom, 2009, p. 1170-1178 | - |
dc.identifier.scopusauthorid | Tang, WH=7403430888 | en_HK |
dc.identifier.scopusauthorid | Chan, HW=24828151400 | en_HK |
dc.identifier.issnl | 0743-166X | - |