poqeth: Efficient, post-quantum signature verification on Ethereum

Kysil, Ruslan and Seres, István András and Kutas, Péter and Kelecsényi, Nándor (2025) poqeth: Efficient, post-quantum signature verification on Ethereum. In: Proceedings of the 20th ACM Asia Conference on Computer and Communications Security. Association for Computing Machinery (ACM), New York, pp. 327-343. ISBN 9798400714108

Preview

Text 3708821.3736193.pdf - Published Version Download (4MB) | Preview

Abstract

This work explores the application and efficient deployment of (standardized) post-quantum (PQ) digital signature algorithms in the blockchain environment. Specifically, we implement and evaluate four PQ signatures in the Ethereum Virtual Machine: W-OTS+ , XMSS, SPHINCS+, and MAYO. We focus on optimizing the gas costs of the verification algorithms as that is the signature schemes’ only algorithm executed on-chain, thus incurring financial costs (transaction fees) for the users. Hence, the verification algorithm is the signature schemes’ main bottleneck for decentralized applications. We examine two methods to verify post-quantum digital signatures on-chain. Our practical performance evaluation shows that full on-chain verification is often prohibitively costly. Naysayer proofs (FC’24) allow a novel optimistic verification mode. We observe that the Naysayer verification mode is generally the cheapest, at the cost of additional trust assumptions. We release our implementation called poqeth as an open-source library.

Actions (login required)

Edit Item