Enhancement of GAO's Multiparty Quantum SecretSharing

A multiparty quantum secret sharing (MQSS) protocol with two-photon three-dimensional Bell states was proposed by Gao [Commun. Theor. Phys.52 (2009) 421] recently. This study points out that the performance of Gao's protocol can be much improved by using the technique of decoy single photons
and carefully modifying the protocol to remove some unnecessary unitary operations, devices, and transmissions.     

Proof of the insecurity of quantum secret sharing based on the Smolin bound entangled states

This paper reconsiders carefully the possibility of using the Smolin bound entangled states as the carrier for sharing quantum secret. It finds that the process of quantum secret sharing based on Smolin states has insecurity though the Smolin state was reported to violate maximally the two-setting Bell-inequality. The general proof is given.     

Enhancing the security of quantum secret sharing against multiphoton attack

It is generally believed that nonorthogonal operations which can realize the state transformation between two nonorthogonal bases may ensure the security of many quantum communication protocols. However, in this paper, we present a powerful attack against quantum secret sharing protocols of these kinds. Applying entangled photons as fake signals, Eve can successfully steal the exact information without being revealed. We also give our effective modification to improve it. Under the suggested checking strategy, even to Eve's most general attack, it is robust and secure.     

Quantum state sharing using linear optical elements

Motivated by protocols [G. Gordon, G. Rigolin, Phys. Rev. A 73 (2006) 062316] and [N.B. An, G. Mahler, Phys. Lett. A 365 (2007) 70], we propose a linear optical protocol for quantum state sharing of polarization entangled state in terms optical elements. Our protocol can realize a near-complete quantum state sharing of polarization entangled state with arbitrary coefficients, and it is possible to achieve unity fidelity transfer of the state if the parties collaborate. This protocol can also be generalized to the multi-party system.     

Quantum Secret Sharing with Error Correction

We investigate in this work a quantum error correction on a five-qubits graph state used for secret sharing through five noisy channels. We describe the procedure for the five, seven and nine qubits codes. It is known that the three codes always allow error recovery if only one among the sent qubits is disturbed in the transmitting channel. However, if two qubits and more are disturbed, then the correction will depend on the used code. We compare in this paper the three codes by computing the average fidelity between the sent secret and that measured by the receivers. We will treat the case where, at most, two qubits are affected in each one of five depolarizing channels.     

AKTA蛋白纯化系统的开放共享与维护管理

AKTA蛋白纯化系统广泛应用于高校教学和科研实验室的蛋白质纯化以及药物开发研究,是蛋白质、多肽和核酸及天然产物最有效的纯化手段.结合多年的大型仪器管理经验,探讨了AKTA蛋白纯化系统的开放共享管理和维护保养经验及故障排除方法,旨在提高AKTA蛋白纯化系统的使用效率,并延长其使用寿命,更好的服务于教学和科研工作.     

Tripartite Arbitrary Two-Qutrit Quantum State Sharing

A tripartite scheme for securely sharing an arbitrary unknown two-qutrit state is proposed, where two generalized Greenberger-Horne-Zeilinger （GHZ） states serve as the quantum channel linking the three legitimate parties. The quantum information （i.e., the arbitrary unknown two-qutrit state） from the sender can be split in such a way that it can be reconstructed deterministically by any agent via a proper unitary operation provided that both agents collaborates together. Moreover, the generalization of the tripartite scheme to more-party case is also outlined.     

Remote Three-Party Quantum State Sharing Based on Three-Atom Entangled States Assisted by Cavity QED and Flying Qubits

We present a remote three-party quantum state sharing (QSTS) schemewith three-atom Greenberger-Horne-Zeilinger (GHZ) states assisted bycavity QED and flying qubits. It exploits some photons to act as the flying qubits for setting up the quantum channel securely with three-atom systems in a GHZ state, which maybe make this remote QSTS scheme more practical than some other schemes based on atom systems only or ion-trap systems as photons interact with their environments weakly. The coherence of the stationary atom qubits in cavities provides the convenience for the parties in QSTS to check eavesdropping, different from entangled photon systems. Moreover, the present scheme works in a collective-noise condition and it may be more practical than others in applications in future.     

Two Approaches to the Problem of Sharing Delay Costs in Joint Projects

This paper concentrates on cost sharing situations which arise when delayed joint projects involve joint delay costs. The problem here is to determine fair shares for each of the agents who contribute to the delay of the project such that the total delay cost is cleared. We focus on the evaluation of the responsibility of each agent in delaying the project based on the activity graph representation of the project and then on solving the important problem of the delay cost sharing among the agents involved. Two approaches, both rooted in cooperative game theory methods are presented as possible solutions. In the first approach delay cost sharing rules are introduced which are based on the delay of the project and on the individual delays of the agents who perform activities. This approach is inspired by the bankruptcy and taxation literature and leads to five rules: the (truncated) proportional rule, the (truncated) constrained equal reduction rule and the constrained equal contribution rule. By introducing two coalitional games related to delay cost sharing problems, which we call the pessimistic delay game and the optimistic delay game, also game theoretical solutions as the Shapley value, the nucleolus and the -value generate delay cost sharing rules. In the second approach the delays of the relevant paths in the activity graph together with the delay of the project play a role. A two-stage solution is proposed. The first stage can be seen as a game between paths, where the delay cost of the project has to be allocated to the paths. Here serial cost sharing methods play a role. In the second stage the allocated costs of each path are divided proportionally to the individual delays among the activities in the path.     

Secret sharing schemes with partial broadcast channels

In a conventional secret sharing scheme a dealer uses secure point-to-point channels to distribute the shares of a secret to a number of participants. At a later stage an authorised group of participants send their shares through secure point-to-point channels to a combiner who will reconstruct the secret. In this paper, we assume no point-to-point channel exists and communication is only through partial broadcast channels. A partial broadcast channel is a point-to-multipoint channel that enables a sender to send the same message simultaneously and privately to a fixed subset of receivers. We study secret sharing schemes with partial broadcast channels, called partial broadcast secret sharing schemes. We show that a necessary and sufficient condition for the partial broadcast channel allocation of a (t, n)-threshold partial secret sharing scheme is equivalent to a combinatorial object called a cover-free family. We use this property to construct a (t, n)-threshold partial broadcast secret sharing scheme with O(log n) partial broadcast channels. This is a significant reduction compared to n point-to-point channels required in a conventional secret sharing scheme. Next, we consider communication rate of a partial broadcast secret sharing scheme defined as the ratio of the secret size to the total size of messages sent by the dealer. We show that the communication rate of a partial broadcast secret sharing scheme can approach 1/O(log n) which is a significant increase over the corresponding value, 1/n, in the conventional secret sharing schemes. We derive a lower bound on the communication rate and show that for a (t,n)-threshold partial broadcast secret sharing scheme the rate is at least 1/t and then we propose constructions with high communication rates. We also present the case of partial broadcast secret sharing schemes for general access structures, discuss possible extensions of this work and propose a number of open problems.