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:quant-ph/0502091 · International Journal of Quantum Information

QUANTUM BIT STRING SEALING

Guang Ping He

Published Aug 1, 2006• 9 citations
arXivHTMLPDF

Abstract

Though it was proven that secure quantum sealing of a single classical bit is impossible in principle, here we propose an unconditionally secure quantum sealing protocol which seals a classical bit string. Any reader can obtain each bit of the sealed string with an arbitrarily small error rate, while reading the string is detectable. The protocol is simple and easy to implement. The possibility of using this protocol to seal a single bit in practice is also briefly discussed.

DOI
10.1142/s0219749906002079

Related papers

Quantum sealing of a classical string

Guang-Ping He

A quantum scheme is proposed which seals a classical string. Each bit of the string can be read out with an arbitrarily small error rate, while reading the string can be detected except with an exponentially small probability.

•Feb 15, 2005•0 citations

An information-theoretic security analysis of quantum string sealing

Masaki Nakanishi, Seiichiro Tani, Shigeru Yamashita

Abstract: A quantum sealing protocol is a quantum cryptographic protocol that can detect unsealing of a message. It is known that quantum bit sealing is insecure. However, this does not imply that quantum string sealing is also insecure. So the possibility of quantum string sealing has been studied. In this paper, we propose a quantum sealing protocol and give an information theoretic analysis. We also show that our protocol is almost optimal for uniformly distributed inputs in the sense that the upper bound of information leaks almost matches the trivial lower bound.

•Dec 14, 2007•1 citation

Practically secure quantum bit commitment based on quantum seals

Guang Ping He, Z. D. Wang

The relationship between the quantum bit commitment (QBC) and quantum seal (QS) is studied. It is elaborated that QBC and QS are not equivalent, but QS protocols satisfying a stronger unconditional security requirement can lead to an unconditionally secure QBC. In this sense, QS is strictly stronger than QBC in security requirements. Based on an earlier proposal on sealing a single bit, a feasible QBC protocol is also put forward, which is secure in practice even if the cheater has a strong quantum computational power.

arXiv:0804.3531•Apr 22, 2008•1 citation

Quantum Bit String Commitment

Adrian Kent

A bit string commitment protocol securely commits N classical bits so that the recipient can extract only M<N bits of information about the string. Classical reasoning suggests that bit string commitment implies bit commitment and hence, given the Mayers-Lo-Chau theorem, that nonrelativistic quantum bit string commitment is impossible. Not so: there exist nonrelativistic quantum bit string commitment protocols, with security parameters epsilon and M, that allow A to commit N=N(M,epsilon) bits to B so that A's probability of successfully cheating when revealing any bit and B's probability of extracting more than N'=N-M bits of information about the N bit string before revelation are both less than epsilon. With a restrictive definition of security against A, N can be taken to be O(exp(CN')) for a positive constant C. I briefly discuss possible applications.

arXiv:quant-ph/0111099•Physical Review Letters•Jun 13, 2003•53 citations

A simple practical quantum bit commitment protocol

muqian wen

This paper devises a simple quantum bit commitment protocol that is just as easy to implement as any existing practical quantum bit commitment protocols but will be more secure. It will be infinitely close to being unconditionally fully secure although neither perfectly binding nor perfectly concealing.

arXiv:2009.13263•Sep 25, 2020•0 citations

Secure quantum string seal exists

Guang Ping He

It was claimed that all quantum string seals are insecure [H. F. Chau, quant-ph/0602099]. However, here it will be shown that for imperfect quantum string seals, the information obtained by the measurement proposed in that reference is trivial. Therefore imperfect quantum string seals can be unconditionally secure.

arXiv:quant-ph/0602159•Feb 18, 2006•3 citations
Though it was proven that secure quantum sealing of a single classical bit is impossible in principle, here we propose an unconditionally secure quantum sealing protocol which seals a classical bit string. Any reader can obtain each bit of the sealed string with an arbitrarily small error rate, while reading the string is detectable. The protocol is simple and easy to implement. The possibility of using this protocol to seal a single bit in practice is also briefly discussed.
Abstract: A quantum sealing protocol is a quantum cryptographic protocol that can detect unsealing of a message. It is known that quantum bit sealing is insecure. However, this does not imply that quantum string sealing is also insecure. So the possibility of quantum string sealing has been studied. In this paper, we propose a quantum sealing protocol and give an information theoretic analysis. We also show that our protocol is almost optimal for uniformly distributed inputs in the sense that the upper bound of information leaks almost matches the trivial lower bound.
The relationship between the quantum bit commitment (QBC) and quantum seal (QS) is studied. It is elaborated that QBC and QS are not equivalent, but QS protocols satisfying a stronger unconditional security requirement can lead to an unconditionally secure QBC. In this sense, QS is strictly stronger than QBC in security requirements. Based on an earlier proposal on sealing a single bit, a feasible QBC protocol is also put forward, which is secure in practice even if the cheater has a strong quantum computational power.
A bit string commitment protocol securely commits N classical bits so that the recipient can extract only M<N bits of information about the string. Classical reasoning suggests that bit string commitment implies bit commitment and hence, given the Mayers-Lo-Chau theorem, that nonrelativistic quantum bit string commitment is impossible. Not so: there exist nonrelativistic quantum bit string commitment protocols, with security parameters epsilon and M, that allow A to commit N=N(M,epsilon) bits to B so that A's probability of successfully cheating when revealing any bit and B's probability of extracting more than N'=N-M bits of information about the N bit string before revelation are both less than epsilon. With a restrictive definition of security against A, N can be taken to be O(exp(CN')) for a positive constant C. I briefly discuss possible applications.