On the Download Rate of Homomorphic Secret Sharing

A homomorphic secret sharing (HSS) scheme is a secret sharing scheme that supports evaluating functions on shared secrets by means of a local mapping from input shares to output shares. We initiate the study of the download rate of HSS, namely, the achievable ratio between the length of the output shares and the output length when amortized over $\ell$ function evaluations. We obtain the following results. * In the case of linear information-theoretic HSS schemes for degree-$d$ multivariate polynomials, we characterize the optimal download rate in terms of the optimal minimal distance of a linear code with related parameters. We further show that for sufficiently large $\ell$ (polynomial in all problem parameters), the optimal rate can be realized using Shamir's scheme, even with secrets over $\mathbb{F}_2$. * We present a general rate-amplification technique for HSS that improves the download rate at the cost of requiring more shares. As a corollary, we get high-rate variants of computationally secure HSS schemes and efficient private information retrieval protocols from the literature. * We show that, in some cases, one can beat the best download rate of linear HSS by allowing nonlinear output reconstruction and $2^{-\Omega(\ell)}$ error probability

On alternative approach for verifiable secret sharing

Secret sharing allows split/distributed control over the secret (e.g. master key). Verifiable secret sharing (VSS) is the secret sharing extended by verification capacity. Usually verification comes at the price. We propose "free lunch", the approach that allows to overcome this inconvenience.Comment: This is poster that was presented on ESORICS2002 conference in Zurich. It consists of 4 color pages, with proposal and flowchart

On the Duality of Probing and Fault Attacks

In this work we investigate the problem of simultaneous privacy and integrity protection in cryptographic circuits. We consider a white-box scenario with a powerful, yet limited attacker. A concise metric for the level of probing and fault security is introduced, which is directly related to the capabilities of a realistic attacker. In order to investigate the interrelation of probing and fault security we introduce a common mathematical framework based on the formalism of information and coding theory. The framework unifies the known linear masking schemes. We proof a central theorem about the properties of linear codes which leads to optimal secret sharing schemes. These schemes provide the lower bound for the number of masks needed to counteract an attacker with a given strength. The new formalism reveals an intriguing duality principle between the problems of probing and fault security, and provides a unified view on privacy and integrity protection using error detecting codes. Finally, we introduce a new class of linear tamper-resistant codes. These are eligible to preserve security against an attacker mounting simultaneous probing and fault attacks

Quantum data hiding with spontaneous parameter down-conversion

Here we analyze the practical implication of the existing quantum data hiding protocol with Bell states produced with optical downconverter. We show that the uncertainty for the producing of the Bell states with spontaneous parameter down-conversion should be taken into account, because it will cause serious trouble to the hider encoding procedure. A set of extended Bell states and a generalized Bell states analyzer are proposed to describe and analyze the possible states of two photons distributing in two paths. Then we present a method to integrate the above uncertainty of Bell states preparation into the dating hiding procedure, when we encode the secret with the set of extended Bell states. These modifications greatly simplify the hider's encoding operations, and thus paves the way for the implementation of quantum data hiding with present-day quantum optics.Comment: 4 pages, 1 figure, adding some analyse for security proof, to be appear in Phys. Rev.