Searchable symmetric encryption: improved definitions and efficient constructions
Proceedings of the 13th ACM conference on Computer and communications security
An Indistinguishability-Based Characterization of Anonymous Channels
PETS '08 Proceedings of the 8th international symposium on Privacy Enhancing Technologies
Secure Arithmetic Computation with No Honest Majority
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Another Look at Extended Private Information Retrieval Protocols
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
A survey of single-database private information retrieval: techniques and applications
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Efficient computationally private information retrieval from anonymity or trapdoor groups
ISC'10 Proceedings of the 13th international conference on Information security
Resource-based corruptions and the combinatorics of hidden diversity
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
F5P5: keyword search over encrypted data with five functions and five privacy assurances
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
Searchable symmetric encryption: Improved definitions and efficient constructions
Journal of Computer Security
| Hi-index | 0.00 |
There is a vast body of work on implementing anonymous communication. In this paper, we study the possibility of using anonymous communication as a building block, and show that one can leverage on anonymity in a variety of cryptographic contexts. Our results go in two directions.--Feasibility. We show that anonymous communication over insecure channels can be used to implement unconditionally secure point-to-point channels, broadcast, and generalmulti-party protocols that remain unconditionally secure as long as less than half of the players are maliciously corrupted.--Efficiency. We show that anonymous channels can yield substantial efficiency improvements for several natural secure computation tasks. In particular, we present the first solution to the problem of private information retrieval (PIR) which can handle multiple users while being close to optimal with respect to both communication and computation.