WORKSHOP
Workshop on Post-Quantum Cryptography

Trento, 12-14 October 2022

The second part of the event is a two-day Workshop, from Wednesday 12th afternoon to Friday 14th morning. It is aimed at both students and researchers, presenting and discussing state-of-the-art topics in post-quantum cryptography.

The Workshop includes Invited and Contributed Talks presenting original research, as well as a Poster Session.

PROGRAM

Day 1

Wednesday, October 12th

14:00 - 14:45 Registration

14:45 - 15:00 Welcome

Marco Baldi, Carla Mascia, and Alessio Meneghetti

15:00 - 16:00 Lattice-Based

chair: Marco Baldi

Invited Talk: Lattice-based signatures

Thomas Prest

In this talk, I will present recent and future developments in lattice-based signature schemes. This will include a presentation of Falcon and Dilithium, recently standardized by NIST, as well as future research directions.

slides

16:00 - 16:30 Coffee break

16:30 - 17:30 Isogeny-Based

chair: Federico Pintore

An attack on SIDH with arbitrary starting curve

Luciano Maino and Chloe Martindale

slides

Collisions in Supersingular Isogeny Graphs

Wissam Ghantous, Shuichi Katsumata, Federico Pintore, and Mattia Veroni

slides

A Post-Quantum Oblivious PRF from Isogenies

Andrea Basso

slides

20:00 Social Dinner

Ristorante Lo Scrigno del Duomo

Piazza del Duomo, 29, 38122 Trento TN

Day 2

Thursday, October 13th

9:30 - 10:30 Isogeny-Based

chair: Marco Calderini

Invited Talk: Past, present and future of isogeny-based digital signatures

Federico Pintore

For more than a decade, the encryption scheme SIDH had been the backbone of isogeny-based cryptography and researchers had been challenged by the problem of designing a digital signature from isogenies having, similarly to SIDH, a competitive efficiency. This picture has suddenly changed since late July 2022 due to the dramatic attack against SIDH by Castryck and Decru.

In this talk, we will provide an overview of the hurdles researchers have faced in constructing isogeny-based digital signatures, and we will briefly discuss how one of the schemes that have been proposed so far could be, despite its downsides, the base for a cryptographic renaissance of isogenies.

slides

10:30 - 11:00 Poster Session

chair: Marco Calderini

A CONCRETE approach to torus fully homomorphic encryption

Maria Ferrara and Antonio Tortora


A Cryptographic Kernel for Post-Quantum Support in Blockchains

Riccardo Longo, Carla Mascia, Giordano Santilli, and Giovanni Tognolini


Logarithmic Linkable Ring Signature from Trilinear Forms

Andrea Gangemi and Giuseppe D'Alconzo


Quantum-Resistant Authentication Methods for Quantum Key Distribution

Paula Alonso-Blanco, Carlos Aguilar-Melchor, David Joseph, James Howe, Marc Manzano, and Nina Bindel

slides

11:00 - 11:30 Coffee break

11:30 - 12:15 Isogeny-Based

chair: Federico Pintore

Isogeny graphs with level structure

Guido Lido and Giulio Codogni

An Overview on Random Sampling of Supersingular Elliptic Curves

Marzio Mula, Nadir Murru, and Federico Pintore

slides

12:15 - 13:00 Multivariate-Based

chair: Elisa Gorla

Multivariate cryptography and the complexity of solving a random polynomial system

Giulia Gaggero and Elisa Gorla

slides

Universal forgery of Sequential Aggregate Signatures based on UOV

Edoardo Signorini

slides

13:00 - 14:30 Lunch

14:30 - 16:00 Code-Based

chair: Joachim Rosenthal

Invited Talk: An overview of NIST last round code-based encryption schemes

Jean-Christophe Deneuville

Earlier this summer, NIST finally announced the first post-quantum cryptographic standards for public-key encryption, digital signature and key exchange. Most of them (3 out of 4) rely on the hardness of lattice problems. Looking to diversify its portfolio, NIST is willing to additionally standardize post-quantum primitives relying on different assumptions at the end of its fourth round. With 3 candidates out of 4 in this last round, code-based cryptography definitely stands as a mature primitive for PQC.

In this talk, I will present each of these 3 candidates (Classic McEliece, BIKE and HQC), highlighting their similarities and fundamental differences. I will also discuss their relative efficiency and provide research directions for potential improvements.

slides

New Time-Memory Trade-Offs for Subset Sum with Applications to Information Set Decoding

Andre Esser and Floyd Zweydinger

slides

16:00 - 16:30 Coffee break

16:30 Social Excursion

Orrido (gorge) of Ponte Alto

Just a short walk (~15 ') away from the workshop's venue there is a deep canyon, carved by the River Fersina over thousands of years. Here, in the 1500s some of the oldest hydraulic works in the world were built, in order to protect the city from floods. Two weirs give rise to magnificent 40 m high waterfalls that flow through red rocks, thus creating spectacular light effects.
The excursion is a guided tour of the canyon accompanied by an expert guide, duration 45 ' (of which ~20' of walking). The path does not feature difficult passages, just many steps and some narrow or elevated passages. Sportive footwear and a rainproof jacket are recommended.

Day 3

Friday, October 14th

9:30 - 11:00 Code-Based

chair: Edoardo Persichetti

Invited Talk: "The next two decades": a survey on side-channel attack resistance for post-quantum cryptosystems

Alessandro Barenghi

The recent choice of the US NIST for a set of cryptographic primitives to be standardized calls for solutions to their secure realization. Side channel attacks are one of the prime threats against the concrete realization of cryptographic schemes either in software or in hardware.

This talk will provide a bird's eye view on the current state of our knowledge on both the new or the recurring targets for side channel attacks in cryptographic primitives, and highlight directions to build efficient countermeasures.

slides

A Post-Quantum Digital Signature from LDPC-QC Codes

Christian Picozzi and Giovanni Tognolini

11:00 - 11:30 Coffee break

11:30 - 12:15 Code-Based

chair: Alessio Meneghetti

Recent Advances in the Code Equivalence Problem and Applications to Cryptography

Paolo Santini

slides

The Hardness of Linear Code Equivalence for Sum-Rank Codes

Giuseppe D'Alconzo

slides

12:15 - 13:00 Lattice-Based

chair: Alessio Meneghetti

Hawk: Module LIP makes Lattice Signatures Fast, Compact and Simple

Léo Ducas, Eamonn W. Postlethwaite, Ludo N. Pulles, and Wessel van Woerden

slides

Finding and Evaluating Parameters for BGV and FV

Beatrice Biasioli and Chiara Marcolla

slides

13:00 - 14:30 Lunch