Christian Schindelhauer & Sneha Mohanty

News

• 20.04.2023 4pm-6pm – 1st Meeting in room 052-02-017.

Dates

• 20.04.2023 4pm-6pm – 1st Meeting in room 052-02-017.
• 24.04.2023 – submit 3 topics of your choice to ILIAS forum (no meeting)
• 08.05.2023 – Topic assignment (see results here – no meeting)
• 24.07.2023 9am-4pm (051-00-031) – Block seminar day 1
• 25.07.2023 9am-4pm (051-00-031)  – Block seminar day 2

Contents

We discuss up-to-date topics of distributed algorithms, cryptography, localization and wireless communication. Topics appear here soon. 

1. Localization
   1. Kreković, Miranda, Ivan Dokmanić, and Martin Vetterli. "Shapes from echoes: uniqueness from point-to-plane distance matrices." IEEE Transactions on Signal Processing 68 (2020): 2480-2498. (JB)
   2. Shlomo, Tom, and Boaz Rafaely. "Blind localization of early room reflections using phase aligned spatial correlation." IEEE transactions on Signal Processing 69 (2021): 1213-1225. (JB)
   3. El Badawy, Dalia, Viktor Larsson, Marc Pollefeys, and Ivan Dokmanić. "Localizing Unsynchronized Sensors with Unknown Sources." IEEE Transactions on Signal Processing 71 (2023): 641-654. (JB)
   4. P. Tabaghi, I. Dokmanić and M. Vetterli, "Kinetic Euclidean Distance Matrices," in IEEE Transactions on Signal Processing, vol. 68, pp. 452-465, 2020, doi: 10.1109/TSP.2019.2959260. (WX)
   5. A. Beck, P. Stoica and J. Li, "Exact and Approximate Solutions of Source Localization Problems," in IEEE Transactions on Signal Processing, vol. 56, no. 5, pp. 1770-1778, May 2008, doi: 10.1109/TSP.2007.909342. (WX)
   6. G. Li, L. Zhang, F. Lin, M. Chen and Z. Wang, "SAILoc: A novel acoustic single array system for indoor localization," 2017 9th International Conference on Wireless Communications and Signal Processing (WCSP), Nanjing, China, 2017, pp. 1-6, doi: 10.1109/WCSP.2017.8171099.(AG)
   7. M. Scherhäufl, R. Pfeil, M. Pichler and A. Berger, "A novel ultrasonic indoor localization system with simultaneous estimation of position and velocity," 2012 IEEE Topical Conference on Wireless Sensors and Sensor Networks, Santa Clara, CA, USA, 2012, pp. 21-24, doi: 10.1109/WiSNet.2012.6172145. (AG)
   8. C. Xu, Y. Li, C. Ji, Y. Huang, H. Wang and Y. Xia, "An improved CFAR algorithm for target detection," 2017 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS), Xiamen, China, 2017, pp. 883-888, doi: 10.1109/ISPACS.2017.8266600. (AG)
2. Cryptography
   1. Adida, B., 2008, July. Helios: Web-based Open-Audit Voting. In USENIX security symposium (Vol. 17, pp. 335-348).(CS)
   2. Bernhard, D., Pereira, O., Warinschi, B. (2012). How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios. In: Wang, X., Sako, K. (eds) Advances in Cryptology – ASIACRYPT 2012. ASIACRYPT 2012. Lecture Notes in Computer Science, vol 7658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34961-4_38 (CS)
   3. Groth, J., 2010, December. Short Pairing-Based Non-interactive Zero-Knowledge Arguments. In Asiacrypt (Vol. 6477, pp. 321-340). (CS)
   4. 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. (CS)
   5. Barnett, A. and Smart, N.P., 2003. Mental poker revisited. In Cryptography and Coding: 9th IMA International Conference, Cirencester, UK, December 16-18, 2003. Proceedings 9 (pp. 370-383). Springer Berlin Heidelberg. (CS)
3. Visual Complexity and Cryptography
   1. Tokarsky, George W. “Polygonal Rooms Not Illuminable from Every Point.” The American Mathematical Monthly 102, no. 10 (1995): 867–79. https://doi.org/10.2307/2975263.(SM)
   2. Kim, J., Kim, J., Seo, J., Park, K.W., Moon, S. and An, K., 2022. Observation of a half-illuminated mode in an open Penrose cavity. Scientific Reports, 12(1), p.9798. (SM)
   3. Halpern B. Strange billiard tables. Transactions of the American mathematical society. 1977;232:297-305. (CS)
   4. Hubacher, A., 1987. Instability of the boundary in the billiard ball problem. Communications in mathematical physics, 108, pp.483-488. (CS)
   5. Berglund, N., Kunz, H. Integrability and ergodicity of classical billiards in a magnetic field. J Stat Phys 83, 81–126 (1996). https://doi.org/10.1007/BF02183641 (CS)
4. MIMO and Near-Field
   1. Tse, D.N.C., Viswanath, P. and Zheng, L., 2004. Diversity-multiplexing tradeoff in multiple-access channels. IEEE Transactions on Information Theory, 50(9), pp.1859-1874. (CS)
   2. Zhang, R. and Ho, C.K., 2013. MIMO broadcasting for simultaneous wireless information and power transfer. IEEE Transactions on Wireless Communications, 12(5), pp.1989-2001.(CS)
   3. Phang, S., Ivrlač, M.T., Gradoni, G., Creagh, S.C., Tanner, G. and Nossek, J.A., 2018. Near-field MIMO communication links. IEEE Transactions on Circuits and Systems I: Regular Papers, 65(9), pp.3027-3036.(CS)
5. Peer-to-Peer Networks
   1. Pittel, B., 1987. On spreading a rumor. SIAM Journal on Applied Mathematics, 47(1), pp.213-223.(SN)
   2. Frieze, A.M. and Grimmett, G.R., 1985. The shortest-path problem for graphs with random arc-lengths. Discrete Applied Mathematics, 10(1), pp.57-77. (SN)
   3. Kempe, D., Dobra, A. and Gehrke, J., 2003, October. Gossip-based computation of aggregate information. In 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. (pp. 482-491). IEEE. (SN)
   4. Doerr, B. and Künnemann, M., 2014, January. Tight analysis of randomized rumor spreading in complete graphs. In 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (pp. 82-91). Society for Industrial and Applied Mathematics. (SN)
   5. Chierichetti, F., Giakkoupis, G., Lattanzi, S. and Panconesi, A., 2018. Rumor spreading and conductance. Journal of the ACM (JACM), 65(4), pp.1-21.
6. Internet of Things
   1. Chang, J.Y., 2015. A distributed cluster computing energy-efficient routing scheme for internet of things systems. Wireless personal communications, 82, pp.757-776.

Supervisors

• AG: Andrea Gabbrielli (gabbrielli at telocate dot de)
• CS: Christian Schindelhauer (schindel at tf dot uni dash freiburg dot de)
• JB: Joan Bordoy (bordoy at informatik dot uni dash freiburg dot de)
• SM: Sneha Mohanty (mohanty at informatik dot uni dash freiburg dot de)
• SN: Saptadi Nugroho (saptadinugroho at gmail dot com)
• WX: Wenxin Xiong (xiongw at informatik dot uni dash freiburg dot de)

Deliverables

For a successful participation you have to 

1. Write a written (max) 3-5 pages report (LaTeX) and upload it using ILIAS until 10.07.2023 (1/4)
2. Give a 30 minute final presentation during the block seminar (upload slides to ILIAS) (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

The following schedule is a draft version. In case you want to change (or quit). Let us know!