Practical Post-Quantum Signatures for Privacy
Sven Argo, Tim Güneysu, Corentin Jeudy, Georg Land, Adeline Roux-Langlois, Olivier Sanders
摘要
The transition to post-quantum cryptography has been an enormous challenge and effort for cryptographers over the last decade, with impressive results such as the future NIST standards. However, the latter has so far only considered central cryptographic mechanisms (signatures or KEM) and not more advanced ones, e.g., targeting privacy-preserving applications. Of particular interest is the family of solutions called blind signatures, group signatures and anonymous credentials, for which standards already exist, and which are deployed in billions of devices. Such a family does not have, at this stage, an efficient post-quantum counterpart although very recent works improved this state of affairs by offering two different alternatives: either one gets a system with rather large elements but a security proved under standard assumptions or one gets a more efficient system at the cost of ad-hoc interactive assumptions or weaker security models. Moreover, all these works have only considered size complexity without implementing the quite complex building blocks their systems are composed of. In other words, the practicality of such systems is still very hard to assess, which is a problem if one envisions a post-quantum transition for the corresponding systems/standards.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper7
- Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More GeneralVadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime PlançonCRYPTO 2022 · 被引用 125 次
- Lattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism StabilityRafaël del Pino, Vadim Lyubashevsky, Gregor SeilerCCS 2018 · 被引用 84 次
- Mitaka: A Simpler, Parallelizable, Maskable Variant of FalconThomas Espitau, Pierre-Alain Fouque, François Gérard, Mélissa Rossi 等EUROCRYPT 2022 · 被引用 67 次
- Practical Non-interactive Publicly Verifiable Secret Sharing with Thousands of PartiesCraig Gentry, Shai Halevi, Vadim LyubashevskyEUROCRYPT 2022 · 被引用 65 次
- Shorter Hash-and-Sign Lattice-Based SignaturesThomas Espitau, Mehdi Tibouchi, Alexandre Wallet, Yang YuCRYPTO 2022 · 被引用 38 次
相关 Paper
- Lattice Signature with Efficient Protocols, Application to Anonymous CredentialsCorentin Jeudy, Adeline Roux-Langlois, Olivier SandersCRYPTO 2023 · 被引用 29 次
- Post-Quantum Blind Signature from Standard Group Action Assumptions and MoreLucjan Hanzlik, Yi-Fu Lai, Eugenio Paracucchi, Edoardo PersichettiEUROCRYPT 2026 · 被引用 1 次
- A Framework for Practical Anonymous Credentials from LatticesJonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Alessandro SorniottiCRYPTO 2023 · 被引用 34 次
- Lattice-Based Threshold Blind SignaturesSebastian Faller, Guilhem Niot, Michael ReichleS&P 2026 · 被引用 2 次
- Pairing-Free Blind Signatures from Standard Assumptions in the ROMJulia Kastner, Ky Nguyen, Michael ReichleCRYPTO 2024 · 被引用 11 次
