Non-interactive Blind Signatures from RSA Assumption and More
Lucjan Hanzlik, Eugenio Paracucchi, Riccardo Zanotto
摘要
Blind signatures have received increased attention from researchers and practitioners. They allow users to obtain a signature under a message without revealing it to the signer. One of the most popular applications of blind signatures is to use them as one-time tokens, where the issuing is not linkable to the redeeming phase, and the signature under a random identifier forms a valid token. This concept is the backbone of the Privacy Pass system, which uses it to identify honest but anonymous users and protect content delivery networks from botnets.
Non-interactive blind signatures for random messages were introduced by Hanzlik (Eurocrypt'23). They allow a signer to create a pre-signature with respect to a particular public key, while the corresponding secret key can later be used to finalize the signature. This non-interaction allows for more applications than in the case of blind signatures. In particular, the author suggested using regular PKI keys as the recipient public key, allowing for a distribution of one-time tokens to users outside the system, e.g., to public keys of GitHub users, similar to airdropping of cryptocurrencies. Unfortunately, despite introducing this concept, the paper fails to provide schemes that work with keys used in the wild.
We solve this open problem. We introduce a generic construction of non-interactive blind signatures that relies on Yao's garbled circuit techniques and provide particular improvements to this generic setting. We replace oblivious transfer with their non-interactive variant and show how to construct them so that the recipient's public key, encoding the choice, is a standard RSA public key . To improve the efficiency of the garbling, we show how to garble the signing algorithm of the pairing-based Pointcheval-Sanders (PS) signatures and the RSA-based signature scheme with efficient protocols by Camenisch and Lysyanskaya. Our technique also apply to the well-known BBS signatures. All our improvements are of independent interest and are central to our contribution.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
引用它的顶会 Paper1
问问它们各自怎么用它相关 Paper
- Non-interactive Blind Signatures for Random MessagesLucjan HanzlikEUROCRYPT 2023 · 被引用 17 次
- Pairing-Free Blind Signatures from Standard Assumptions in the ROMJulia Kastner, Ky Nguyen, Michael ReichleCRYPTO 2024 · 被引用 11 次
- Rai-Choo! Evolving Blind Signatures to the Next LevelLucjan Hanzlik, Julian Loss, Benedikt WagnerEUROCRYPT 2023 · 被引用 23 次
- Round-Optimal Blind Signatures in the Plain Model from Classical and Quantum Standard AssumptionsShuichi Katsumata, Ryo Nishimaki, Shota Yamada, Takashi YamakawaEUROCRYPT 2021 · 被引用 12 次
- Snowblind: A Threshold Blind Signature in Pairing-Free GroupsElizabeth C. Crites, Chelsea Komlo, Mary Maller, Stefano Tessaro 等CRYPTO 2023 · 被引用 36 次
