Efficient post-quantum secure deterministic wallet scheme

Abstract

Abstract Since the advent of Bitcoin, cryptocurrencies have gained substantial popularity, and crypto wallets have evolved into the predominant tool for safeguarding and managing cryptographic keys to access cryptocurrency funds. Deterministic wallets are proposed as an advanced wallet mechanism to provide benefits such as low-maintenance, easy backup and recovery, and support for functionalities required by cryptocurrencies. Alkeilani Alkadri et al. (ACM CCS’20) presented the first post-quantum secure deterministic wallet scheme, but it exhibits a gap to bridge before achieving practical applicability, as reflected in both their concrete parameters size and computational efficiency. In this paper, we propose an efficient post-quantum secure deterministic wallet scheme. In particular, we present a new construction method for deterministic wallets, prove the security in the quantum random oracle model, and provide an efficient instantiation. The comparison result, with the work of Alkeilani Alkadri et al. (ACM CCS’20), shows our work has a comprehensive improvement on efficiency, e.g., the pk size is $$\approx 40.7$$ ≈ 40.7 times shorter, sk is $$\approx 9.2$$ ≈ 9.2 times shorter, and the signing time is $$\approx 3.1$$ ≈ 3.1 times faster.

Keywords

• Deterministic wallets
• Post-quantum secure
• Lattice-based cryptography
• Blockchain
• Cryptocurrency