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

Communications in computer and information science

Lattice-Based Multi-entity Identification Protocols

Yohei Watanabe, Toi Tomita, Junji Shikata

Published Jan 1, 2024• 0 citations
Publisher
DOI
10.1007/978-981-97-4465-7_4

Related papers

A Lightweight Identification Protocol Based on Lattices

Samed Düzlü, Juliane Krämer, Thomas Pöppelmann +1 more

Lecture notes in computer science•Jan 1, 2023•3 citations

Concerning Quantum Identification Without Entanglement

Carlos E. González-Guillén, María Isabel González Vasco, Floyd B. Johnson +1 more

Identification schemes are interactive protocols typically involving two parties, a prover, who wants to provide evidence of his or her identity and a verifier, who checks the provided evidence and decide whether it comes or not from the intended prover. In this paper, we comment on a recent proposal for quantum identity authentication from Zawadzki, and give a concrete attack upholding theoretical impossibility results from Lo and Buhrman et al. More precisely, we show that using a simple strategyan adversary may indeed obtain non-negligible information on the shared identification secret. While the security of a quantum identity authentication scheme is not formally defined in [1], it is clear that such a definition should somehow imply that an external entity may gain no information on the shared identification scheme (even if he actively participates injecting messages in a protocol execution, which is not assumed in our attack strategy).

arXiv:2003.12095•Mar 26, 2020•1 citation

A tightly secure multi-party-signature protocol in the plain model

Lihao Wei, Jieqing Ai, Shenghan Liu

A multi-party-signature protocol enables an ensemble of entities to sign on a message to produce a compressed signature. Recently, a lot of multi-party-signature protocols have been proposed in the security field. However, these schemes suffer either from impractical assumptions or from loose security reductions. This paper address all these issues by presenting a practical multi-party-signature protocol. Specifically, the designed multiparty-signature protocol is secure tightly connected to the Computational Diffie-Hellman (CDH) problem in the plain model. Moreover, the multi-party-signature size is small and the communication cost is very low.

International Conference on Biomedical Engineering and Informatics (BMEI)•Oct 1, 2015•3 citations

Improved Zero-Knowledge Identification with Lattices

Pierre-Louis Cayrel, Richard Lindner, Markus Rückert +1 more

Lecture notes in computer science•Jan 1, 2010•35 citations

Lattice-Based Identification Schemes Secure Under Active Attacks

Vadim Lyubashevsky

Springer eBooks•Feb 26, 2008•188 citations

Practical Quantum No-key Protocol with Identification

Yang Wu, Li Yang

Quantum no-key protocol is a quantum realization of Shamir's idea of no-key cryptosystem, which can be used to transport quantum and classical message secretly. It is beyond computational security. We give a practical quantum no-key protocol with mutual identification. In order to prevent MIM (man-in-the-middle) attack, we realize secure information transmission and identification by utilizing a short pre-shared secret bit sequence. And we use pseudo-random sequences to mix the photons which are used for information transmission and the photons which are used for identification. Pseudo-random sequence partly protects the secret sequence and makes our protocol more practical while do not weaken the security. We post a schematic diagram of the experimental set-up which is based on fiber communication system. Our protocol does not need entanglement, multi-qubit operation or classical communication.

International Conference on Information Assurance and Security (IAS)•Jan 1, 2009•4 citations
Identification schemes are interactive protocols typically involving two parties, a prover, who wants to provide evidence of his or her identity and a verifier, who checks the provided evidence and decide whether it comes or not from the intended prover. In this paper, we comment on a recent proposal for quantum identity authentication from Zawadzki, and give a concrete attack upholding theoretical impossibility results from Lo and Buhrman et al. More precisely, we show that using a simple strategyan adversary may indeed obtain non-negligible information on the shared identification secret. While the security of a quantum identity authentication scheme is not formally defined in [1], it is clear that such a definition should somehow imply that an external entity may gain no information on the shared identification scheme (even if he actively participates injecting messages in a protocol execution, which is not assumed in our attack strategy).
A multi-party-signature protocol enables an ensemble of entities to sign on a message to produce a compressed signature. Recently, a lot of multi-party-signature protocols have been proposed in the security field. However, these schemes suffer either from impractical assumptions or from loose security reductions. This paper address all these issues by presenting a practical multi-party-signature protocol. Specifically, the designed multiparty-signature protocol is secure tightly connected to the Computational Diffie-Hellman (CDH) problem in the plain model. Moreover, the multi-party-signature size is small and the communication cost is very low.
Quantum no-key protocol is a quantum realization of Shamir's idea of no-key cryptosystem, which can be used to transport quantum and classical message secretly. It is beyond computational security. We give a practical quantum no-key protocol with mutual identification. In order to prevent MIM (man-in-the-middle) attack, we realize secure information transmission and identification by utilizing a short pre-shared secret bit sequence. And we use pseudo-random sequences to mix the photons which are used for information transmission and the photons which are used for identification. Pseudo-random sequence partly protects the secret sequence and makes our protocol more practical while do not weaken the security. We post a schematic diagram of the experimental set-up which is based on fiber communication system. Our protocol does not need entanglement, multi-qubit operation or classical communication.