Search Results

21 - 30 of 190 items :

  • Computer Sciences, other x
Clear All
Formation-based modelling and simulation of success in soccer

References Durlauf, S. N. & Blume, L.E. (2010). Game Theory . Palgrave Macmillan. Grunz, A., Perl, J., & Memmert, D. (2012). Tactical pattern recognition in soccer games by means of special Self-Organizing Maps. Human Movement Science, 31 (2), 334-43. Kohonen, T. (1995). Self-organizing maps . Berlin, Heidelberg, New York: Springer. Memmert D. (2011). Sports and Creativity. M.A. Runco and S.R. Pritzker (Eds.) Encyclopedia of Creativity, Second Edition, San Diego: Academic Press. 2, 373-378. Memmert, D., Lemmink, K. A. P. M

Open access
Externally Verifiable Oblivious RAM

References [1] D. Apon, J. Katz, E. Shi, and A. Thiruvengadam. Verifiable oblivious storage. In Public-Key Cryptography–PKC , pages 131–148. Springer, 2014. [2] N. Asokan, M. Schunter, and M. Waidner. Optimistic protocols for fair exchange. In Proceedings of the 4th ACM conference on Computer and communications security , pages 7–17. ACM, 1997. [3] N. Asokan, V. Shoup, and M. Waidner. Optimistic fair exchange of digital signatures , pages 591–606. Springer Berlin Heidelberg, Berlin, Heidelberg, 1998. [4] S. Devadas, M. van Dijk, C. W

Open access
Guard Sets in Tor using AS Relationships

framework for understanding and improving entry guard selection in tor. In Proceedings of the 2012 ACM Workshop on Privacy in the Electronic Society , WPES ’12, pages 43–54, New York, NY, USA, 2012. ACM. [16] N. S. Evans, R. Dingledine, and C. Grothoff. A practical congestion attack on Tor using long paths. In USENIX Security , 2009. [17] L. Gao. On inferring autonomous system relationships in the Internet. ACM/IEEE Transactions on Networks (TON) , 9(6), 2001. [18] J. Hayes and G. Danezis. Guard sets for onion routing. In Proceedings on Privacy

Open access
Scalable and Anonymous Group Communication with MTor

References [1] D. J. Bernstein, N. Duif, T. Lange, P. Schwabe, and B.-Y. Yang. High-speed High-security Signatures. Journal of Cryptographic Engineering, 2(2):77-89, 2012. [2] X. Cai, X. C. Zhang, B. Joshi, and R. Johnson. Touching from a Distance: Website Fingerprinting Attacks and Defenses. In ACM Conference on Computer and Communications Security (CCS), 2012. [3] M. Castro, P. Druschel, A.-M. Kermarrec, and A. I. T. Rowstron. Scribe: A Large-Scale and Decentralized Application- Level Multicast Infrastructure

Open access
PHI: Path-Hidden Lightweight Anonymity Protocol at Network Layer

. Laurie. Drac: An architecture for anonymous low-volume communications. In PETS, 2010. [24] G. Danezis, R. Dingledine, and N. Mathewson. Mixminion: Design of a type III anonymous remailer protocol. In IEEE S&P, 2003. [25] G. Danezis and I. Goldberg. Sphinx: A compact and provably secure mix format. In IEEE S&P, 2009. [26] S. DiBenedetto, P. Gasti, G. Tsudik, and E. Uzun. ANDaNA: Anonymous named data networking application. arXiv preprint arXiv:1112.2205, 2011. [27] R. Dingledine, N. Mathewson, and P

Open access
TagIt: Tagging Network Flows using Blind Fingerprints

limits of covert wireless communication. IEEE Communications Magazine , 53(12):26–31, 2015. [4] A. C. Bavier, M. Bowman, B. N. Chun, D. E. Culler, S. Karlin, S. Muir, L. L. Peterson, T. Roscoe, T. Spalink, and M. Wawrzoniak. Operating systems support for planetary-scale network services. In 1st Symposium on Networked Systems Design and Implementation (NSDI 2004), March 29-31, 2004, San Francisco, California, USA, Proceedings , pages 253–266, 2004. [5] A. Blum, D. X. Song, and S. Venkataraman. Detection of interactive stepping stones: Algorithms and

Open access
Private Evaluation of Decision Trees using Sublinear Cost

. Secure evaluation of private linear branching programs with medical applications. In ESORICS , pages 424–439, Berlin, Heidelberg, 2009. Springer-Verlag. [5] D. Beaver. Commodity-based cryptography (extended abstract). In STOC , pages 446–455, New York, NY, USA, 1997. ACM. [6] M. Bellare, V. T. Hoang, S. Keelveedhi, and P. Rogaway. Efficient garbling from a fixed-key blockcipher. In SP , pages 478–492, Washington, DC, USA, 2013. IEEE Computer Society. [7] A. Ben-David, N. Nisan, and B. Pinkas. Fairplaymp: A system for secure multi-party computation

Open access
MAPS: Scaling Privacy Compliance Analysis to a Million Apps

. Sundaresan, C. Kreibich, P. Gill, M. Allman, and V. Paxson, “Haystack: In situ mobile traffic analysis in user space,” CoRR , vol. abs/1510.01419, 2015. [42] D. Reidsma and J. Carletta, “Reliability measurement without limits,” Comput. Linguist. , vol. 34, no. 3, pp. 319–326, Sep. 2008. [43] J. Ren, M. Lindorfer, D. Dubois, A. Rao, D. Choffnes, and N. Vallina-Rodriguez, “Bug fixes, improvements, ... and privacy leaks – a longitudinal study of PII leaks across android app versions,” in NDSS ’18 , 2018. [44] J. Ren, A. Rao, M. Lindorfer, A. Legout, and D

Open access
Modelling Match Outcome in Australian Football: Improved accuracy with large databases

References Abeel, T., Helleputte, T., Van de Peer, Y., Dupont, P., & Saeys, Y. J. B. (2009). Robust biomarker identification for cancer diagnosis with ensemble feature selection methods. 26 (3), pp. 392-398. Berthelot, G., Tafflet, M., El Helou, N., Len, S., Escolano, S., Guillaume, M., ... Desgorces, F. D. (2010). Athlete atypicity on the edge of human achievement: performances stagnate after the last peak, in 1988. PloS One, 5 (1), p e8800. Castellano, J., Casamichana, D., & Lago, C. (2012). The use of match statistics that discriminate

Open access
Data-plane Defenses against Routing Attacks on Tor

Generation. In International Symposium on Recent Advances in Intrusion Detection (RAID), 2006. [5] CIDR Report 18 Aug 2015. http://www.cidr-report.org/as2.0/. [6] R. Dingledine, N. Mathewson, and P. Syverson. Tor: The Second- Generation Onion Router. In USENIX Security Symposium (USENIX), August 2004. [7] R. Dingledine, N. Hopper, G. Kadianakis, and N. Mathewson. One Fast Guard for Life (or 9 Months). In Privacy Enhancing Technologies Symposium (PETS), 2014. [8] K. P. Dyer, S. E. Coull, T. Ristenpart, and T

Open access