CryptoDB
An efficient way to access an array at a secret index
| Authors: | |
|---|---|
| Download: | |
| Abstract: | We propose cryptographic primitives for reading and assigning the (shared) secret found at a secret index in a vector of secrets. The problem can also be solved in constant round with existing general techniques based on arithmetic circuits and the ``equality test'' in [Damgard.et.al 05]. However the proposed technique requires to exchange less bits. The proposed primitives require a number of rounds that is independent of the size N of the vector, and only depends (linearly) on the number t of computing servers. A previously known primitive for reading a vector at a secret index works only for 2-party computations. Our primitives work for any number of computing participants/servers. The proposed techniques are secure against passive attackers, and zero knowledge proofs are provided to show that exactly one index of the array is read/written. The techniques work both with multiparty computations based on secret sharing and with multiparty computations based on threshold homomorphic encryption. |
BibTeX
@misc{eprint-2006-21650,
title={An efficient way to access an array at a secret index},
booktitle={IACR Eprint archive},
keywords={cryptographic protocols /},
url={http://eprint.iacr.org/2006/157},
note={ msilaghi@fit.edu 13287 received 25 Apr 2006, last revised 19 May 2006},
author={Timothy Atkinson and Marius C. Silaghi},
year=2006
}