• 24.04.2025, 10am-12pm, room 101-01-016/018 First meeting: presentation of the topics, organization

Dates

• 1st meeting, 24.04.2024, 10-12  (room 101-01-016/18), presentation of the topics, organization
• 24.04.2025 - 28.04.2025:  submit 3 topics of your choice to the forum of ILIAS
• 14.07.2025: Deadline for report
• 28.07.2025: 9-17, block seminar day 1 (051-00-006)

• 29.07.2025: 9-17, block seminar day 2 (051-00-006)

• 30.07.2025: 9-17: block seminar day 3 (tbd)

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. and Dokmanić, I., 2020. Hyperbolic distance matrices. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (pp. 1728-1738). (CS)

   2. 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)

   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. Le, T. K., & Ho, K. C. (2020). Joint source and sensor localization by angles of arrival. IEEE Transactions on Signal Processing, 68, 6521-6534. (JB) 

   6. Weiss, A., Arikan, T., Vishnu, H., Deane, G. B., Singer, A. C., & Wornell, G. W. (2022). A semi-blind method for localization of underwater acoustic sources. IEEE Transactions on Signal Processing, 70, 3090-3106. (JB)

   7. 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)

   8. Del Corte-Valiente, A., Gómez-Pulido, J.M., Gutiérrez-Blanco, O. and Castillo-Sequera, J.L., 2019. Localization approach based on ray-tracing simulations and fingerprinting techniques for indoor–outdoor scenarios. Energies, 12(15), p.2943. (SM)

   9. Clayirci, E. and Akyildiz, I.F., 2002. User mobility pattern scheme for location update and paging in wireless systems. IEEE Transactions on Mobile Computing, 1(3), pp.236-247.

2. Cryptography

   1. Shafi Goldwasser, Yael Tauman Kalai, and Guy N. Rothblum. Delegating computation: in-
      teractive proofs for muggles. In Proceedings of the 40th Annual ACM Symposium on Theory
      of Computing, STOC ’08, pages 113–122, New York, NY, USA, 2008. ACM. (CS)

   2. Jens Groth. On the size of pairing-based non-interactive arguments. In Annual interna-
      tional conference on the theory and applications of cryptographic techniques, pages 305–326.
      Springer, 2016 (CS)

   3. Golle, P. Dealing Cards in Poker Games. In Proceedings of the International Conference on Information Technology: Coding and Computing, (2005) (CS)

   4. Jonathan Lee. Dory: Efficient, transparent arguments for generalised inner products and
      polynomial commitments. In Theory of Cryptography Conference, pages 1–34. Springer,
      2021. (CS)

   5. Kang, Y., Zhang, L., Ye, H., Liu, B., Pu, S., Zhang, D. and Zhuang, S., 2023. Visual cryptography based on ghost imaging and Hadamard transform. Quantum Information Processing, 22(2), p.116.
   6. Attema, T. and Cramer, R., 2020, August. Compressed-Sigma-protocol theory and practical application to plug & play secure algorithmics. In Annual International Cryptology Conference (pp. 513-543). Cham: Springer International Publishing.
   7. Dodis, Y., Halevi, S. and Rabin, T., 2000. A cryptographic solution to a game theoretic problem. In Advances in Cryptology—CRYPTO 2000: 20th Annual International Cryptology Conference Santa Barbara, California, USA, August 20–24, 2000 Proceedings 20 (pp. 112-130). Springer Berlin Heidelberg.
   8. 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
   9. 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.
   10. 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. 
   11. Koch, A., Schrempp, M. and Kirsten, M., 2021. Card-based cryptography meets formal verification. New Generation Computing, 39(1), pp.115-158.
   12. Stamer, Heiko (2005): Efficient electronic gambling: an extended implementation of the toolbox for mental card games. WEWoRC 2005 – Western European Workshop on Research in Cryptology. Bonn: Gesellschaft für Informatik e.V.. PISSN: 1617-5468. ISBN: 3-88579-403-9. pp. 1-12. Regular Research Papers. Leuven, Belgium. 5.-7. July 2005
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. Lau, L. C., Tung, K. C., Wang, R.: Cheeger Inequalities for Directed Graphs and Hypergraphs using Reweighted Eigenvalues. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing (STOC 2023), pp. 1834–1847. Association for Computing Machinery, New York, NY, USA (2023). https://doi.org/10.1145/3564246.3585139 (SN)

   2. Dinitz, Y., Dolev, S. & Kumar, M. Local Deal-Agreement Algorithms for Load Balancing in Dynamic General Graphs. Theory Comput Syst 67, 348–382 (2023). https://doi.org/10.1007/s00224-022-10097-6 (SN)

   3. P. Kaswan, P. Mitra, A. Srivastava and S. Ulukus, "Age of Information in Gossip Networks: A Friendly Introduction and Literature Survey Invited Paper," in IEEE Transactions on Communications, doi: 10.1109/TCOMM.2024.3522043. (SN)

   4. Jacek Cichoń, Dawid Dworzański, and Karol Gotfryd. On Reliability of the Extrema Propagation Technique in Random Environment. In 28th International Conference on Principles of Distributed Systems (OPODIS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 324, pp. 29:1-29:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) (SN)

   5. Lamport, L., Shostak, R. and Pease, M., 2019. The Byzantine generals problem. In Concurrency: the works of leslie lamport (pp. 203-226). (CS)
5. Internet & Misc
1. Kol, M., Klein, A. and Gilad, Y., 2023. Device Tracking via {Linux’s} New {TCP} Source Port Selection Algorithm. In 32nd USENIX Security Symposium (USENIX Security 23) (pp. 6167-6183).
2. Bocovich, C., Breault, A., Fifield, D., Serene, & Wang, X. (2024). Snowflake, a censorship circumvention system using temporary WebRTC proxies. 33rd USENIX Security Symposium (USENIX Security 24), 2635–2652.
3. 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).

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 Assinged Topics

Deliverables

For a successful participation you have to 

1. Write a written 2-4 pages report (LaTeX) and upload it using ILIAS¹ until 14.07.2025 (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 and published on ILIAS¹.  Active attendance to 12 presentations (including your own) is mandatory.