Proceedings of CRYPTO 84 on Advances in cryptology
The input/output complexity of sorting and related problems
Communications of the ACM
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Communication complexity of secure computation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Communications of the ACM
Privacy Preserving Data Mining
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Privacy-preserving distributed k-means clustering over arbitrarily partitioned data
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Optimally efficient multi-valued byzantine agreement
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
A practical scheme for non-interactive verifiable secret sharing
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Atomic Secure Multi-party Multiplication with Low Communication
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Perfectly-secure MPC with linear communication complexity
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Randomized Shellsort: a simple oblivious sorting algorithm
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
TCC'06 Proceedings of the Third conference on Theory of Cryptography
| Hi-index | 0.00 |
We consider a setting where a set of n players use a set of m servers to store a large, private data set. Later the players decide on functions they want to compute on the data without the servers needing to know which computation is done, while the computation should be secure against a malicious adversary corrupting a constant fraction of the players and servers. Using packed secret sharing, the data can be stored in a compact way but will only be accessible in a block-wise fashion. We explore the possibility of using I/O-efficient algorithms to nevertheless compute on the data as efficiently as if random access was possible. We show that for sorting, priority queues and data mining, this can indeed be done. We show actively secure protocols of complexity within a constant factor of the passively secure solution. As a technical contribution towards this goal, we develop techniques for generating values of form r, gr for random secret-shared r∈ℤq and gr in a group of order q. This costs a constant number of exponentiation per player per value generated, even if less than n/3 players are malicious. This can be used for efficient distributed computing of Schnorr signatures. We further develop the technique so we can sign secret data in a distributed fashion at essentially the same cost.