1,639 research outputs found
Experimentally Feasible Security Check for n-qubit Quantum Secret Sharing
In this article we present a general security strategy for quantum secret
sharing (QSS) protocols based on the HBB scheme presented by Hillery, Bu\v{z}ek
and Berthiaume [Phys. Rev A \textbf{59}, 1829 (1999)]. We focus on a
generalization of the HBB protocol to communication parties thus including
-partite GHZ states. We show that the multipartite version of the HBB scheme
is insecure in certain settings and impractical when going to large . To
provide security for such QSS schemes in general we use the framework presented
by some of the authors [M. Huber, F. Minert, A. Gabriel, B. C. Hiesmayr, Phys.
Rev. Lett. \textbf{104}, 210501 (2010)] to detect certain genuine partite
entanglement between the communication parties. In particular, we present a
simple inequality which tests the security.Comment: 5 pages, submitted to Phys. Rev.
Disjoint difference families and their applications
Difference sets and their generalisations to difference families arise from the study of designs and many other applications. Here we give a brief survey of some of these applications, noting in particular the diverse definitions of difference families and the variations in priorities in constructions. We propose a definition of disjoint difference families that encompasses these variations and allows a comparison of the similarities and disparities. We then focus on two constructions of disjoint difference families arising from frequency hopping sequences and showed that they are in fact the same. We conclude with a discussion of the notion of equivalence for frequency hopping sequences and for disjoint difference families
Efficient Threshold Secret Sharing Schemes Secure against Rushing Cheaters
In this paper, we consider three very important issues namely detection, identification and robustness of -out-of- secret sharing schemes against rushing cheaters who are allowed to submit (possibly forged) shares {\em after} observing shares of the honest users in the reconstruction phase. Towards this we present five different schemes. Among these, first we present two -out-of- secret sharing schemes, the first one being capable of detecting cheaters such that and the second one being capable of detecting cheaters such that , where denotes the set of all possible secrets, denotes the successful cheating probability of cheaters and denotes set all possible shares. Next we present two -out-of- secret sharing schemes, the first one being capable of identifying rushing cheaters with share size that satisfies . This is the first scheme whose size of shares does not grow linearly with but only with , where is the number of participants. For the second one, in the setting of public cheater identification, we present an efficient optimal cheater resilient -out-of- secret sharing scheme against rushing cheaters having the share size . The proposed scheme achieves {\em flexibility} in the sense that the security level (i.e. the cheater(s) success probability) is independent of the secret size. Finally, we design an efficient robust secret sharing secure against rushing adversary with optimal cheater resiliency.
Each of the five proposed schemes has the smallest share size having the mentioned properties among the existing schemes in the respective fields
An Efficient -Cheater Identifiable Secret Sharing Scheme with Optimal Cheater Resiliency
In this paper, we present an efficient -out-of- secret sharing scheme, which can identify up to rushing cheaters, with probability at least , where , provided . This is the optimal number of cheaters that can be tolerated in the setting of public cheater identification, on which we focus in this work. In our scheme, the set of all possible shares satisfies the condition that , where denotes the set of all possible secrets. In PODC-2012, Ashish Choudhury came up with an efficient -cheater identifiable -out-of- secret sharing scheme, which was a solution of an open problem proposed by Satoshi Obana in EUROCRYPT-2011. The share size, with respect to a secret consisting of one field element, of Choudhury\u27s proposal in PODC-2012 is . Therefore, our scheme presents an improvement in share size over the above construction. Hence, to the best of our knowledge, our proposal currently has the minimal share size among existing efficient schemes with optimal cheater resilience, in the case of a single secret
計算コストの小さい準最適な不正検知可能秘密分散法
A cheating detectable secret sharing scheme is a secret sharing scheme that can detect forged shares in reconstructing a secret. For example, if we store shares in cloud storage, there is a possibility of it being forged. If the administrators of cloud storage are malicious, it is easy for them to forge a share. Therefore, cheating detectable secretsharing schemes have attracted attention, and many efficient schemes have been proposed. However, most existing schemes are not suitable for implementation. The reasons are as follows. First, the computational cost ofthe schemes is very high. Second, the required finite field for implementation depends on the secret. Finally, the schemes do not support secrets that are bit strings.In this paper, we propose a cheating detectable secret sharing scheme suitable for implementation. However, we assume that cheaters do not know the secret. The basicidea is a bit-decomposing technique. The bit length of the proposed scheme is an optimum. Moreover, the proposed scheme is applicable to any linear secret sharing schemes
- …