Research Papers

Filter by:

WrapQ: Side-Channel Secure Key Management for Post-quantum Cryptography

In this work, we study key handling techniques used in real-life secure Kyber and Dilithium hardware. We describe WrapQ, a masking-friendly key-wrapping mechanism designed for lattice cryptography.

CSI-Otter: Isogeny-Based (Partially) Blind Signatures from the Class Group Action with a Twist

In this paper, we construct the first provably-secure isogeny-based (partially) blind signature scheme.

Finding Short Integer Solutions When the Modulus Is Small

We present cryptanalysis of the inhomogenous short integer solution problem for anomalously small moduli q by exploiting the geometry of BKZ reduced bases of q-ary lattices.

Snowblind: A Threshold Blind Signature in Pairing-Free Groups

Both threshold and blind signatures have, individually, received a considerable amount of attention. However little is known about their combination.

Fully Adaptive Schnorr Threshold Signatures

We prove adaptive security of a simple three-round threshold Schnorr signature scheme, which we call Sparkle+.

Bingo: Adaptivity and Asynchrony in Verifiable Secret Sharing and Distributed Key Generation

We present Bingo, an adaptively secure and optimally resilient packed asynchronous verifiable secret sharing (PAVSS) protocol.

TLS → Post-Quantum TLS: Inspecting the TLS landscape for PQC adoption on Android

We need to better understand the constraints and requirements of TLS usage by Android apps in order to make an informed decision for migration to the post-quantum world.

High-Order Masking of Lattice Signatures in Quasilinear Time

We design a lattice-based signature scheme specifically for side-channel resistance and optimize the masked efficiency as a function of the number of shares.

Signature for Objects: Formalizing How to Authenticate Physical Data and More

This paper proposes a new concept called signatures for objects to guarantee the integrity of objects cryptographically.

Zero-Knowledge Arguments for Subverted RSA Groups

This work investigates zero-knowledge protocols in subverted RSA groups where the prover can choose the modulus and where the verifier does not know the group order.

A Key-Recovery Attack Against Mitaka in the t-Probing Model

We uncover a flaw in the security proof of MITAKA, and subsequently show that it is not secure in the t-probing model.

Area–Time Efficient Implementation of NIST Lightweight Hash Functions Targeting IoT Applications

This work presents field-programmable gate array (FPGA) implementations and carefully worked out optimizations of four Round-3 finalists in the NIST standardization process