You are here

Bibliography

Export 82 results:
Author Title Type [ Year(Asc)]
Filters: First Letter Of Title is D  [Clear All Filters]
2002
Camenisch J, Lysyanskaya A. Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials. In: Proceedings of CRYPTO 2002. Proceedings of CRYPTO 2002. Springer Verlag, LNCS 2442; 2002. pp. 61–76. Available from: http://portal.acm.org/citation.cfm?id=704437
2004
Iwanik J, Klonowski M, Kutylowski M. DUO–Onions and Hydra–Onions – Failure and Adversary Resistant Onion Protocols. In: Proceedings of the IFIP TC-6 TC-11 Conference on Communications and Multimedia Security 2004. Proceedings of the IFIP TC-6 TC-11 Conference on Communications and Multimedia Security 2004. Springer Boston; 2004. Available from: http://www.springerlink.com/content/019lu6xp5b9fctn8/
2002
Berthold O, Langos H. Dummy Traffic Against Long Term Intersection Attacks. In: Dingledine R, Syverson P Proceedings of Privacy Enhancing Technologies workshop (PET 2002). Proceedings of Privacy Enhancing Technologies workshop (PET 2002). Springer-Verlag, LNCS 2482; 2002. Available from: http://www.springerlink.com/content/66ybualwu5hmh563/
2010
Danezis G, Diaz C, Troncoso C, Laurie B. Drac: An Architecture for Anonymous Low-Volume Communications. In: Atallah MJ, Hopper NJ Privacy Enhancing Technologies. Vol. 6205. Privacy Enhancing Technologies. Springer Berlin Heidelberg; 2010. pp. 202-219. Available from: http://dx.doi.org/10.1007/978-3-642-14527-8_12
2014
Borisov N, Danezis G, Goldberg I. DP5: A Private Presence Service. Centre for Applied Cryptographic Research (CACR), University of Waterloo. 2014 .
2008
McLachlan J, Hopper NJ. Don't Clog the Queue: Circuit Clogging and Mitigation in P2P anonymity schemes. In: Proceedings of Financial Cryptography (FC '08). Proceedings of Financial Cryptography (FC '08). Springer-Verlag Berlin, Heidelberg; 2008. Available from: http://portal.acm.org/citation.cfm?id=1428551
2007
Diaz C, Troncoso C, Danezis G. Does additional information always reduce anonymity?. In: Yu T Proceedings of the Workshop on Privacy in the Electronic Society 2007. Proceedings of the Workshop on Privacy in the Electronic Society 2007. Alexandria,VA,USA: ACM New York, NY, USA; 2007. pp. 72–75. Available from: http://portal.acm.org/citation.cfm?id=1314333.1314347
Piatek M, Isdal T, Anderson T, Krishnamurthy A, Venkataramani A. Do incentives build robustness in BitTorrent?. In: NSDI'07. Proceedings of the 4th USENIX Conference on Networked Systems Design Implementation. NSDI'07. Proceedings of the 4th USENIX Conference on Networked Systems Design Implementation. Cambridge, MA, USA: USENIX Association; 2007. pp. 1–1. Available from: http://dl.acm.org/citation.cfm?id=1973430.1973431
Piatek M, Isdal T, Anderson T, Krishnamurthy A, Venkataramani A. Do incentives build robustness in BitTorrent?. In: NSDI'07. Proceedings of the 4th USENIX Conference on Networked Systems Design Implementation. NSDI'07. Proceedings of the 4th USENIX Conference on Networked Systems Design Implementation. Cambridge, MA, USA: USENIX Association; 2007. pp. 1–1. Available from: http://dl.acm.org/citation.cfm?id=1973430.1973431
2014
Oya S, Troncoso C, Pérez-González F. Do Dummies Pay Off? Limits of Dummy Traffic Protection in Anonymous Communications. In: De Cristofaro E, Murdoch SJ Privacy Enhancing Technologies. Vol. 8555. Privacy Enhancing Technologies. Springer International Publishing; 2014. pp. 204-223. Available from: http://dx.doi.org/10.1007/978-3-319-08506-7_11
2006
Sandberg O. Distributed Routing in Small-World Networks. In: Algorithm Engineering and Experiments. Algorithm Engineering and Experiments. SIAM; 2006. Available from: http://www.math.chalmers.se/ ossa/wrt.html
2006
Ahmed R, Boutaba R. Distributed Pattern Matching: A Key to Flexible and Efficient P2P Search. In: 2006 IEEE/IFIP Network Operations and Management Symposium NOMS 2006. 2006 IEEE/IFIP Network Operations and Management Symposium NOMS 2006. IEEE; 2006. pp. 198–208. Available from: http://dx.doi.org/10.1109/NOMS.2006.1687551
Ghodsi A. Distributed k-ary System: Algorithms for Distributed Hash Tables. Department of Electronic, Computer, and Software Systems [Internet]. 2006 :209. Available from: http://eprints.sics.se/516/
2004
Cramer C, Kutzner K, Fuhrmann T. Distributed Job Scheduling in a Peer-to-Peer Video Recording System. In: Proceedings of the Workshop on Algorithms and Protocols for Efficient Peer-to-Peer Applications (PEPPA) at Informatik 2004. Proceedings of the Workshop on Algorithms and Protocols for Efficient Peer-to-Peer Applications (PEPPA) at Informatik 2004. Ulm, Germany; 2004. pp. 234–238. Available from: http://i30www.ira.uka.de/research/publications/p2p/
2005
Wehrle K, Götz S, Rieche S. Distributed Hash Tables. In: Peer-to-Peer Systems and Applications. Vol. 3485. Peer-to-Peer Systems and Applications. Springer; 2005.
2006
Wang Y-H, Chao C-F, Lin S-W, Chen W-T. A distributed data caching framework for mobile ad hoc networks. In: IWCMC '06: Proceedings of the 2006 international conference on Wireless communications and mobile computing. IWCMC '06: Proceedings of the 2006 international conference on Wireless communications and mobile computing. New York, NY, USA: ACM; 2006. pp. 1357–1362. Available from: http://portal.acm.org/citation.cfm?id=1143821#

Pages