Seminar Algorithms for Computer Networks (WS 2019/20)

News

• 19.10.2019: web page online

Dates

• 25.10.2019 14:15 – First meeting in room 00-031, building 51
• 04.11.2019 – submit 3 topics of your choice to ILIAS forum 
• 08.11.2019 14:15 – Topic Assignment
• 06.12.2019 14:15 – Kickoff presentations in room 00-031, building 51
• 13.12.2019 14:00 – Kickoff presentations in room 00-031, building 51
• 01.02.2020 – Deadline for written report
• 17/18.02.2020 – Final presentations (starting 10am, lunch break 12am to 1pm, room 101-01-018)

Contents

We discuss up-to-date topics of distributed algorithms, cryptography, coding theory, and wireless communication.

1. Cryptography
   1. "A Secure and Efficient Parallel-Dependency RFID Grouping-Proof Protocol", Cherneva and Trahan,  IEEE International Conference on RFID, 2019. link
   2. "Delegation of Decryption Rights With Revocability From Learning With Errors", Yin, Wen, Liang, Zhang, Chen, Yan, and Zhang, IEEE Access 6, 2018. link
   3. "Communication-Optimal Proactive Secret Sharing for Dynamic Groups", Baron and Defrawy, International Conference on Applied Cryptography and Network Security, 2015. link
   4. "Public key cryptosystems based on composite degree residue classes", Paillier, International Conference on the Theory and Applications of Cryptographic Techniques, 1999. link
   5. "A new public-key cryptosystem as secure as factoring", Okamoto and Uchiyama, International Conference on the Theory and Applications of Cryptographic Techniques, 1998. link
   6. "Probabilistic encryption & how to play mental poker keeping secret all partial information", Goldwasser, Micali, Annual ACM Symposium on Theory of Computing, 1982. link
   7. "Fully homomorphic encryption over the integers", Dijk, Gentry, Halevi, and Vaikuntanathan, Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2010. link
   8. "Fully Homomorphic Encryption over the Integers with Shorter Public Keys", Coron, Mandal, Naccache, and Tibouchi, Annual Cryptology Conference, 2011. link
2. Stabilization, Distributed Systems
   
   1. "Self-Stabilizing Leader Election", Chen and Chen, ACM Symposium on Principles of Distributed Computing, 2019. link
   2. "Locally-Iterative Distributed (Δ+1)-Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted Bandwidth Models", Barenboim, Elkin, and Goldenberg, ACM Symposium on Principles of Distributed Computing, 2018. link
   3. "Interactive Distributed Proofs", Kol, Oshman, Saxena, ACM Symposium on Principles of Distributed Computing, 2018. link
   4. "Proof-labeling schemes: broadcast, unicast and in between", Patt-Shamir and Perry, International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2017. link
3. Wireless Sensor Networks
   1. "Average Counting via Approximate Histograms", Cichoń and Gotfryd, ACM Transactions on Sensor Networks 14(2), 2018. link
   2. "Zippy: On-Demand Network Flooding", Sutton, Buchli, Beutel, and Thiele, ACM Conference on Embedded Networked Sensor Systems, 2015. link
   3. Fundamentals of Wireless Communication, David Tse, University of California, Pramod Viswanath, University of Illinois, Chapter 8.1. V-Blast Architecture: Performance Gains in a MIMO Channel
   4. Fundamentals of Wireless Communication, David Tse, University of California, Pramod Viswanath, University of Illinois, Chapter 9.1.  Diversity-Multiplexing Tradeoff
   5. "Synchronization strings: codes for insertions and deletions approaching the Singleton bound", Haeupler and Shahrasbi, Annual ACM SIGACT Symposium on Theory of Computing, 2017. link
   6. "Spatio-temporal coding for wireless communication", Raleigh and Coiffi, IEEE Global Telecommunications Conference, 1996. link
4. Localization
   1. "Advances on localization techniques for wireless sensor networks: A survey", Chowdhurya, Elkin, Devabhaktuni, Rawat, and Oluoch, Computer Networks 110(9), 2016. link
   2. "Euclidean distance matrices: Essential theory, algorithms, and applications", Dokmanic, Parhizkar, Ranieri, and Vetterli, IEEE Signal Processing Magazine 32(6), 2015. link
   3. "Distributed Maximum Likelihood Sensor Network Localization", Simonetto and Leus, IEEE Transactions on Signal Processing, 62(6), 2014. link

Follow the links to download the papers. Download is only possible from within the University Network or via the University VPN. You may have to restart your browser so that the publisher websites take your new IP address into account.

Deliverables

For a successful participation you have to 

1. Give a 10 minute kickoff presentation (1/6)
2. Write a written (max) 5 page report (LaTeX) and upload it using ILIAS (1/6)
3. Give a 30 minute final presentation during the block seminar (1/2)
4. Survive the 15 minute discussion after your presentation (1/6)

Presentations may be recorded. 

Attendance to all kick-off and final presentation is mandatory.

Organisation

Registration online with the University system before and after the presentation of topics. Please register also on the ILIAS-page (to be created).