Fourier-based Function Secret Sharing with General Access Structure

Function secret sharing (FSS) scheme is a mechanism that calculates a function f(x) for x in {0,1}^n which is shared among p parties, by using distributed functions f_i:{0,1}^n -> G, where G is an Abelian group, while the function f:{0,1}^n -> G is kept secret to the parties. Ohsawa et al. in 2017 observed that any function f can be described as a linear combination of the basis functions by regarding the function space as a vector space of dimension 2^n and gave new FSS schemes based on the Fourier basis. All existing FSS schemes are of (p,p)-threshold type. That is, to compute f(x), we have to collect f_i(x) for all the distributed functions. In this paper, as in the secret sharing schemes, we consider FSS schemes with any general access structure. To do this, we observe that Fourier-based FSS schemes by Ohsawa et al. are compatible with linear secret sharing scheme. By incorporating the techniques of linear secret sharing with any general access structure into the Fourier-based FSS schemes, we show Fourier-based FSS schemes with any general access structure.Comment: 12 page

Multi-party Quantum Computation

We investigate definitions of and protocols for multi-party quantum computing in the scenario where the secret data are quantum systems. We work in the quantum information-theoretic model, where no assumptions are made on the computational power of the adversary. For the slightly weaker task of verifiable quantum secret sharing, we give a protocol which tolerates any t < n/4 cheating parties (out of n). This is shown to be optimal. We use this new tool to establish that any multi-party quantum computation can be securely performed as long as the number of dishonest players is less than n/6.Comment: Masters Thesis. Based on Joint work with Claude Crepeau and Daniel Gottesman. Full version is in preparatio

Generalized parity measurements

Measurements play an important role in quantum computing (QC), by either providing the nonlinearity required for two-qubit gates (linear optics QC), or by implementing a quantum algorithm using single-qubit measurements on a highly entangled initial state (cluster state QC). Parity measurements can be used as building blocks for preparing arbitrary stabilizer states, and, together with 1-qubit gates are universal for quantum computing. Here we generalize parity gates by using a higher dimensional (qudit) ancilla. This enables us to go beyond the stabilizer/graph state formalism and prepare other types of multi-particle entangled states. The generalized parity module introduced here can prepare in one-shot, heralded by the outcome of the ancilla, a large class of entangled states, including GHZ_n, W_n, Dicke states D_{n,k}, and, more generally, certain sums of Dicke states, like G_n states used in secret sharing. For W_n states it provides an exponential gain compared to linear optics based methods.Comment: 7 pages, 1 fig; updated to the published versio