37,811 research outputs found
Some Directions beyond Traditional Quantum Secret Sharing
We investigate two directions beyond the traditional quantum secret sharing
(QSS). First, a restriction on QSS that comes from the no-cloning theorem is
that any pair of authorized sets in an access structure should overlap. From
the viewpoint of application, this places an unnatural constraint on secret
sharing. We present a generalization, called assisted QSS (AQSS), where access
structures without pairwise overlap of authorized sets is permissible, provided
some shares are withheld by the share dealer. We show that no more than
withheld shares are required, where is the minimum number
of {\em partially linked classes} among the authorized sets for the QSS. Our
result means that such applications of QSS need not be thwarted by the
no-cloning theorem. Secondly, we point out a way of combining the features of
QSS and quantum key distribution (QKD) for applications where a classical
information is shared by quantum means. We observe that in such case, it is
often possible to reduce the security proof of QSS to that of QKD.Comment: To appear in Physica Scripta, 7 pages, 1 figure, subsumes
arXiv:quant-ph/040720
Secret charing vs. encryption-based techniques for privacy preserving data mining
Privacy preserving querying and data publishing has been studied in the context of statistical databases and statistical disclosure control. Recently, large-scale data collection and integration efforts increased privacy concerns which motivated data mining researchers to investigate privacy implications of data mining and how data mining can be performed without violating privacy. In this paper, we first provide an overview of privacy preserving data mining focusing on distributed data sources, then we compare two technologies used in privacy preserving data mining. The first technology is encryption based, and it is used in earlier approaches. The second technology is secret-sharing which is recently being considered as a more efficient approach
Almost-perfect secret sharing
Splitting a secret s between several participants, we generate (for each
value of s) shares for all participants. The goal: authorized groups of
participants should be able to reconstruct the secret but forbidden ones get no
information about it. In this paper we introduce several notions of non-
perfect secret sharing, where some small information leak is permitted. We
study its relation to the Kolmogorov complexity version of secret sharing
(establishing some connection in both directions) and the effects of changing
the secret size (showing that we can decrease the size of the secret and the
information leak at the same time).Comment: Acknowledgments adde
Conference Key Agreement and Quantum Sharing of Classical Secrets with Noisy GHZ States
We propose a wide class of distillation schemes for multi-partite entangled
states that are CSS-states. Our proposal provides not only superior efficiency,
but also new insights on the connection between CSS-states and bipartite graph
states. We then consider the applications of our distillation schemes for two
cryptographic tasks--namely, (a) conference key agreement and (b) quantum
sharing of classical secrets. In particular, we construct
``prepare-and-measure'' protocols. Also we study the yield of those protocols
and the threshold value of the fidelity above which the protocols can function
securely. Surprisingly, our protocols will function securely even when the
initial state does not violate the standard Bell-inequalities for GHZ states.
Experimental realization involving only bi-partite entanglement is also
suggested.Comment: 5 pages, to appear in Proc. 2005 IEEE International Symposium on
Information Theory (ISIT 2005, Adelaide, Australia
- …