https://www.julian-thomas-thomas.de/Recent content on Julian ThomasHugoen© 2025 by Julian Thomas Thomas. <a href='https://www.julian-thomas-thomas.de/imprint'>Imprint</a>.https://www.julian-thomas-thomas.de/about/Mon, 01 Jan 0001 00:00:00 +0000https://www.julian-thomas-thomas.de/about/<p> I am a PhD student at the <a href="https://www.chaac.tf.fau.eu" target="_blank">Chair of Applied Cryptography</a> research group at <a href="https://www.fau.eu" target="_blank">Friedrich-Alexander-Universität Erlangen-Nürnberg</a> in Germany, under the supervision of <a href="https://www.dominique-schroeder.de" target="_blank">Dominique Schröder</a>. </p> <p> I use formal methods to advance cryptographic constructions and protocols, ensuring that rigorous theory translates into practical, efficient, and secure systems. My work involves formalizing cryptographic primitives, constructions, protocols, and definitions, as well as exploring the theoretical relationships between them. My goal is to build upon these theoretical insights to enhance efficiency and strengthen security guarantees in real-world cryptographic applications. </p>https://www.julian-thomas-thomas.de/cv/Mon, 01 Jan 0001 00:00:00 +0000https://www.julian-thomas-thomas.de/cv/<h2>Education</h2> <ul> <li> <strong>Doctoral Student</strong><br> Friedrich-Alexander University Erlangen-Nürnberg<br> Cryptography (03/2023 - present)<br> Supervisor: Dominique Schröder </li> <li> <strong>Master of Science</strong><br> Friedrich-Alexander University Erlangen-Nürnberg<br> Computer Science (10/2020 - 03/2023, with distinction)<br> </li> <li> <strong>Bachelor of Science</strong><br> Friedrich-Alexander University Erlangen-Nürnberg<br> Computer Science (10/2016 - 09/2020)<br> </li> </ul> <h2>Work</h2> <ul> <li> <strong>University Research Assistant</strong><br> Friedrich-Alexander University Erlangen-Nürnberg<br> (03/2023 - present)<br> Applied Cryptography </li> <li> <strong>Student Employee</strong><br> Friedrich-Alexander University Erlangen-Nürnberg<br> (10/2018 - 03/2023)<br> Teaching assistant </li> </ul> <h2>Community Service External Reviews (Selected)</h2> <ul> <li> <strong>Advances in Cryptology (CRYPTO)</strong><br> 2024, 2025, 2026 </li> <li> <strong>ACM Conference on Computer and Communications Security (CCS)</strong><br> 2024, 2025 </li> <li> <strong>Usenix Security Symposium (USENIX)</strong><br> 2026 </li> <li> <strong>Public Key Cryptography (PKC)</strong><br> 2023, 2024 </li> <li> <strong>European Symposium on Research in Computer Security (ESORICS)</strong><br> 2023, 2024, 2025 </li> <li> <strong>IEEE Computer Security Foundations Symposium (CSF)</strong><br> 2023 </li> <li> <strong>ACM Transactions on Privacy and Security</strong><br> 2024 </li> <li> <strong>Conference on Applied Cryptography and Network Security (ACNS)</strong><br> 2023 </li> </ul>https://www.julian-thomas-thomas.de/imprint/Mon, 01 Jan 0001 00:00:00 +0000https://www.julian-thomas-thomas.de/imprint/<p>Angaben gemäß § 5 TMG</p> <p>Julian Thomas Thomas Zaunkönigstraße 15 85051 Ingolstadt</p> <h3 id="vertreten-durch">Vertreten durch:</h3> <p>Julian Thomas Thomas</p> <h3 id="kontakt">Kontakt:</h3> <p>Telefon: E-Mail: julian [dot] thomas [at] fau [dot] de</p> <h2 id="haftungsausschluss">Haftungsausschluss:</h2> <h3 id="haftung-für-inhalte">Haftung für Inhalte</h3> <p>Die Inhalte unserer Seiten wurden mit größter Sorgfalt erstellt. Für die Richtigkeit, Vollständigkeit und Aktualität der Inhalte können wir jedoch keine Gewähr übernehmen. Als Diensteanbieter sind wir gemäß § 7 Abs.1 TMG für eigene Inhalte auf diesen Seiten nach den allgemeinen Gesetzen verantwortlich. Nach §§ 8 bis 10 TMG sind wir als Diensteanbieter jedoch nicht verpflichtet, übermittelte oder gespeicherte fremde Informationen zu überwachen oder nach Umständen zu forschen, die auf eine rechtswidrige Tätigkeit hinweisen. Verpflichtungen zur Entfernung oder Sperrung der Nutzung von Informationen nach den allgemeinen Gesetzen bleiben hiervon unberührt. Eine diesbezügliche Haftung ist jedoch erst ab dem Zeitpunkt der Kenntnis einer konkreten Rechtsverletzung möglich. Bei Bekanntwerden von entsprechenden Rechtsverletzungen werden wir diese Inhalte umgehend entfernen.</p>https://www.julian-thomas-thomas.de/publications/Mon, 01 Jan 0001 00:00:00 +0000https://www.julian-thomas-thomas.de/publications/<h2>Published</h2> <ul> <li> <strong>Symmetric and Asymmetric Anonymous Authenticated KEM</strong> (2026)<br> Benedikt Auerbach, Doreen Riepel, Paul Rösler, Lea Thiemt, and Julian Thomas <br> to appear at Asiacrypt 2026 </li> <li> <strong><a href="https://eprint.iacr.org/2026/746.pdf">Atomic Swaps with Relaxed Assumptions</a></strong> (2026)<br> Paul Roesler, Katharina Schambach, and Julian Thomas <br> CiC </li> <li> <strong><a href="https://eprint.iacr.org/2025/1165.pdf">Automated Analysis and Synthesis of Message Authentication Codes</a></strong> (2025)<br> Stefan Milius, Dominik Paulus, Lutz Schröder, Dominique Schröder, Julian Thomas <br> CSF </li> </ul> <h2>Preprints</h2> <ul> <li> <strong><a href="https://eprint.iacr.org/2025/2167.pdf">1-Adaptive Weak Pseudorandom Functions</a></strong> (2025)<br> Davide Li Calsi, Dominique Schröder, Julian Thomas <br> Preprint </li> </ul>https://www.julian-thomas-thomas.de/spieleecke/Mon, 01 Jan 0001 00:00:00 +0000https://www.julian-thomas-thomas.de/spieleecke/<style> :root { --size: 36px; --gap: 6px; } .wrap { display:flex; flex-direction:column; align-items:center; gap:16px; } .grid { display:grid; grid-template-columns: repeat(8, var(--size)); grid-template-rows: repeat(8, var(--size)); gap: var(--gap); } .cell { width: var(--size); height: var(--size); border-radius:8px; background:#ffffff; cursor:pointer; outline:1px solid #000000; transition: transform .06s ease, background .12s ease, outline-color .12s ease; } .cell.alive { background:#800080; outline-color:#000000; transform: scale(1.03); } .controls { display:flex; gap:10px; justify-content:center; } button { border:0; padding:10px 14px; border-radius:12px; cursor:pointer; font-weight:600; background:#334155; color:#e2e8f0; } button.primary { background:#06b6d4; color:#083344; } button:disabled { opacity:.6; cursor:not-allowed; } .hint { font-size:12px; opacity:.75; text-align:center; } </style> <div class="wrap"> <div class="grid" id="grid"></div> <div class="controls"> <button id="start" class="primary">Start</button> <button id="stop" disabled>Stop</button> </div> </div> <script> (() => { const N = 8; let grid = Array.from({length:N}, () => Array(N).fill(0)); let timer = null; const intervalMs = 250; const gridEl = document.getElementById('grid'); const startBtn = document.getElementById('start'); const stopBtn = document.getElementById('stop'); const cells = []; for (let r=0; r<N; r++) { for (let c=0; c<N; c++) { const div = document.createElement('div'); div.className = 'cell'; div.dataset.r = r; div.dataset.c = c; div.addEventListener('click', () => { grid[r][c] ^= 1; draw(); }); gridEl.appendChild(div); cells.push(div); } } function draw() { for (const el of cells) { const r = +el.dataset.r, c = +el.dataset.c; el.classList.toggle('alive', !!grid[r][c]); } } function neighbors(r, c) { let cnt = 0; for (let dr=-1; dr<=1; dr++) for (let dc=-1; dc<=1; dc++) { if (dr===0 && dc===0) continue; const rr = (r + dr + N) % N; const cc = (c + dc + N) % N; cnt += grid[rr][cc]; } return cnt; } function step() { const next = Array.from({length:N}, () => Array(N).fill(0)); for (let r=0; r<N; r++) for (let c=0; c<N; c++) { const n = neighbors(r,c); next[r][c] = (grid[r][c] ? (n===2 || n===3) : (n===3)) ? 1 : 0; } grid = next; draw(); } startBtn.addEventListener('click', () => { if (timer) return; timer = setInterval(step, intervalMs); startBtn.disabled = true; stopBtn.disabled = false; }); stopBtn.addEventListener('click', () => { clearInterval(timer); timer = null; startBtn.disabled = false; stopBtn.disabled = true; }); grid[4][2]=grid[4][3]=grid[4][4]=grid[3][4]=grid[2][3]=1; draw(); })(); </script>https://www.julian-thomas-thomas.de/talks/Mon, 01 Jan 0001 00:00:00 +0000https://www.julian-thomas-thomas.de/talks/<ul> <li> <strong>Automated Analysis and Synthesis of Message Authentication Codes</strong> (2025)<br> CSF, Santa Cruz, California, USA </li> <li> <strong>Automated Analysis and Synthesis of Message Authentication Codes</strong> (2024)<br> SECURENET, Dublin, Ireland </li> </ul>https://www.julian-thomas-thomas.de/teaching/Mon, 01 Jan 0001 00:00:00 +0000https://www.julian-thomas-thomas.de/teaching/<h2>Teaching Activities</h2> <ul> <li><strong>Introduction to Algorithms and Data Structures (B.Sc.)</strong><br> (Summer term 26): Teaching assistant</li> <li><strong>Cryptography in Secure Messaging</strong><br> (Winter term 25/26): Organiser</li> <li><strong>Introduction to Algorithms and Data Structures (B.Sc.)</strong><br> (Summer term 25): Teaching assistant</li> <li><strong>Crypto Project</strong><br> (Winter term 24/25): Organiser</li> <li><strong>Introduction to Algorithms and Data Structures (B.Sc.)</strong><br> (Summer term 24): Teaching assistant and lecturer</li> <li><strong>Crypto Project</strong><br> (Winter term 23/24): Organiser</li> <li><strong>Introduction to Algorithms and Data Structures (B.Sc.)</strong><br> (Summer term 23): Teaching assistant and lecturer</li> </ul> <h2>Supervised Students</h2> <ul> <li>Katharina Schambach — Bachelor Thesis (2025):<br> <em>Minimal Assumptions for Atomic Swaps</em></li> <li>Malavika Radhakrishnan — Master Thesis (2025):<br> <em>Scamming Scammers with LLMs</em></li> </ul>