一种分布式可验证的多秘密共享方案

本文给出了一个在分布式环境下可验证的多秘密共享方案(VMSS)。在以往的多秘密共享方案中一般都是要有一个被称为庄家或秘密分发者(Dealer)的参与才能实现多个秘密的共享,但是在现实的应用中很多情况下都要求秘密共享方案是在无庄家(Dealer)参与下的分布式运算方案,并且要具备一定的防欺骗功能。本文基于Asmuth-Bloom门限方案就给出了这么一种在分布式计算的环境下可验证的多秘密共享方案。

Multiparty Quantum Secret Sharing Using Two-Photon Three-Dimensional Bell States

We present a two-photon three-dimensional multiparty quantum secret sharing scheme.The secret messagesare encoded by performing local operations.This is different from those quantum secret sharing protocols that all sharersmust make a state measurement.The merit of our protocol is the high capacity.

Improved Multipartite Quantum Secret Sharing Protocol Using Preshared Greenberger-Horne-Zeilinger States

Inspired by the protocol presented by Bagherinezhad and Karimipour[Phys.Rev.A 67(2003) 044302], which will be shown to be insecure,we present a multipartite quantum secret sharing protocol using reusable GreenbergerHorne -Zeilinger(GHZ) states.This protocol is robust against eavesdropping and could be used for the circumstance of many parties.

Quantum Secret Sharing Using GHZ-Like State

This paper presents a simple and novel quantum secret sharing scheme using GHZ-like state. The characteristics of the GHZ-like state are used to develop the quantum secret sharing scheme. In contrast with the other GHZ-based QSS protocols with the same assumptions, the proposed protocol provides the best quantum bit efficiency.

Quantum Secret Sharing Based on Chinese Remainder Theorem

A novel quantum secret sharing （QSS） scheme is proposed on the basis of Chinese Remainder Theorem （CRT）. In the scheme, the classical messages are mapped to secret sequences according to CRT equations, and distributed to different receivers by different dimensional superdense-coding respectively. CRT＇s secret sharing function, together with high-dimensional superdense-eoding, provide convenience, security, and large capability quantum channel for secret distribution and recovering. Analysis shows the security of the scheme.

Multiparty Quantum Secret Sharing Using Quantum Fourier Transform

A （n, n）-threshold scheme of multiparty quantum secret sharing of classical or quantum message is proposed based on the discrete quantum Fourier transform. In our proposed scheme, the secret message, which is encoded by using the forward quantum Fourier transform and decoded by using the reverse, is split and shared in such a way that it can be reconstructed among them only if all the participants work in concert. Fhrthermore, we also discuss how this protocol must be carefully designed for correcting errors and checking eavesdropping or a dishonest participant. Security analysis shows that our scheme is secure. Also, this scheme has an advantage that it is completely compatible with quantum computation and easier to realize in the distributed quantum secure computation.

Universal Three-Party Quantum Secret Sharing Against Collective Noise

we present a robust and universal quantum secret sharing protocol with four-qubit decoherence-free （DF） states against collective noise. The transmission＇s safety is ensured by the nonorthogonality of the noiseless states traveling on the quantum channel. Although this scheme uses entangled states for encoding, only single-particle product measurements are required.

Enhancement of GAO's Multiparty Quantum Secret Sharing

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.

Multiparty Quantum Secret Sharing via Introducing Auxiliary Particles Using a Pure Entangled State

We propose a new multiparty quantum secret sharing protocol via introducing auxiliary particles using a non-maximally entangled （pure） two-particle state without a Bell measurement. The communication parties utilize decoy particles tO check eavesdropping. After ensuring the security of the quantum channel, the sender encodes the secret message and transmits it to the receiver by using controlled-NOT operation and von Neumann measurement. If and only if all the agents agree to collaborate, they can read out the secret message.

Privacy-preserving Distributed Location Proof Generating System

The rapid development of location-based service(LBS) drives one special kind of LBS, in which the service provider verifies user location before providing services. In distributed location proof generating schemes, preventing users from colluding with each other to create fake location proofs and protecting user's location privacy at the same time, are the main technical challenges to bring this kind of LBS into practical. Existing solutions tackle these challenges with low collusion-detecting efficiency and defected collusion-detecting method. We proposed two novel location proof generating schemes, which inversely utilized a secure secret-sharing scheme and a pseudonym scheme to settle these shortcomings. Our proposed solution resists and detects user collusion attacks in a more efficient and correct way. Meanwhile, we achieve a higher level of location privacy than that of previous work. The correctness and efficiency of our proposed solution is testified by intensive security analysis, performance analysis, as well as experiments and simulation results.

Constructions of Cheating Immune Secret Sharing Functions

Based on the relationship between cheating immune secret sharing and cryptographic criteria of Boolean functions, to design a cheating immune secret sharing scheme, a 1-resilient function satisfying the strict avalanche criterion （SAC） is needed. In this paper, a technique on constructing a cheating immune secret sharing function is studied. By using Maiorana-McFarland construction technique, two new methods to construct cheating immune secret sharing functions are proposed.

Quantum-Dot Spin-Based Secret Sharing in an Optical Microcavity

Two schemes of quantum secret sharing are proposed via single electron spin confined in charged QDs inside a single-sided microcavity and a double-sided microcavity, respectively. Both schemes rely on coherent photonspin interaction. The two schemes axe both deterministic and can be extended to multipartite secret sharing.

Scheme for Quantum Dense Coding with Secret Sharing in Cavity QED

Quantum dense coding （QDC） is a process originally proposed to send two classical bits information from a sender to a receiver by sending only one qubit. Our scheme of QDC is proposed following some ideas on secret sharing with entanglement in cavity QED. Based on the theory of secret sharing the QDC process can be more secure.

Robust Multiparty Quantum Secret Sharing against Participant Forcible Manipulation

The security of the multiparty quantum secret sharing protocol proposed by Gao [G.Gao,Commun.Theor.Phys.52 (2009) 421] is analyzed.It is shown that this protocol is vulnerable since the agents' imperfectencryption scheme can be attacked by a powerful participant.We introduce a attack strategy called participant forciblemanipulation and analyze the information leakage in this protocol under this attack.At last,we give an improved versionof the original protocol.The improved protocol is robust and has the same efficiency as the original one.

Reexamining Security of Improved Multiparty Quantum Secret Splitting and Quantum State Sharing

In a recent letter [H.F. Wang, X. Ji, and S. Zhang, Phys. Lett. A 358 （2006） 11], an improvement of the multiparty quantum secret splitting and quantum state sharing protocol [F.G. Deng, et al., Phys. Lett. A 354 （2006） 190.] was presented. We study the security of the improved protocol and find that two or more dishonest participants may recover the secret from the dealer. Hence we further modify the improved protocol, which make it stand against this kind of attack.

Binary Cyclic Codes and Minimal Codewords

Cyclic codes form an important class of codes. They have very interesting algebraic structure. Furthermore, they are equivalent to many important codes, such as binary Hamming codes, Golay codes and BCH codes. Minimal codewords in linear codes are widely used in constructing decoding algorithms and studying linear secret sharing scheme. In this paper, we show that in the binary cyclic code all of the codewords are minimal, except 0 and 1. Then, we obtain a result about the number of minimal codewords in the binary cyclic codes.

Some Secret Sharing Schemes Based on the Finite Fields

A （t, n）--secret sharing scheme is a method of distribution of information among n participants such that t 〉 1 can reconstruct the secret but （t - 1） cannot. We explore some （k, n）--secret sharing schemes based on the finite fields.

Secret Sharing Schemes Based on the Dual Code of the Code of a Symmetric （v, k, λ）-Design and Minimal Access Sets

Secret sharing has been a subject of study for over 30 years. The coding theory has been an important role in the constructing of the secret sharing schemes. It is known that every linear code can be used to construct the secret sharing schemes. Since the code of a symmetric （V, k, λ）-design is a linear code, this study is about the secret sharing schemes based on C of Fp-code C of asymmetric （v, k, λ）-design.

A New Method to Construct Secret Sharing Schemes Based on Linear Codes

Secret sharing is an important topic in cryptography and has applications in information security. The coding theory has been an important role in the constructing of secret sharing schemes. It is known that every linear code can be used to construct secret sharing schemes. So, we use the parity-check matrix of a linear code to construct secret sharing schemes based on linear codes. We also describe some techniques to recover the secret and determine the access structure of the new scheme. In this paper, we use the Massey＇s secret sharing scheme.

A Verifiable Multi-Secret Sharing Scheme Based on Hermite Interpolation

A threshold scheme, which is introduced by Shamir in 1979, is very famous as a secret sharing scheme. We can consider that this scheme is based on Lagrange＇s interpolation formula. A secret sharing scheme has one key. On the other hand, a multi-secret sharing scheme has more than one key, that is, a multi-secret sharing scheme has p （〉_ 2） keys. Dealer distribute shares of keys among n participants. Gathering t （〈 n） participants, keys can be reconstructed. Yang et al. （2004） gave a scheme of a （t, n） multi-secret sharing based on Lagrange＇s interpolation. Zhao et al. （2007） gave a scheme of a （t, n） verifiable multi-secret sharing based on Lagrange＇s interpolation. Recently, Adachi and Okazaki give a scheme of a （t, n） multi-secret sharing based on Hermite interpolation, in the case ofp 〈 t. In this paper, we give a scheme ofa （t, n） verifiable multi-secret sharing based on Hermite interpolation.