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

使用Greenberger-Horne-Zeilinger糾纏態實行不用密碼表之多方量子秘密分享協定

陳碩懋, Shuo-Mao Chen

Published Jan 1, 2011• 0 citations
OpenAlex

Abstract

In the times of fast developed technology, to processing tremendous amount of computing data, the ability of computing has always been developed rapidly. According to Moore’s Law, with the growing of the complexity of integrated circuit day by day, the density of circuit is getting higher and higher. And this has made the components in each circuit smaller and smaller. Therefore, there have been some problems when the classical bits cannot be achieved ever since. To solve the computation that traditional computers are not able to process, and the obstacle to break through the limitation of the size of hardware of traditional computers, scientists started to focus on the discussion of qubits in attempts to conclude the methods to replace the classical bits. Meanwhile, scientists also brought out a lot of algorithm for quantum and quantum information security protocols to let quantum computing processes the information more precisely, safer and more efficiency. In modern times, there are amount of text and audio-visual materials have been transformed into digital files and communicated on the internet since the computers and the internet fast progressed. It proves that the security of transmitting information and on the internet is becoming a quite important issue in the field of information security. So, the information security on the internet had been attracted and researched. Moreover, the researches in the field of information security are attracted. In all researches of information security, secret sharing is a remarkable example. The concept of secret sharing is as follows: When dealer Alice wants to send the secret messages to her agents Bob and Charlie. Alice is worried about there is a dishonor, she does not want agent knows whole messages directly by oneself. So, she splits the secret message into two pieces and makes encryption on two pieces. Once Bob and Charlie collaborate, they can decode the message from Alice. Nevertheless, it is easy to intercepts and copies the secret message by eavesdropper Eve by using classical bits. Eve steals message from Alice, then copies a same classical and sends to Bob without detecting. Therefore, there are some defects in the classical secret sharing by utilizing classical bits. The Quantum Secret Sharing protocol (QSS) is a communication protocol of combining quantum mechanics and classical secret sharing. Different from the classical secret sharing, quantum mechanics and quantum non-cloning theorem are used in QSS. Once a qubit is measured, it collapses into one particular quantum state. If there is an eavesdropper stealing, the state of qubit will be changed such that Eve will be detected. Consequently, quantum secret sharing can prevent Eve from eavesdropping. In order to improve the defects of classical secret sharing, quantum secret sharing are proposed. In this paper, we will present a new method of quantum secret sharing by using quantum entanglement. Moreover, different from former protocols using code table to assist decoding, we present a quantum secret sharing without code table in our scheme to improve the security of the secret messages.

Related papers

Secret sharing in fast fading channels based on reliability-based hybrid ARQ

Chan Wong Wong, John M. Shea, Tan F. Wong

Consider a wireless transmission from Alice to Bob in the presence of an eavesdropper, Eve. We propose a technique to allow Alice to send a message such that Bob can decode it but Eve can get little information about the message. This scenario is a classic example of the wiretap channel, for which several researchers have begun to develop practical schemes. However, we consider a challenging version in which the channel from Alice to Eve may be as good or better than the channel from Alice to Bob. There have been no practical secrecy coding techniques that have been developed for this scenario. The key to allow secret communication in such a scenario is feedback from Bob to Alice (which Eve can also observe). The scheme we develop uses reliability-based hybrid automatic-repeat-request (RB-HARQ) over a fast fading channel to provide a decoding advantage at Bob. Bob requests information about received symbols that suffer from deep fades. The retransmitted symbols improve Bobpsilas ability to decode the message faster than at Eve, who sees retransmission of bits with random reliabilities. We evaluate the proposed scheme by performance measures such as the probability of successful decoding and the equivocation rate at Eve.

IEEE Military Communications Conference (MILCOM)•Nov 1, 2008•9 citations

Authenticated anonymous secret-sharing protocol based on a high-dimensional quantum system

Guodong Li, Xu Yixi, WANG QingLe +2 more

秘密共享协议通过将秘密分割存储, 达到分散风险和容忍入侵的目的, 能有效地防止外部敌手的攻击和内部参与者的背叛. 然而, 公开的接收者身份存在被攻击的风险. 本文给出了量子匿名秘密共享的定义并提出一种基于 d 维量子系统的可认证匿名秘密共享协议以解决秘密共享协议中接收者身份的匿名问题.在该协议中, 秘密分发者首先利用 Greenberger–Horne–Zeilinger 态对所有的参与者进行身份认证, 然后在指定的匿名接收者集合中构建匿名纠缠. 最后利用构建的匿名纠缠为秘密共享任务提供消息保密性和接收者身份匿名性保护. 正确性分析表明, 匿名接收者可以正确获得秘密份额并合作恢复出秘密. 在安全性方面, 协议可以同时抵抗来自外部敌手和内部参与者的攻击. 最后, 匿名性分析表明, 协议不会泄露任何有关接收者身份的信息. 量子匿名秘密共享的提出为保护用户隐私和确保信息安全提供了新思路, 也为未来量子网络中的通信协议提供了新的可能性.

Zhongguo kexue. Wulixue Lixue Tianwenxue•Aug 29, 2023•6 citations

A quantum key distribution on qudits using quantum operators

Wachirapong Jirakitpuwapat, Poom Kumam, Tanapat Deesuwan +1 more

Cryptography is processing for securing communication between two people. The opponent wants to know the message that is encrypted using a secret key. Although the opponent can eavesdrop the message sent between the sender and the receiver, the opponent is unable to decrypt to read the message. Therefore, the secret key is very important. The sender and the receiver agree with the secret key in an insecure channel by using key distribution protocol such as the Diffie–Hellman protocol. Since quantum computer is coming soon, Diffie–Hellman protocol is not secure. We will develop a quantum key distribution protocol. The benefit of the quantum system is the quantum state that cannot copy by no‐cloning theorem. Thus, the opponent does not copy and keeps the message that is quantum. In this paper, a novel quantum key distribution protocol between two people (Alice and Bob) based on quantum operators is developed. The opponent (Eve) wants to know the secret key. Although Eve knows this quantum key distribution protocol, Eve does not behave similarly to Alice and Bob. For example, Eve eavesdrops Alice's quantum state that was sent to Bob, and Eve sends another quantum state. Therefore, we cannot control Eve's behavior. So we give the upper bound of mutual information between the user and opponent by using Holevo's bound. We verify the usual security definition for quantum key distribution that is equality‐and‐uniformity and privacy in the mutual information sense.

Mathematical Methods in the Applied Sciences•Nov 5, 2020•4 citations

リョウシケイサン・ツウシンヲゼンテイトシタイチホウコウセイカラヨソクフカノウセイオヨビリョウシコウカイカギアンゴウヘノキチャク

数藤恭平, Kyohei Sudo

Cryptography is the science and practice of designing computing and communication systems that are secure in the presence of adversaries.Among the central topics in cryptographic research, public-key encryption enables secure communication between two parties, while digital signatures provide guarantees on the authenticity of information.To prove the security of cryptographic schemes, we use reductions.Reduction is a fundamental concept in computer science.When problem A is reduced to problem B, it implies that B is at least as hard as A. To show such a relationship, we usually build a reduction algorithm that solves A efficiently using an algorithm that solves B as a subroutine.Such reductions not only establish the security of the cryptographic primitives, but also give a computational complexity perspective.For example, one can identify the minimal assumption on which cryptographic systems can be based.The existence of one-way functions is considered a minimal assumption in cryptography.In other words, the existence of one-way functions is essential for the existence of any cryptographic primitive.A function f is said to be one-way if, given f (x), it is computationally infeasible to efficiently recover a corresponding preimage.While one-wayness is a minimal assumption, it is also known to suffice for deriving important cryptographic primitives such as symmetric-key encryption and digital signatures.Cryptographic primitives can thus be divided into those that can be derived from one-way functions and those that cannot.Cryptographic primitives that can be derived from one-way functions are referred to as Minicrypt.In this way, one-way functions play a central role in providing a hierarchical understanding of modern cryptographic theory.When quantum communication and computation are incorporated into cryptographic protocols, it becomes possible to derive a broader class of cryptographic primitives from one-way functions.For example, while there is evidence that public-key encryption cannot be constructed from one-way functions alone in the classical setting, recent works have shown that quantum public-key encryption can be constructed from one-way functions when quantum communication channels are available.Thus, even without altering the classical boundaries, incorporating quantum communication and computation leaves ample room for phenomena that differ from those observed in the classical setting.The class of cryptographic primitives that can be constructed from one-way functions, assuming quantum computation and communication, is referred to as MiniQCrypt.As quantum technologies continue to advance and the realization of quantum communication and quantum computers becomes increasingly plausible, the study of one-way functions must be revisited and discussed within these quantum frameworks.We identify two main challenges in this area.The first challenge is to generalize the quantum reduction from one-wayness to unpredictability.The classical reduction from onewayness to unpredictability, known as the Goldreich-Levin theorem, is not only fundamental in cryptography but also plays an important role in computational complexity theory.A quantum analogue of this theorem was established by Adcock and Cleve.However, whether the quantum Goldreich-Levin theorem holds not only in the binary setting but also over more general domains such as Z q remains a nontrivial open problem.The second challenge i

•Mar 25, 2026•0 citations

量子信息不对称:经典信息不对称理论的量子重构与一般化拓展(Quantum information asymmetry: quantum reconstruction and generalization of classical information asymmetry theory)

Huilin Zhao

摘 要:信息不对称是现代经济学解释市场失灵、契约设计、金融摩擦、逆向选择与道德风险的核心理论基石。经典信息不对称模型建立在知识离散二分、状态确定唯一、概率经典可加、信息静态外生与观测中立的经典世界观之上,将信息差异定义为“知道”与“不知道”的二元鸿沟,无法刻画现实中普遍存在的信念模糊、预期叠加、信息干涉、信心差异与观测改变信息结构等深层信息特征。本文严格立足于经济主体信息处理的本体逻辑,规避物理隐喻类比,引入量子叠加、量子相干、观测坍缩与量子信息熵构造公理体系,对经典信息不对称理论进行范式升级,构建一般性的量子信息不对称理论(Quantum Information Asymmetry,QIA)。本文严格证明,经典信息不对称是量子信息不对称在无叠加、无相干、无信念冲突与观测中立条件下的退化特例;通过推导量子信息不对称的数学结构、测度公式与均衡特征,系统阐释信息叠加、信念相干、观测坍缩与熵差演化四大微观作用机制。结合信贷市场、股票市场、委托—代理关系与政策传导等典型场景开展数值模拟分析,结果表明:量子信息不对称能够统一刻画信念混乱度差异、预期干涉效应、信息透明度内生与观测驱动信息跃迁等经典理论难以系统容纳的信息结构。本研究完善了信息经济学的基础公理体系,为契约理论、金融中介、公司治理、市场监管与宏观政策传导提供全新的基础性分析范式。 关键词:量子信息不对称;逆向选择;道德风险;信念叠加;观测坍缩;契约理论

•May 19, 2026•0 citations

A modified protocol of quantum state sharing based on entanglement swapping and random EPR selection

Jian Tao Dong, Jianfu Teng, Shuyan Wang

Quantum secret sharing (QSS), an important branch of quantum communication, is the generalization of classical secret sharing into quantum scenario. The secret messages are split into several parts, and each part is distributed to a separate party so that no action of a subset of all the parties without the cooperation of the entire group is able to read out the secret messages. In this paper, a quantum state sharing protocol is proposed by using entanglement swapping and random EPR selection. The EPR pairs of Bell-state measurement are selected randomly by the sender Alice, which can improve the security of the scheme and raise probability of detecting Eve to 95.8%. In addition, difference coding is used in this protocol to achieve a high efficiency. The security of the present multiparty QSS against eavesdropping has been analyzed. It is convenient in application as it require only two qubit entanglements, one measuring-basis and two-qubit joint measurements, not GHZ states, for sharing an arbitrary secret two-qubit state.

International Conference on Neural Networks and Signal Processing•Jun 1, 2008•2 citations
In the times of fast developed technology, to processing tremendous amount of computing data, the ability of computing has always been developed rapidly. According to Moore’s Law, with the growing of the complexity of integrated circuit day by day, the density of circuit is getting higher and higher. And this has made the components in each circuit smaller and smaller. Therefore, there have been some problems when the classical bits cannot be achieved ever since. To solve the computation that traditional computers are not able to process, and the obstacle to break through the limitation of the size of hardware of traditional computers, scientists started to focus on the discussion of qubits in attempts to conclude the methods to replace the classical bits. Meanwhile, scientists also brought out a lot of algorithm for quantum and quantum information security protocols to let quantum computing processes the information more precisely, safer and more efficiency.
In modern times, there are amount of text and audio-visual materials have been transformed into digital files and communicated on the internet since the computers and the internet fast progressed. It proves that the security of transmitting information and on the internet is becoming a quite important issue in the field of information security. So, the information security on the internet had been attracted and researched. Moreover, the researches in the field of information security are attracted. In all researches of information security, secret sharing is a remarkable example.
The concept of secret sharing is as follows: When dealer Alice wants to send the secret messages to her agents Bob and Charlie. Alice is worried about there is a dishonor, she does not want agent knows whole messages directly by oneself. So, she splits the secret message into two pieces and makes encryption on two pieces. Once Bob and Charlie collaborate, they can decode the message from Alice. Nevertheless, it is easy to intercepts and copies the secret message by eavesdropper Eve by using classical bits. Eve steals message from Alice, then copies a same classical and sends to Bob without detecting. Therefore, there are some defects in the classical secret sharing by utilizing classical bits.
The Quantum Secret Sharing protocol (QSS) is a communication protocol of combining quantum mechanics and classical secret sharing. Different from the classical secret sharing, quantum mechanics and quantum non-cloning theorem are used in QSS. Once a qubit is measured, it collapses into one particular quantum state. If there is an eavesdropper stealing, the state of qubit will be changed such that Eve will be detected. Consequently, quantum secret sharing can prevent Eve from eavesdropping. In order to improve the defects of classical secret sharing, quantum secret sharing are proposed. In this paper, we will present a new method of quantum secret sharing by using quantum entanglement. Moreover, different from former protocols using code table to assist decoding, we present a quantum secret sharing without code table in our scheme to improve the security of the secret messages.
Consider a wireless transmission from Alice to Bob in the presence of an eavesdropper, Eve. We propose a technique to allow Alice to send a message such that Bob can decode it but Eve can get little information about the message. This scenario is a classic example of the wiretap channel, for which several researchers have begun to develop practical schemes. However, we consider a challenging version in which the channel from Alice to Eve may be as good or better than the channel from Alice to Bob. There have been no practical secrecy coding techniques that have been developed for this scenario. The key to allow secret communication in such a scenario is feedback from Bob to Alice (which Eve can also observe). The scheme we develop uses reliability-based hybrid automatic-repeat-request (RB-HARQ) over a fast fading channel to provide a decoding advantage at Bob. Bob requests information about received symbols that suffer from deep fades. The retransmitted symbols improve Bobpsilas ability to decode the message faster than at Eve, who sees retransmission of bits with random reliabilities. We evaluate the proposed scheme by performance measures such as the probability of successful decoding and the equivocation rate at Eve.
秘密共享协议通过将秘密分割存储, 达到分散风险和容忍入侵的目的, 能有效地防止外部敌手的攻击和内部参与者的背叛. 然而, 公开的接收者身份存在被攻击的风险. 本文给出了量子匿名秘密共享的定义并提出一种基于 d 维量子系统的可认证匿名秘密共享协议以解决秘密共享协议中接收者身份的匿名问题.在该协议中, 秘密分发者首先利用 Greenberger–Horne–Zeilinger 态对所有的参与者进行身份认证, 然后在指定的匿名接收者集合中构建匿名纠缠. 最后利用构建的匿名纠缠为秘密共享任务提供消息保密性和接收者身份匿名性保护. 正确性分析表明, 匿名接收者可以正确获得秘密份额并合作恢复出秘密. 在安全性方面, 协议可以同时抵抗来自外部敌手和内部参与者的攻击. 最后, 匿名性分析表明, 协议不会泄露任何有关接收者身份的信息. 量子匿名秘密共享的提出为保护用户隐私和确保信息安全提供了新思路, 也为未来量子网络中的通信协议提供了新的可能性.
Cryptography is processing for securing communication between two people. The opponent wants to know the message that is encrypted using a secret key. Although the opponent can eavesdrop the message sent between the sender and the receiver, the opponent is unable to decrypt to read the message. Therefore, the secret key is very important. The sender and the receiver agree with the secret key in an insecure channel by using key distribution protocol such as the Diffie–Hellman protocol. Since quantum computer is coming soon, Diffie–Hellman protocol is not secure. We will develop a quantum key distribution protocol. The benefit of the quantum system is the quantum state that cannot copy by no‐cloning theorem. Thus, the opponent does not copy and keeps the message that is quantum. In this paper, a novel quantum key distribution protocol between two people (Alice and Bob) based on quantum operators is developed. The opponent (Eve) wants to know the secret key. Although Eve knows this quantum key distribution protocol, Eve does not behave similarly to Alice and Bob. For example, Eve eavesdrops Alice's quantum state that was sent to Bob, and Eve sends another quantum state. Therefore, we cannot control Eve's behavior. So we give the upper bound of mutual information between the user and opponent by using Holevo's bound. We verify the usual security definition for quantum key distribution that is equality‐and‐uniformity and privacy in the mutual information sense.
Cryptography is the science and practice of designing computing and communication systems that are secure in the presence of adversaries.Among the central topics in cryptographic research, public-key encryption enables secure communication between two parties, while digital signatures provide guarantees on the authenticity of information.To prove the security of cryptographic schemes, we use reductions.Reduction is a fundamental concept in computer science.When problem A is reduced to problem B, it implies that B is at least as hard as A. To show such a relationship, we usually build a reduction algorithm that solves A efficiently using an algorithm that solves B as a subroutine.Such reductions not only establish the security of the cryptographic primitives, but also give a computational complexity perspective.For example, one can identify the minimal assumption on which cryptographic systems can be based.The existence of one-way functions is considered a minimal assumption in cryptography.In other words, the existence of one-way functions is essential for the existence of any cryptographic primitive.A function f is said to be one-way if, given f (x), it is computationally infeasible to efficiently recover a corresponding preimage.While one-wayness is a minimal assumption, it is also known to suffice for deriving important cryptographic primitives such as symmetric-key encryption and digital signatures.Cryptographic primitives can thus be divided into those that can be derived from one-way functions and those that cannot.Cryptographic primitives that can be derived from one-way functions are referred to as Minicrypt.In this way, one-way functions play a central role in providing a hierarchical understanding of modern cryptographic theory.When quantum communication and computation are incorporated into cryptographic protocols, it becomes possible to derive a broader class of cryptographic primitives from one-way functions.For example, while there is evidence that public-key encryption cannot be constructed from one-way functions alone in the classical setting, recent works have shown that quantum public-key encryption can be constructed from one-way functions when quantum communication channels are available.Thus, even without altering the classical boundaries, incorporating quantum communication and computation leaves ample room for phenomena that differ from those observed in the classical setting.The class of cryptographic primitives that can be constructed from one-way functions, assuming quantum computation and communication, is referred to as MiniQCrypt.As quantum technologies continue to advance and the realization of quantum communication and quantum computers becomes increasingly plausible, the study of one-way functions must be revisited and discussed within these quantum frameworks.We identify two main challenges in this area.The first challenge is to generalize the quantum reduction from one-wayness to unpredictability.The classical reduction from onewayness to unpredictability, known as the Goldreich-Levin theorem, is not only fundamental in cryptography but also plays an important role in computational complexity theory.A quantum analogue of this theorem was established by Adcock and Cleve.However, whether the quantum Goldreich-Levin theorem holds not only in the binary setting but also over more general domains such as Z q remains a nontrivial open problem.The second challenge i
摘 要:信息不对称是现代经济学解释市场失灵、契约设计、金融摩擦、逆向选择与道德风险的核心理论基石。经典信息不对称模型建立在知识离散二分、状态确定唯一、概率经典可加、信息静态外生与观测中立的经典世界观之上,将信息差异定义为“知道”与“不知道”的二元鸿沟,无法刻画现实中普遍存在的信念模糊、预期叠加、信息干涉、信心差异与观测改变信息结构等深层信息特征。本文严格立足于经济主体信息处理的本体逻辑,规避物理隐喻类比,引入量子叠加、量子相干、观测坍缩与量子信息熵构造公理体系,对经典信息不对称理论进行范式升级,构建一般性的量子信息不对称理论(Quantum Information Asymmetry,QIA)。本文严格证明,经典信息不对称是量子信息不对称在无叠加、无相干、无信念冲突与观测中立条件下的退化特例;通过推导量子信息不对称的数学结构、测度公式与均衡特征,系统阐释信息叠加、信念相干、观测坍缩与熵差演化四大微观作用机制。结合信贷市场、股票市场、委托—代理关系与政策传导等典型场景开展数值模拟分析,结果表明:量子信息不对称能够统一刻画信念混乱度差异、预期干涉效应、信息透明度内生与观测驱动信息跃迁等经典理论难以系统容纳的信息结构。本研究完善了信息经济学的基础公理体系,为契约理论、金融中介、公司治理、市场监管与宏观政策传导提供全新的基础性分析范式。 关键词:量子信息不对称;逆向选择;道德风险;信念叠加;观测坍缩;契约理论
Quantum secret sharing (QSS), an important branch of quantum communication, is the generalization of classical secret sharing into quantum scenario. The secret messages are split into several parts, and each part is distributed to a separate party so that no action of a subset of all the parties without the cooperation of the entire group is able to read out the secret messages. In this paper, a quantum state sharing protocol is proposed by using entanglement swapping and random EPR selection. The EPR pairs of Bell-state measurement are selected randomly by the sender Alice, which can improve the security of the scheme and raise probability of detecting Eve to 95.8%. In addition, difference coding is used in this protocol to achieve a high efficiency. The security of the present multiparty QSS against eavesdropping has been analyzed. It is convenient in application as it require only two qubit entanglements, one measuring-basis and two-qubit joint measurements, not GHZ states, for sharing an arbitrary secret two-qubit state.