You are here

Bibliography

Export 16 results:
Author Title Type [ Year(Asc)]
Filters: Keyword is robustness  [Clear All Filters]
2008
Danezis G, Diaz C. A Survey of Anonymous Communication Channels. [Internet]. 2008 . Available from: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.138.7951
Bless R, Hübsch C, Mies S, Waldhorst OP. The Underlay Abstraction in the Spontaneous Virtual Networks (SpoVNet) Architecture. In: Proc. 4th EuroNGI Conf. on Next Generation Internet Networks (NGI 2008). Proc. 4th EuroNGI Conf. on Next Generation Internet Networks (NGI 2008). Krakow, Poland; 2008. pp. 115-122. Available from: http://www.tm.uka.de/itm/WebMan/view.php?view=publikationen_detail&id=283
2007
Alvisi L, Doumen J, Guerraoui R, Koldehofe B, Li H, Renesse RV, Tredan G. How robust are gossip-based communication protocols?. Operating Systems Review [Internet]. 2007 ;41:14–18. Available from: http://doc.utwente.nl/64132/
Goldberg I. Improving the Robustness of Private Information Retrieval. In: Proceedings of the 2007 IEEE Symposium on Security and Privacy. Proceedings of the 2007 IEEE Symposium on Security and Privacy. IEEE Computer Society Washington, DC, USA; 2007. Available from: http://portal.acm.org/citation.cfm?id=1264203
2005
Fiat A, Saia J, Young M. Making chord robust to byzantine attacks. In: In Proc. of the European Symposium on Algorithms (ESA. In Proc. of the European Symposium on Algorithms (ESA. Springer; 2005. pp. 803–814. Available from: http://www.springerlink.com/content/422llxn7khwej72n/
2003
Buchegger S, Boudec J-YL. The Effect of Rumor Spreading in Reputation Systems for Mobile Ad-Hoc Networks. In: In Proceedings of WiOpt ‘03: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks”, Sophia-Antipolis. In Proceedings of WiOpt ‘03: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks”, Sophia-Antipolis. ; 2003. Available from: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.9006
Cohen B. Incentives build robustness in BitTorrent. In: NetEcon'03 - Proceedings of the Workshop on Economics of Peer-to-Peer Systems . NetEcon'03 - Proceedings of the Workshop on Economics of Peer-to-Peer Systems . Berkeley, CA, USA; 2003.
2002
Saia J, Fiat A, Gribble SD, Karlin AR, Saroiu S. Dynamically Fault-Tolerant Content Addressable Networks. [Internet]. 2002 . Available from: http://www.springerlink.com/content/r7fumjuwmgnd4md1/
Buchegger S, Boudec J-YL. Performance analysis of the CONFIDANT protocol. In: MobiHoc '02: Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing. MobiHoc '02: Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing. New York, NY, USA: ACM; 2002. pp. 226–236. Available from: http://portal.acm.org/citation.cfm?id=513828#
Beimel A, Stahl Y. Robust information-theoretic private information retrieval. In: Proceedings of the 3rd Conference on Security in Communication Networks. Vol. 2576. Proceedings of the 3rd Conference on Security in Communication Networks. Springer-Verlag; 2002. pp. 326–341. Available from: http://www.springerlink.com/content/9bnlbf2e2lp9u9p4/
2001
Jakobsson M, Juels A. An Optimally Robust Hybrid Mix Network (Extended Abstract). In: Proceedings of Principles of Distributed Computing - {PODC} '01. Proceedings of Principles of Distributed Computing - {PODC} '01. ACM Press; 2001. Available from: http://portal.acm.org/citation.cfm?id=383962.384046
Batten C, Barr K, Saraf A, Trepetin S. pStore: A Secure Peer-to-Peer Backup System. [Internet]. 2001 . Available from: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.3444
Ratnasamy S, Francis P, Handley M, Karp R, Shenker S. A scalable content-addressable network. In: SIGCOMM '01: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications. SIGCOMM '01: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications. New York, NY, USA: ACM; 2001. pp. 161–172. Available from: http://portal.acm.org/citation.cfm?id=383072#