Automata, Languages and Programming
Volume 5556 of the series Lecture Notes in Computer Science pp 534-545
Secure Function Collection with Sublinear Storage
- Maged H. IbrahimAffiliated withFaculty of Engineering, Helwan University
- , Aggelos KiayiasAffiliated withDept. of Informatics and Telecommunications, U. of AthensUniversity of Connecticut, Computer Science & Engineering
- , Moti YungAffiliated withGoogle Inc. and Computer Science, Columbia University
- , Hong-Sheng ZhouAffiliated withUniversity of Connecticut, Computer Science & Engineering
Abstract
Consider a center possessing a trusted (tamper proof) device that wishes to securely compute a public function over private inputs that are contributed by some network nodes. In network scenarios that support direct communication of nodes with the center, the computation can be done by the nodes encrypting their inputs under the device’s public key and sending the ciphertexts to the center which, in turn, feeds them to the trusted device that computes the function. In many modern networking scenarios, however, the center and the contributing nodes are not directly connected/connectable, in which case the discovery and collection of inputs can only be performed by an agent (or agents) released to the network by the center. This introduces a new set of issues for secure computation. In this work we consider an agent that is released, sweeps the network once and then returns to its origin. The direct solution, in this case, is for the agent to possess a certified public key of the trusted device and for the nodes to contribute their inputs as ciphertexts under this key; once the agent collects all inputs it reconnects with the center for function computation. The above single-sweep simple collection requires the agent to store a linear number of ciphertexts. The goal of this work is to formalize and solve the above problem for a general set of functions by an agent that employs sub-linear storage while maintaining input privacy (an important technical requirement akin of that of “Private Information Retrieval” protocols).
- Title
- Secure Function Collection with Sublinear Storage
- Book Title
- Automata, Languages and Programming
- Book Subtitle
- 36th Internatilonal Collogquium, ICALP 2009, Rhodes, greece, July 5-12, 2009, Proceedings, Part II
- Pages
- pp 534-545
- Copyright
- 2009
- DOI
- 10.1007/978-3-642-02930-1_44
- Print ISBN
- 978-3-642-02929-5
- Online ISBN
- 978-3-642-02930-1
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- 5556
- Series ISSN
- 0302-9743
- Publisher
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Topics
- Industry Sectors
- eBook Packages
- Editors
-
- Susanne Albers (16)
- Alberto Marchetti-Spaccamela (17)
- Yossi Matias (18)
- Sotiris Nikoletseas (19)
- Wolfgang Thomas (20)
- Editor Affiliations
-
- 16. Department of Computer Science, University of Freiburg
- 17. Department of Computer and Systems Sciences, Sapienza University of Rome
- 18. Tel Aviv University Google R&D Center, School of Computer Science, Tel Aviv University
- 19. University of Patras and CTI
- 20. RWTH Aachen
- Authors
-
- Maged H. Ibrahim (21)
- Aggelos Kiayias (22) (23)
- Moti Yung (24)
- Hong-Sheng Zhou (23)
- Author Affiliations
-
- 21. Faculty of Engineering, Helwan University, 1 Sherif St., Helwan, Cairo, Egypt
- 22. Dept. of Informatics and Telecommunications, U. of Athens, Greece
- 23. University of Connecticut, Computer Science & Engineering, Storrs, CT, USA
- 24. Google Inc. and Computer Science, Columbia University, New York, NY, USA
Continue reading...
To view the rest of this content please follow the download PDF link above.