Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2301.09236 · Lecture notes in computer science

On the (Im)plausibility of Public-Key Quantum Money from Collision-Resistant Hash Functions

Prabhanjan Ananth, Zihan Hu, Henry Yuen

Published Jan 1, 2023• 7 citations
arXivHTMLPDF
DOI
10.1007/978-981-99-8742-9_2

Related papers

Anonymous Public-Key Quantum Money and Universally Verifiable Quantum Voting

Alper Çakan, Vipul Goyal, Takashi Yamakawa

Lecture notes in computer science•Jan 1, 2026•0 citations

Identity-Based Chameleon Hashing from the SIS Assumption in a Central Authority Model

Wen‐Chung Kuo, Dai-Rui Lin, Shi-Xun Chen

Hash functions play a fundamental role in cryptography, offering one-way and collision-resistant properties essential for digital security. Chameleon hashing, an extension of traditional hash functions, allows controlled collision generation using a private trapdoor, enabling various cryptographic applications such as online/offline digital signatures and commitment schemes. However, existing identity-based chameleon hash (IBCH) functions largely rely on number-theoretic assumptions, which are vulnerable to quantum attacks. To address this issue, we propose a novel IBCH function built upon post-quantum lattice-based cryptography. Specifically, our construction leverages the Short Integer Solution (SIS) problem to achieve quantum-resistant security guarantees. The proposed scheme enables identitybased key management, allowing users to generate hash values using public identity information while preserving the trapdoorcontrolled collision property. We rigorously analyze the security of our scheme, demonstrating its resistance against quantum adversaries under standard lattice assumptions. Furthermore, we compare our construction with existing functions in terms of computational efficiency and security, showing that our approach provides a feasible and secure alternative for post-quantum applications.

IEEE Conference on Dependable and Secure Computing (DSC)•Oct 18, 2025•0 citations

Cryptanalysis of three quantum money schemes

Andriyan Bilyk, Javad Doliskani, Zhiyong Gong

arXiv:2205.10488•Quantum Information Processing•Apr 19, 2023•8 citations

New Constructions for Quantum Money and Its Application

Kefan Cheng, Hongfeng Zhu

International Journal of Theoretical Physics•Sep 17, 2022•0 citations

Resettable Zero Knowledge in the Bare Public-Key Model under Standard Assumption

Yi Deng, Dongdai Lin

In this paper we resolve an open problem regarding resettable zero knowledge in the bare public-key (BPK for short) model: Does there exist constant round resettable zero knowledge argument with concurrent soundness for $\mathcal{NP}$ in BPK model without assuming \emph{sub-exponential hardness}? We give a positive answer to this question by presenting such a protocol for any language in $\mathcal{NP}$ in the bare public-key model assuming only collision-resistant hash functions against \emph{polynomial-time} adversaries.

arXiv:cs/0607035•Jul 10, 2006•2 citations

Toward Secure Quantum Money

Bhaskar Roberts

•Aug 19, 2019•3 citations
Hash functions play a fundamental role in cryptography, offering one-way and collision-resistant properties essential for digital security. Chameleon hashing, an extension of traditional hash functions, allows controlled collision generation using a private trapdoor, enabling various cryptographic applications such as online/offline digital signatures and commitment schemes. However, existing identity-based chameleon hash (IBCH) functions largely rely on number-theoretic assumptions, which are vulnerable to quantum attacks. To address this issue, we propose a novel IBCH function built upon post-quantum lattice-based cryptography. Specifically, our construction leverages the Short Integer Solution (SIS) problem to achieve quantum-resistant security guarantees. The proposed scheme enables identitybased key management, allowing users to generate hash values using public identity information while preserving the trapdoorcontrolled collision property. We rigorously analyze the security of our scheme, demonstrating its resistance against quantum adversaries under standard lattice assumptions. Furthermore, we compare our construction with existing functions in terms of computational efficiency and security, showing that our approach provides a feasible and secure alternative for post-quantum applications.
In this paper we resolve an open problem regarding resettable zero knowledge in the bare public-key (BPK for short) model: Does there exist constant round resettable zero knowledge argument with concurrent soundness for NP\mathcal{NP}NP in BPK model without assuming \emph{sub-exponential hardness}? We give a positive answer to this question by presenting such a protocol for any language in NP\mathcal{NP}NP in the bare public-key model assuming only collision-resistant hash functions against \emph{polynomial-time} adversaries.