Christian Schindelhauer & Sneha Mohanty

News

• 15.07.2022 Deadline for Reports
• 26.04.2022 ILIAS online

Dates

• 28.04.2022 2pm-4pm – 1st Meeting in 052-02-017 or Zoom
• 05.05.2022 – submit 3 topics of your choice to ILIAS forum (no meeting)
• 16.05.2022 – Topic assignment (see results here – no meeting)
• 01.08.2022 9am-5pm (101-02-017) – Block seminar day 1, Zoom-Meeting, Meeting-ID: 673 7893 1876, Cone12345
• 02.08.2022 9am-5pm (101-02-017) – Block seminar day 2, Zoom-Meeting, Meeting-ID: 673 7893 1876, Cone12345

Contents

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

1. Visual Cryptography
   1. Blundo, C., Bonis, A.D. and Santis, A.D., 2001. Improved schemes for visual cryptography. Designs, Codes and Cryptography, 24(3), pp.255-278.
   2. Zhou, Z., Arce, G.R. and Di Crescenzo, G., 2006. Halftone visual cryptography. IEEE transactions on image processing, 15(8), pp.2441-2453.
   3. Reif, J.H., Tygar, J.D. and Yoshida, A., 1994. Computability and complexity of ray tracing. Discrete & Computational Geometry, 11(3), pp.265-288.
2. Cryptography
   1. "Interactive Distributed Proofs", Kol, Oshman, Saxena, ACM Symposium on Principles of Distributed Computing, 2018. 
   2. David, B., Dowsley, R. and Larangeira, M., 2019, February. ROYALE: a framework for universally composable card games with financial rewards and penalties enforcement. In International Conference on Financial Cryptography and Data Security (pp. 282-300). Springer, Cham.
   3. Bünz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P. and Maxwell, G., 2018, May. Bulletproofs: Short proofs for confidential transactions and more. In 2018 IEEE Symposium on Security and Privacy (SP) (pp. 315-334). IEEE.
   4. Morais, E., Koens, T., Van Wijk, C. and Koren, A., 2019. A survey on zero knowledge range proofs and applications. SN Applied Sciences, 1(8), pp.1-17.
3. Coding Theory
   1. Khabbazian, M., Kuhn, F., Lynch, N., Médard, M. and ParandehGheibi, A., 2011, June. MAC design for analog network coding. In Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing (pp. 42-51).
   2. Silveira, L.M.F., Oliveira, R.M., Ribeiro, M.V., Vieira, L.F., Vieira, M.A. and Vieira, A.B., 2016, November. CodePLC: A network coding MAC protocol for power line communication. In 2016 IEEE 41st conference on local computer networks (LCN) (pp. 643-646). IEEE.
   3. Arikan, E., 2009. Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Transactions on information Theory, 55(7), pp.3051-3073.
   4. Tal, I. and Vardy, A., 2015. List decoding of polar codes. IEEE Transactions on Information Theory, 61(5), pp.2213-2226.
   5. Sengupta, S., Rayanchu, S. and Banerjee, S., 2010. Network coding-aware routing in wireless networks. IEEE/ACM Transactions on networking, 18(4), pp.1158-1170.
4. MIMO
   1. Kailath, T., Vikalo, H. and Hassibi, B., 2005. MIMO receive algorithms. Space-Time Wireless Systems: From Array Processing to MIMO Communications, 3, p.2.
   2. Fasolo, E., Rossetto, F. and Zorzi, M., 2008, January. Network coding meets MIMO. In 2008 Fourth Workshop on Network Coding, Theory and Applications (pp. 1-6). IEEE.
5. Localization
   1. An, I., Son, M., Manocha, D. and Yoon, S.E., 2018, May. Reflection-aware sound source localization. In 2018 IEEE International Conference on Robotics and Automation (ICRA) (pp. 66-73). IEEE.
   2. Zhu, Y. and Hu, J., 2022. To Hide Anchor’s Position in Range-based Wireless Localization via Secret Sharing. IEEE Wireless Communications Letters.
   3. Ribeiro, F., Ba, D., Zhang, C. and Florêncio, D., 2010, July. Turning enemies into friends: Using reflections to improve sound source localization. In 2010 IEEE International Conference on Multimedia and Expo (pp. 731-736). IEEE.
   4. Ishi, C.T., Even, J. and Hagita, N., 2013, November. Using multiple microphone arrays and reflections for 3D localization of sound sources. In 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems (pp. 3937-3942). Ieee.
   5. "Euclidean distance matrices: Essential theory, algorithms, and applications", Dokmanic, Parhizkar, Ranieri, and Vetterli, IEEE Signal Processing Magazine 32(6), 2015. 
   6. "Distributed Maximum Likelihood Sensor Network Localization", Simonetto and Leus, IEEE Transactions on Signal Processing, 62(6), 2014.
6. Distributed Algorithms
   1. Petra Berenbrink, George Giakkoupis, and Peter Kling. 2020. Optimal time and space leader election in population protocols. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC 2020). Association for Computing Machinery, New York, NY, USA, 119–129. DOI, PDF 
   2. S. Datta, C. Giannella and H. Kargupta, "Approximate Distributed K-Means Clustering over a Peer-to-Peer Network," in IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 10, pp. 1372-1388, Oct. 2009 IEEE Explore
7. Student's choice
   1. Ohm, P., 2009. Broken promises of privacy: Responding to the surprising failure of anonymization. UCLA l. Rev., 57, p.1701.

Sessions

• 28.04.2022 2pm-4pm – 1st Meeting in 052-02-017
• 01.08.2022 9am-5pm (101-02-017) – Block seminar day 1
• 02.08.2022 9am-5pm (101-02-017) – Block seminar day 2

Deliverables

For a successful participation you have to 

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

Presentations may be recorded. 

Attendance to all final presentations 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).