<?xml version="1.0" encoding="utf-8"?><feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en"><generator uri="https://jekyllrb.com/" version="4.4.1">Jekyll</generator><link href="https://jnsiemer.de/feed.xml" rel="self" type="application/atom+xml"/><link href="https://jnsiemer.de/" rel="alternate" type="text/html" hreflang="en"/><updated>2026-04-21T01:54:35+02:00</updated><id>https://jnsiemer.de/feed.xml</id><title type="html">Jan Niklas Siemer | News</title><subtitle>PhD Student at King&apos;s College London specialising in lattice-based cryptography. </subtitle><entry><title type="html">Laz Goes Live</title><link href="https://jnsiemer.de/news/26-04-03-laz-goes-live/" rel="alternate" type="text/html" title="Laz Goes Live"/><published>2026-04-03T00:00:00+02:00</published><updated>2026-04-03T00:00:00+02:00</updated><id>https://jnsiemer.de/news/laz-goes-live</id><content type="html" xml:base="https://jnsiemer.de/news/26-04-03-laz-goes-live/"><![CDATA[<p>The <a href="https://latticeassumptionzoo.org/">Lattice Assumption Zoo</a> just launched! While the list of catalogued is assumptions is not exhaustive yet, the concept and architecture are stable. This project yields the first community-driven approach to systematically catalogue the landscape of lattice-based assumptions, which has seen rapid growth in the past five years.</p>]]></content><author><name></name></author><summary type="html"><![CDATA[The Lattice Assumption Zoo just launched! While the list of catalogued is assumptions is not exhaustive yet, the concept and architecture are stable. This project yields the first community-driven approach to systematically catalogue the landscape of lattice-based assumptions, which has seen rapid growth in the past five years.]]></summary></entry><entry><title type="html">Scalable Rbe At Sp</title><link href="https://jnsiemer.de/news/26-03-10-scalable-rbe-at-sp/" rel="alternate" type="text/html" title="Scalable Rbe At Sp"/><published>2026-03-10T00:00:00+01:00</published><updated>2026-03-10T00:00:00+01:00</updated><id>https://jnsiemer.de/news/scalable-rbe-at-sp</id><content type="html" xml:base="https://jnsiemer.de/news/26-03-10-scalable-rbe-at-sp/"><![CDATA[<p>Our paper <a href="https://eprint.iacr.org/2026/717">Scalable Registration-Based Encryption from Lattices</a> will be published at <a href="https://sp2026.ieee-security.org/">S&amp;P’26</a>. We present the first concrete post-quantum instantiation of RBE supporting arbitrary identity spaces and a large number of users with a ciphertext size of 7.0 MB, improving on prior work by three orders of magnitude. More context can be found <a href="http://127.0.0.1:8080/projects/practical_rbe/">here</a>.</p>]]></content><author><name></name></author><summary type="html"><![CDATA[Our paper Scalable Registration-Based Encryption from Lattices will be published at S&amp;P’26. We present the first concrete post-quantum instantiation of RBE supporting arbitrary identity spaces and a large number of users with a ciphertext size of 7.0 MB, improving on prior work by three orders of magnitude. More context can be found here.]]></summary></entry><entry><title type="html">Sis With Hints At Pkc</title><link href="https://jnsiemer.de/news/26-02-14-sis-with-hints-at-pkc/" rel="alternate" type="text/html" title="Sis With Hints At Pkc"/><published>2026-02-14T00:00:00+01:00</published><updated>2026-02-14T00:00:00+01:00</updated><id>https://jnsiemer.de/news/sis-with-hints-at-pkc</id><content type="html" xml:base="https://jnsiemer.de/news/26-02-14-sis-with-hints-at-pkc/"><![CDATA[<p>Our paper on <a href="https://eprint.iacr.org/2026/291">Tight Reductions for SIS-with-Hints Assumptions</a> was accepted at <a href="https://pkc.iacr.org/2026/">PKC’26</a> and provides new reductions between ISIS$_f$, GenISIS$_f$, and their interactive versions, SIS and a GenISIS$_f$ instance, and One-More-ISIS and its randomised variant. More context can be found <a href="/projects/relating_assumptions/">here</a>.</p>]]></content><author><name></name></author><summary type="html"><![CDATA[Our paper on Tight Reductions for SIS-with-Hints Assumptions was accepted at PKC’26 and provides new reductions between ISIS$_f$, GenISIS$_f$, and their interactive versions, SIS and a GenISIS$_f$ instance, and One-More-ISIS and its randomised variant. More context can be found here.]]></summary></entry><entry><title type="html">Qfall Goes Live</title><link href="https://jnsiemer.de/news/26-01-21-qfall-goes-live/" rel="alternate" type="text/html" title="Qfall Goes Live"/><published>2026-01-21T00:00:00+01:00</published><updated>2026-01-21T00:00:00+01:00</updated><id>https://jnsiemer.de/news/qfall-goes-live</id><content type="html" xml:base="https://jnsiemer.de/news/26-01-21-qfall-goes-live/"><![CDATA[<p><a href="https://qfall.github.io/">qFALL</a> Goes Live: Our library suite for rapid prototyping of lattice-based cryptography is now available on <a href="https://crates.io/search?q=qfall">crates.io</a>. qFALL pursues a unique path by focussing on usability and low-effort high-level implementations to support researchers during the design phase, enabling an incremental optimisation workflow by replacing bottlenecks with more optimised submodules.</p>]]></content><author><name></name></author><summary type="html"><![CDATA[qFALL Goes Live: Our library suite for rapid prototyping of lattice-based cryptography is now available on crates.io. qFALL pursues a unique path by focussing on usability and low-effort high-level implementations to support researchers during the design phase, enabling an incremental optimisation workflow by replacing bottlenecks with more optimised submodules.]]></summary></entry></feed>