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

Lecture notes in computer science

Adaptively-Secure Distributed Public-Key Systems

Yair Frankel, PHILIP D. MACKENZIE, Moti M. Yung

Published Jan 1, 1999• 41 citations
Publisher
DOI
10.1007/3-540-48481-7_2

Related papers

Adaptively secure distributed public-key systems

Yair Frankel, PHILIP D. MACKENZIE, Moti M. Yung

Theoretical Computer Science•Sep 1, 2002•4 citations

Adaptively-Secure, Non-interactive Public-Key Encryption

Ran Canetti, Shai Halevi, Jonathan I. Katz

Lecture notes in computer science•Jan 1, 2005•65 citations

An Efficient Two-Party Public Key Cryptosystem Secure against Adaptive Chosen Ciphertext Attack

Philip Mac Kenzie

Lecture notes in computer science•Dec 18, 2002•12 citations

Quantum-Resistant Updatable Public Keys: Enhancing the Quisquis Protocol with LWE-Based Security

Hao-Yi Hsu, Raylin Tso, Tao-Hsiang Chang +2 more

The advent of quantum computing presents significant challenges to current cryptographic systems, particularly those based on the Discrete Logarithm Problem (DLP), which underpins the security of many cryptocurrencies. In response, we propose a quantum-resistant adaptation of the Updatable Public Key (UPK) primitive in the Quisquis cryptocurrency protocol. This adaptation transitions from a DLP-based security model to one grounded in the Learning With Errors (LWE) assumption, which is believed to be secure against quantum attacks. Our LWE-based UPK scheme preserves the key advantages of Quisquis, including the ability to update public keys in a publicly verifiable manner while maintaining their indistinguishability from freshly generated keys. We discuss the challenges introduced by this transition, particularly the accumulation of noise during key updates, and outline future work to address these issues. Our work ensures that Quisquis remains a robust and efficient solution for privacy-preserving transactions in a post-quantum world.

International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)•Dec 10, 2024•1 citation

Public-Key Quantum Authentication and Digital Signature Schemes Based on the QMA-Complete Problem

Liu, Le-Ran, He, Min-Quan, Zhang, Dan-Bo +1 more

We propose a quantum authentication and digital signature protocol whose security is founded on the Quantum Merlin Arthur~(QMA)-completeness of the consistency of local density matrices. The protocol functions as a true public-key cryptography system, where the public key is a set of local density matrices generated from the private key, a global quantum state. This construction uniquely eliminates the need for trusted third parties, pre-shared secrets, or authenticated classical channels for public key distribution, making a significant departure from symmetric protocols like quantum key distribution. We provide a rigorous security analysis, proving the scheme's unforgeability against adaptive chosen-message attacks by quantum adversaries. The proof proceeds by a formal reduction, demonstrating that a successful forgery would imply an efficient quantum algorithm for the QMA-complete Consistency of Quantum Marginal Problem~(QMP). We further analyze the efficiency of verification using partial quantum state tomography, establishing the protocol's theoretical robustness and outlining a path towards practical implementation

arXiv:2506.16904•Jun 20, 2025•1 citation

A Secure Public-Key Authentication Scheme

Zvi Galil, Stuart Haber, Moti M. Yung

Springer eBooks•Nov 15, 2007•0 citations
The advent of quantum computing presents significant challenges to current cryptographic systems, particularly those based on the Discrete Logarithm Problem (DLP), which underpins the security of many cryptocurrencies. In response, we propose a quantum-resistant adaptation of the Updatable Public Key (UPK) primitive in the Quisquis cryptocurrency protocol. This adaptation transitions from a DLP-based security model to one grounded in the Learning With Errors (LWE) assumption, which is believed to be secure against quantum attacks. Our LWE-based UPK scheme preserves the key advantages of Quisquis, including the ability to update public keys in a publicly verifiable manner while maintaining their indistinguishability from freshly generated keys. We discuss the challenges introduced by this transition, particularly the accumulation of noise during key updates, and outline future work to address these issues. Our work ensures that Quisquis remains a robust and efficient solution for privacy-preserving transactions in a post-quantum world.
We propose a quantum authentication and digital signature protocol whose security is founded on the Quantum Merlin Arthur~(QMA)-completeness of the consistency of local density matrices. The protocol functions as a true public-key cryptography system, where the public key is a set of local density matrices generated from the private key, a global quantum state. This construction uniquely eliminates the need for trusted third parties, pre-shared secrets, or authenticated classical channels for public key distribution, making a significant departure from symmetric protocols like quantum key distribution. We provide a rigorous security analysis, proving the scheme's unforgeability against adaptive chosen-message attacks by quantum adversaries. The proof proceeds by a formal reduction, demonstrating that a successful forgery would imply an efficient quantum algorithm for the QMA-complete Consistency of Quantum Marginal Problem~(QMP). We further analyze the efficiency of verification using partial quantum state tomography, establishing the protocol's theoretical robustness and outlining a path towards practical implementation