ArcticCrypt 2025

The registration covers bus transfer to/from the airport, reception Sunday evening, coffee breaks and lunches on Monday, Tuesday and Thursday, Full day excursion (wildlife and glacier cruise) including light lunch on Wednesday with the boat MS Bard, and conference dinner on Thursday evening at Huset.

There are two options for registration:

1. If you want to stay at the conference hotel, the price for the hotel from Sunday July 6th to Friday July 11th will be included in the registration fee. The price for this option is 24 975 NOK (single room) and 25 975 NOK (double room). Link and information for registering is found in the Venue and accommodation section above.
2. If you do not want to stay at the conference hotel, you take care of your own booking for accommodation. In this case the conference fee is 8700 NOK (regular) and 6700 NOK (student). Visit this link: https://event.checkin.no/77144/arcticcrypt-2025.

If you will have an accompanying person who will not attend the conference, there is an option for them to join the bus transfer to/from airport, the reception Sunday and the dinner Thursday evening. This option costs 2000 NOK. If they also want to attend the boat trip Wednesday, the cost is 3500 NOK per person.

The only way to travel to Longyearbyen is by plane from either Oslo or Tromsø in Norway. There are only a few flights per day to and from Longyearbyen each day, hence it is essential to book your flight early. The airport code for Longyearbyen is LYR, and the airlines serving the airport are SAS or Norwegian. The airport is just a few kilometres from the settlement and there are shuttle buses serving all arriving and departing flights.

Svalbard is not part of the Schengen area, so everyone travelling to Svalbard must bring their passport. There are no visa requirements when travelling to Svalbard, but note that the only way to get to Svalbard is via Norway. Please check if you need a visa to enter Norway.

ArcticCrypt 2025 welcomes submissions on any topic in cryptology at https://arcticcrypt2025.hotcrp.com/. This covers all research topics in cryptography and cryptanalysis, including but not limited to

• foundational theory and mathematics
• the design, proposal, and analysis of cryptographic primitives and protocols
• secure implementation and optimization in hardware or software
• real-world aspects of cryptography and its general application

ArcticCrypt 2025 will not have official proceedings. Instead, we aim to provide an opportunity to present recent journal papers, and works that will be submitted in the future. Note that this unfortunately excludes papers that have already been published at conferences with proceedings.

There are two options for submitting papers to ArcticCrypt. The first option is through a collaboration with IACR’s new journal Communications in Cryptology (CiC) in a novel publication model. The idea is that papers accepted for publication in CiC may also be considered for presentation at ArcticCrypt.

With this option, authors are encouraged to submit their work to CiC’s issues 2 or 3 in 2024 as a regular paper, and indicate that they want the paper to be considered for ArcticCrypt 2025 by checking the appropriate box in the submission procedure.

If accepted for publication in CiC’s issue 2 or 3, the final version of these papers will automatically be forwarded to the ArcticCrypt program committee. To help in the reviewing process, the program chairs of ArcticCrypt will ask the authors of forwarded papers if they may share the reviews they received from the CiC editorial board with the ArcticCrypt program committee.

Note that ArcticCrypt will run a separate reviewing process for its submissions. Papers accepted at CiC may therefore end up not being accepted at ArcticCrypt due to the limited number of slots available at the conference.

The other option is to submit the paper directly to ArcticCrypt by September 13th 2024. Authors of a direct submission to ArcticCrypt are not subject to any restrictions with regards to future submission of their work. In particular, we encourage authors to also submit their work to a conference with formal proceedings or a journal (such as a later issue of CiC). Submissions sent directly to ArcticCrypt must adhere to the same instructions for authors as given for a CiC regular submission.

Note that at least one of the authors of a paper accepted for presentation at ArcticCrypt must be available to travel to Longyearbyen and present at the conference, regardless of whether the paper is forwarded from CiC or submitted directly to ArcticCrypt.

A Comprehensive Survey on Post-Quantum TLS
Authors: Jan Oupický (University of Luxembourg), Nouri Alnahawi (Darmstadt University of Applied Sciences), Johannes Müller (CNRS/INRIA Nancy), Alexander Wiesmaier (Darmstadt University of Applied Sciences)

An Improved Algorithm for Code Equivalence
Author: Julian Nowakowski (Ruhr University Bochum)

Analysis of Layered ROLLO-I: A BII-LRPC code-based KEM
Authors: Seongtaek Chee (The Affiliated Institute of ETRI), Kyung Chul Jeong (The Affiliated Institute of ETRI), Tanja Lange (Eindhoven University of Technology and Academia Sinica), Nari Lee (The Affiliated Institute of ETRI), Alex Pellegrini (Eindhoven University of Technology), Hansol Ryu (The Affiliated Institute of ETRI)

Attacking trapdoors from matrix products
Authors: Valerie Gilchrist (Université Libre de Bruxelles), Thomas Decru (Université Libre de Bruxelles), Tako Boris Fouotsa (EPFL), Paul Frixons (Université Libre de Bruxelles), Christophe Petit (Université Libre de Bruxelles)

Black-box Collision Attacks on the NeuralHash Perceptual Hash Function
Authors: Diane Leblanc-Albarel (KU Leuven), Bart Preneel (KU Leuven)

Communication-Efficient Multi-Party Computation for RMS Programs
Authors: Pedro Capitão (CWI; Leiden University), Aron van Baarsen (Aarhus University; Leiden University), Vincent Dunning (TNO), Thomas Attema (TNO; CWI), Lisa Kohl (CWI Amsterdam), Stefan van den Berg (TNO)

Compact Proofs of Partial Knowledge for Overlapping CNF Formulae
Authors: Gennaro Avitabile (IMDEA Software Institute), Vincenzo Botta (Sapienza University of Rome), Daniele Friolo (Sapienza University of Rome), Daniele Venturi (Sapienza University of Rome), Ivan Visconti (Sapienza University of Rome)

Computing Orientations from the Endomorphism Ring of Supersingular Curves and Applications
Authors: Jonathan Komada Eriksen (Norwegian University of Science and Technology), Antonin Leroux (DGA-MI and Université de Rennes)

Discrete gaussian sampling for BKZ-reduced basis
Authors: Amaury Pouly (CNRS), Yixin Shen (INRIA)

Efficient Algorithm for Generating Optimal Inequality Candidates for MILP Modeling of Boolean Functions
Authors: Alexander Bille (University of Marburg), Elmar Tischhauser (University of Marburg)

Efficient Boolean-to-Arithmetic Mask Conversion in Hardware
Authors: Aein Shahmirzadi (PQShield), Michael Hutter (PQShield)

Efficient Maliciously Secure Oblivious Exponentiations
Authors: Carsten Baum (DTU), Jens Berlips (SecureDNA Foundation), Walther Chen (SecureDNA Foundation), Ivan Damgård (Aarhus University), Kevin M. Esvelt (MIT), Leonard Foner (SecureDNA Foundation), Dana Gretton (MIT), Martin Kysel (SecureDNA Foundation), Ronald L. Rivest (MIT), Lawrence Roy (Aarhus University), Francesca Sage-Ling (SecureDNA Foundation), Adi Shamir (Weizmann Institute of Science), Vinod Vaikuntanathan (MIT), Lynn Van Hauwe (SecureDNA Foundation), Theia Vogel (SecureDNA Foundation), Benjamin Weinstein-Raun (SecureDNA Foundation), Daniel Wichs (Northeastern University), Stephen Wooster (SecureDNA Foundation), Andrew C. Yao (Tsinghua University), Yu Yu (Shanghai Jiao Tong University)

Finding Practical Parameters for Isogeny-based Cryptography
Authors: Maria Corte-Real Santos (University College London), Jonathan Komada Eriksen (Norwegian University of Science and Technology), Michael Meyer (University of Regensburg), Francisco Rodríguez-Henríquez (Cryptography Research Center, Technology Innovation Institute)

Highly-Efficient Fully Secure MPC in the Two-Thirds Honest Majority Setting
Authors: Matan Hamilis (Reichman University), Ariel Nof (Bar-Ilan University)

How (not) to hash into class groups of imaginary quadratic fields?
Authors: István András Seres (Eötvös Loránd University), Péter Burcsi (Eötvös Loránd University), Péter Kutas (Eötvös Loránd University)

Lattice-based Multi-Authority/Client Attribute-based Encryption for Circuits
Authors: Valerio Cini (NTT Research), Russell W. F. Lai (Aalto University), Ivy K. Y. Woo (Aalto University)

Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency
Authors: Giacomo Fenzi (EPFL), Hossein Moghaddas (NP Labs), Ngoc Khanh Nguyen (King’s College London)

More Efficient Isogeny Proofs of Knowledge via Canonical Modular Polynomials
Authors: Thomas den Hollander (Universität der Bundeswehr München), Sören Kleine (Universität der Bundeswehr München), Marzio Mula (Universität der Bundeswehr München), Daniel Slamanig (Universität der Bundeswehr München), Sebastian A. Spindler (Universität der Bundeswehr München)

Non-Interactive Distributed Point Functions
Authors: Elette Boyle (NTT), Lalita Devadas (MIT), Sacha Servan-Schreiber (MIT)

Registered Matchmaking Encryption
Authors: Danilo Francati (Royal Holloway, University of London), Valeria Huang (Sapienza University of Rome), Daniele Venturi (Sapienza University of Rome)

Reinventing BrED: A Practical Construction Formal Treatment of Broadcast Encryption with Dealership
Authors: Avishek Majumder (UPES, Dehradun), Sayantan Mukherjee (IIT Jammu)

Revisiting the Slot-to-Coefficient Transformation for BGV and BFV
Author: Robin Geelen (COSIC, KU Leuven)

Ring Verifiable Random Functions
Authors: Jeffrey Burdges (Web3 Foundation), Oana Ciobotaru (OpenZeppelin), Elizabeth Crites (Web3 Foundation), Handan Kılınç Alper (Nil Foundation), Alistair Stewart (Web3 Foundation), Sergey Vasilyev (Web3 Foundation)

Robust Combiners for Non-Interactive Zero-Knowledge Proofs
Authors: Michele Ciampi (The University of Edinburgh), Lorenzo Magliocco (Sapienza University of Rome), Daniele Venturi (Sapienza University of Rome), Yu Xia (The University of Edinburgh)

Secure Offline Payments with Blockchain Access
Authors: Mihai Christodorescu (Google), Sourav Das (UIUC), Ranjit Kumaresan (Visa Research), Mohsen Minaei (Visa Research), Mustafa Ozdayi (Qualtrics), Srinivasan Raghuraman (Visa Research and MIT), Muhammad Saad (X), Mahdi Zamani (Visa Research)

Simple Two-Message OT in the Explicit Isogeny Model
Authors: Riccardo Zanotto (CISPA), Emmanuela Orsini (Università Bocconi)

Simple Watermarking Pseudorandom Functions from Extractable Pseudorandom Generators
Authors: Estuardo Alpirez Bock (Independent), Chris Brzuska (Aalto University), Russell W. F. Lai (Aalto University)

Solving Multivariate Coppersmith Problems with Known Moduli
Author: Keegan Ryan (University of California, San Diego)

Sonikku: Gotta Speed, Keed! A Family of Fast and Secure MACs
Authors: Amit Singh Bhati (COSIC, KU Leuven), Elena Andreeva (TU Wien), Simon Müller (TU Wien), Damian Vizár (Swiss Center for Electronics and Microtechnology (CSEM))

Towards Optimal Parallel Broadcast under a Dishonest Majority
Authors: Daniel Collins (Purdue University and Georgia Tech), Sisi Duan (Tsinghua University), Julian Loss (CISPA Helmholtz Center for Information Security), Charalampos Papamanthou (Yale University), Giorgos Tsimos (University of Maryland, College Park), Haochen Wang (Tsinghua University)

Unforgeability of Blind Schnorr in the Limited Concurrency Setting
Authors: Franklin Harding (Brown University), Jiayu Xu (Oregon State University)

There will be invited talks by Allison Bishop and Kenny Paterson. 

 

Sunday 6 July

Arrival and check-in

19:00 Reception

Monday 7 July

09:00 – 16:30 Sessions with contributed talks

Tuesday 8 July

09:00 – 16:30 Sessions with contributed talks

Wednesday 9 July

08:30 – 15:30 Excursion day: boat trip including lunch

Thursday 10 July

09:00 – 16:30 Sessions with contributed talks

19:00 Conference dinner

Friday 11 July

Check-out