Pu, S., Thyagarajan, S. A., D"ottling, N., & Hanzlik, L. (2023). Post quantum fuzzy stealth signatures and applications. Cryptology ePrint Archive,
Added by: Jack (2023-07-29 02:58) Last edited by: Jack (2023-07-29 02:59)
|
|
|
Abstract
|
Private payments in blockchain-based cryptocurrencies have been a topic of research, both academic and industrial, ever since the advent of Bitcoin. Stealth address payments were proposed as a solution to improve payment privacy for users and are, in fact, deployed in several major cryptocurrencies today. The mechanism lets users receive payments so that none of these payments are linkable to each other or the recipient. Currently known stealth address mechanisms either (1) are insecure in certain reasonable adversarial models, (2) are inefficient in practice or (3) are incompatible with many existing currencies. In this work, we formalize the underlying cryptographic abstraction of this mechanism, namely, stealth signatures with formal game-based definitions. We show a surprising application of our notions to passwordless authentication defined in the Fast IDentity Online (FIDO) standard. We then present Spirit, the first efficient post-quantum secure stealth signature construction based on the NIST standardized signature and key-encapsulation schemes, Dilithium and Kyber. The basic form of Spirit is only secure in a weak security model, but we provide an efficiency- preserving and generic transform, which boosts the security of Spirit to guarantee the strongest security notion defined in this work. Compared to state-of-the-art, there is an approximately 800x improvement on the signature size while keeping signing and verification as efficient as 0.2 ms. We extend Spirit with a fuzzy tracking functionality where recipients can outsource the tracking of incoming transactions to a tracking server, satisfying an anonymity notion similar to that of fuzzy message detection (FMD) recently introduced in [CCS 2021]. We also extend Spirit with a new fuzzy tracking framework called scalable fuzzy tracking that we introduce in this work. This new framework can be considered as a dual of FMD, in that it reduces the tracking server’s computational workload to sublinear in the number of users, as opposed to linear in FMD. Experimental results show that, for millions of users, the server only needs 3.4 ms to filter each incoming message which is a significant improvement upon the state-of-the-art.
|
[41/2749]