News

Dates

• 1st meeting, 15.10.2025, 4pm-6pm, room 101-01-009/13, presentation of the topics, organization
• 15.10.2025 - 20.10.2025: submit 3 topics of your choice to the forum of ILIAS
• 06.11.2025-16.11.2025: Participate in the survey on ILIAS regarding group presentaion
• 06.11.2025-22.12.2025: Contact Christian Schindelhauer, if you want to form a group of two, of if you want to change your topic
• 23.01.2026: Deadline for report
• 09.02.2026: 9am-5pm, block seminar day 1 (051-00-006)
• 10.02.2026: 9am-5pm, block seminar day 2 (051-00-006)

Contents

We discuss up-to-date topics of distributed algorithms, cryptography, localization and wireless communication. More topics appear here soon (see also ILIAS for the papers).

1. Localization
   1. Tabaghi, P., Dokmanić, I. and Vetterli, M., 2019. Kinetic Euclidean distance matrices. IEEE Transactions on Signal Processing, 68, pp.452-465.(JB)
   2. Sahu, N., Wu, L., Babu, P., MR, B.S. and Ottersten, B., 2022. Optimal sensor placement for source localization: A unified ADMM approach. IEEE Transactions on Vehicular Technology, 71(4), pp.4359-4372. (JB)
   3. Y. Zhang and K. C. Ho, “Localization by signals of opportunity in the absence of transmitter position,” IEEE Trans. Signal Process., vol. 70, pp. 4602–4617, 2022. (WX)
   4. K. Panwar and P. Babu, “Multistatic target localization in the absence of transmitter position using differential time delay measurements,” IEEE Trans. Radar Syst., vol. 2, pp. 41–46, 2024. (WX)
   5. Sturm, C., Sorgel, W., Kayser, T. and Wiesbeck, W., 2006, June. Deterministic UWB wave propagation modeling for localization applications based on 3D ray tracing. In 2006 IEEE MTT-S International Microwave Symposium Digest (pp. 2003–2006). IEEE. (SM)
   6. 1. R. Murai, J. Ortiz, S. Saeedi, P. H. J. Kelly and A. J. Davison, "A Robot Web for Distributed Many-Device Localization," in IEEE Transactions on Robotics, vol. 40, pp. 121-138, 2024, doi: 10.1109/TRO.2023.3324127 (SN)
2. Cryptography
   1. Jens Groth. On the size of pairing-based non-interactive arguments. In Annual International Conference on the Theory and Applications of Cryptographic Techniques, pages 305–326. Springer, 2016. (CS)
   2. Jeong, U., Ng, L. H. X., Carley, K. M., & Liu, H. (2025). Navigating decentralized online social networks: An overview of technical and societal challenges in architectural choices. arXiv:2504.00071. (CS)
   3. Ono, H., Manabe, Y. (2019). Card-Based Cryptographic Protocols with the Minimum Number of Cards Using Private Operations. In: Zincir-Heywood, N., Bonfante, G., Debbabi, M., Garcia-Alfaro, J. (eds) Foundations and Practice of Security. FPS 2018. Lecture Notes in Computer Science, vol 11358. Springer, Cham. (CS)
   4. Bella, R., Bultel, X., Chevalier, C., Lafourcade, P., Olivier-Anclin, C. (2024). Practical Construction for Secure Trick-Taking Games Even with Cards Set Aside. In: Baldimtsi, F., Cachin, C. (eds) Financial Cryptography and Data Security. FC 2023. Lecture Notes in Computer Science, vol 13950. Springer, Cham. (CS)
   5. Jakobsson, M., Juels, A. and Rivest, R.L., 2002. Making mix nets robust for electronic voting by randomized partial checking. In 11th USENIX Security Symposium (USENIX Security 02). (CS)
   6. Bennett, C.H. and Brassard, G., 2014. Quantum cryptography: Public key distribution and coin tossing. Theoretical computer science, 560, pp.7-11. (CS)
   7. Damie, M., Hahn, F., Peter, A. and Ramon, J., 2025. How to Securely Shuffle? A survey about Secure Shufflers for privacy-preserving computations. arXiv preprint arXiv:2507.01487. (CS)
3. MIMO and Near-Field
   1. Chuah, C.N., Tse, D.N.C., Kahn, J.M. and Valenzuela, R.A., 2002. Capacity scaling in MIMO wireless systems under correlated fading. IEEE Transactions on Information Theory, 48(3), pp.637–650. (CS)
   2. McKay, M.R., Collings, I.B. and Tulino, A.M., 2009. Achievable sum rate of MIMO MMSE receivers: A general analytic framework. IEEE Transactions on Information Theory, 56(1), pp.396–410. (CS)
4. Peer-to-Peer Networks
   1. Yehuda Afek, Shlomi Dolev, Local Stabilizer, Journal of Parallel and Distributed Computing, Volume 62, Issue 5, 2002, Pages 745-765, ISSN 0743-7315, https://doi.org/10.1006/jpdc.2001.1823. (https://www.sciencedirect.com/science/article/pii/S0743731501918234) (SN)
   2. F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner and G. Monfardini, "The Graph Neural Network Model," in IEEE Transactions on Neural Networks, vol. 20, no. 1, pp. 61-80, Jan. 2009, doi: 10.1109/TNN.2008.2005605 (SN)
   3. P. K. Banerjee, K. Karhadkar, Y. G. Wang, U. Alon and G. Montúfar, "Oversquashing in GNNs through the lens of information contraction and graph expansion," 2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, USA, 2022, pp. 1-8, doi: 10.1109/Allerton49937.2022.9929363 (SN)
   4. Zhao, C., Zhou, Y., Zhang, S., Wang, T., Sheng, Q.Z. and Guo, S., 2024, May. Dethna: Accurate ethereum network topology discovery with marked transactions. In IEEE INFOCOM 2024-IEEE Conference on Computer Communications (pp. 1711-1720). IEEE. (CS)
   5. Yao, R. and Bekhor, S., 2021. A dynamic tree algorithm for peer-to-peer ridesharing matching. Networks and spatial economics, 21(4), pp.801-837. Wang, T., Zhao, C., Yang, Q., Zhang, S. and Liew, S.C., 2021. (CS)
   6. Li, S., Pan, Y., Xu, P. and Zhang, N., 2021. A decentralized peer-to-peer control scheme for heating and cooling trading in distributed energy systems. Journal of cleaner production, 285, p.124817. (CS)
   7. Ford, B., Srisuresh, P. and Kegel, D., 2005, April. Peer-to-peer communication across network address translators. In USENIX Annual Technical Conference, General Track (pp. 179-192). (CS)
5. Computational Complexity
   1. Kawamura, A. and Ziegler, M., 2018. Invitation to Real Complexity Theory: Algorithmic Foundations to Reliable Numerics with Bit-Costs. arXiv preprint arXiv:1801.07108. (CS)
   2. Ilango, R. and Lombardi, A., 2025. Cryptography meets worst-case complexity: Optimal security and more from iO and worst-case assumptions. Cryptology ePrint Archive. (CS)
   3. Chen, L., Rothblum, R.D. and Tell, R., 2025, June. Fiat-shamir in the plain model from derandomization (or: Do efficient algorithms believe that NP= PSPACE?). In Proceedings of the 57th Annual ACM Symposium on Theory of Computing (pp. 977-985). (CS)
6. Internet & Misc
   1. Mohan, N., Ferguson, A.E., Cech, H., Bose, R., Renatin, P.R., Marina, M.K. and Ott, J., 2024, May. A multifaceted look at Starlink performance. In Proceedings of the ACM Web Conference 2024 (pp. 2723–2734). (CS)
   2. Li, Y., Liu, L., Li, H., Liu, W., Chen, Y., Zhao, W., Wu, J., Wu, Q., Liu, J. and Lai, Z., 2024, May. Stable hierarchical routing for operational LEO networks. In Proceedings of the 30th Annual International Conference on Mobile Computing and Networking (pp. 296–311). (CS)
   3. Qian, L. and Caulfield, H.J., 2006. What can we do with a linear optical logic gate?. Information Sciences, 176(22), pp.3379-3392. (SM)
   4. Bast, H. and Brosi, P., 2018, November. Sparse map-matching in public transit networks with turn restrictions. In Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (pp. 480-483).
   5. Culler, D., Karp, R., Patterson, D., Sahay, A., Schauser, K.E., Santos, E., Subramonian, R. and Von Eicken, T., 1993, July. LogP: Towards a realistic model of parallel computation. In Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming (pp. 1-12).
   6. Ford, B., Srisuresh, P. and Kegel, D., 2005, April. Peer-to-peer communication across network address translators. In USENIX Annual Technical Conference, General Track (pp. 179-192).
      Liang, J., Xu, W., Wang, T., Yang, Q. and Zhang, S., 2024, October. Implementing NAT hole punching with QUIC. In 2024 IEEE 100th Vehicular Technology Conference (VTC2024-Fall) (pp. 1-7). IEEE.

Supervisors

• CS: Christian Schindelhauer (schindel at tf dot uni dash freiburg dot de)
• JB: Joan Bordoy (bordoy at informatik dot uni dash freiburg dot de)
• WX: Wenxin Xiong (w.x.xiong at outlook dot com)
• SM: Sneha Mohanty (mohanty at informatik dot uni dash freiburg dot de)
• SN: Saptadi Nugroho (saptadinugroho at gmail dot com)

Schedule and Assigned Topics

This table contains temporary information and is subject to change (status: 02.01.2026)

Deliverables

For a successful participation you have to:

1. Each person has to write a 1–3 page report in LaTeX and upload it to ILIAS by 23.01.2026 (1/4)
2. Give a 30-minute final presentation during the block seminar alone or in a team of two persons (upload slides to ILIAS ) (1/2)
3. Participate in the 15-minute discussion after your presentation (1/4)

Presentations may be recorded and published on ILIAS . Active attendance at 12 presentations (including your own) is mandatory.