TY - GEN
T1 - Towards efficient private distributed computation on unbounded input streams (extended abstract)
AU - Dolev, Shlomi
AU - Garay, Juan
AU - Gilboa, Niv
AU - Kolesnikov, Vladimir
AU - Yuditsky, Yelena
N1 - Funding Information:
This research has been supported by the Israeli Ministry of Science and Technology (MOST), the Institute for Future Defense Technologies Research named for the Medvedi, Shwartzman and Gensler Families, the Israel Internet Association (ISOC-IL), the Lynne and William Frankel Center for Computer Science at Ben-Gurion University, Rita Altura Trust Chair in Computer Science, Israel Science Foundation (grant number 428/11), Cabarnit Cyber Security MAGNET Consortium, MAFAT and Deutsche Telekom Labs at BGU.
PY - 2013/7/12
Y1 - 2013/7/12
N2 - In the problem of private "swarm" computing, n agents wish to securely and distributively perform a computation on common inputs, in such a way that even if the entire memory contents of some of them are exposed, no information is revealed about the state of the computation. Recently, Dolev, Garay, Gilboa and Kolesnikov [ICS 2011] considered this problem in the setting of information-theoretic security, showing how to perform such computations on input streams of unbounded length. The cost of their solution, however, is exponential in the size of the Finite State Automaton (FSA) computing the function. In this work we are interested in efficient (i.e., polynomial time) computation in the above model, at the expense of minimal additional assumptions. Relying on the existence of one-way functions, we show how to process unbounded inputs (but of course, polynomial in the security parameter) at a cost linear in m, the number of FSA states. In particular, our algorithms achieve the following: - In the case of (n,n)-reconstruction (i.e., in which all n agents participate in the reconstruction of the distributed computation) and at most n - 1 agents are corrupted, the agent storage, the time required to process each input symbol, and the time complexity for reconstruction are all O(mn). - In the case of (n - t,n)-reconstruction (where only n - t agents take part in the reconstruction) and at most t agents are corrupted, the agents' storage and time required to process each input symbol are O(m( n-tn-1)). The complexity of reconstruction is O(mt). We achieve the above through a carefully orchestrated use of pseudo-random generators and secret-sharing, and in particular a novel share re-randomization technique which might be of independent interest.
AB - In the problem of private "swarm" computing, n agents wish to securely and distributively perform a computation on common inputs, in such a way that even if the entire memory contents of some of them are exposed, no information is revealed about the state of the computation. Recently, Dolev, Garay, Gilboa and Kolesnikov [ICS 2011] considered this problem in the setting of information-theoretic security, showing how to perform such computations on input streams of unbounded length. The cost of their solution, however, is exponential in the size of the Finite State Automaton (FSA) computing the function. In this work we are interested in efficient (i.e., polynomial time) computation in the above model, at the expense of minimal additional assumptions. Relying on the existence of one-way functions, we show how to process unbounded inputs (but of course, polynomial in the security parameter) at a cost linear in m, the number of FSA states. In particular, our algorithms achieve the following: - In the case of (n,n)-reconstruction (i.e., in which all n agents participate in the reconstruction of the distributed computation) and at most n - 1 agents are corrupted, the agent storage, the time required to process each input symbol, and the time complexity for reconstruction are all O(mn). - In the case of (n - t,n)-reconstruction (where only n - t agents take part in the reconstruction) and at most t agents are corrupted, the agents' storage and time required to process each input symbol are O(m( n-tn-1)). The complexity of reconstruction is O(mt). We achieve the above through a carefully orchestrated use of pseudo-random generators and secret-sharing, and in particular a novel share re-randomization technique which might be of independent interest.
UR - http://www.scopus.com/inward/record.url?scp=84879858211&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-38980-1_5
DO - 10.1007/978-3-642-38980-1_5
M3 - Conference contribution
AN - SCOPUS:84879858211
SN - 9783642389795
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 69
EP - 83
BT - Applied Cryptography and Network Security - 11th International Conference, ACNS 2013, Proceedings
T2 - 11th International Conference on Applied Cryptography and Network Security, ACNS 2013
Y2 - 25 June 2013 through 28 June 2013
ER -