@article {19038,
	title = {Path O-RAM: An Extremely Simple Oblivious RAM Protocol},
	journal = {Arxiv preprint arXiv:1202.5150},
	year = {2012},
	month = {2012},
	abstract = {We present Path O-RAM, an extremely simple Oblivious RAM protocol.},
	keywords = {Computer Science - Cryptography and Security},
	url = {http://arxiv.org/abs/1202.5150},
	author = {Stefanov, Emil and Elaine Shi}
}
@article {19611,
	title = {Preserving Link Privacy in Social Network Based Systems},
	journal = {arXiv:1208.6189 [cs]},
	year = {2012},
	note = {Comment: 16 pages, 15 figures},
	month = {2012/08/30/},
	abstract = {A growing body of research leverages social network based trust relationships to improve the functionality of the system. However, these systems expose users{\textquoteright} trust relationships, which is considered sensitive information in today{\textquoteright}s society, to an adversary. In this work, we make the following contributions. First, we propose an algorithm that perturbs the structure of a social graph in order to provide link privacy, at the cost of slight reduction in the utility of the social graph. Second we define general metrics for characterizing the utility and privacy of perturbed graphs. Third, we evaluate the utility and privacy of our proposed algorithm using real world social graphs. Finally, we demonstrate the applicability of our perturbation algorithm on a broad range of secure systems, including Sybil defenses and secure routing.},
	keywords = {Computer Science - Cryptography and Security, Computer Science - Social and Information Networks},
	url = {http://arxiv.org/abs/1208.6189},
	author = {Mittal, Prateek and Charalampos Papamanthou and Song, Dawn}
}
@article {19618,
	title = {Verifying Search Results Over Web Collections},
	journal = {arXiv:1204.5446 [cs]},
	year = {2012},
	month = {2012/04/24/},
	abstract = {Searching accounts for one of the most frequently performed computations over the Internet as well as one of the most important applications of outsourced computing, producing results that critically affect users{\textquoteright} decision-making behaviors. As such, verifying the integrity of Internet-based searches over vast amounts of web contents is essential. We provide the first solution to this general security problem. We introduce the concept of an authenticated web crawler and present the design and prototype implementation of this new concept. An authenticated web crawler is a trusted program that computes a special "signature" $s$ of a collection of web contents it visits. Subject to this signature, web searches can be verified to be correct with respect to the integrity of their produced results. This signature also allows the verification of complicated queries on web pages, such as conjunctive keyword searches. In our solution, along with the web pages that satisfy any given search query, the search engine also returns a cryptographic proof. This proof, together with the signature $s$, enables any user to efficiently verify that no legitimate web pages are omitted from the result computed by the search engine, and that no pages that are non-conforming with the query are included in the result. An important property of our solution is that the proof size and the verification time both depend solely on the sizes of the query description and the query result, but not on the number or sizes of the web pages over which the search is performed. Our authentication protocols are based on standard Merkle trees and the more involved bilinear-map accumulators. As we experimentally demonstrate, the prototype implementation of our system gives a low communication overhead between the search engine and the user, and allows for fast verification of the returned results on the user side.},
	keywords = {Computer Science - Cryptography and Security},
	url = {http://arxiv.org/abs/1204.5446},
	author = {Goodrich, Michael T. and Nguyen, Duy and Ohrimenko, Olga and Charalampos Papamanthou and Tamassia, Roberto and Triandopoulos, Nikos and Lopes, Cristina Videira}
}
@article {19047,
	title = {Towards Practical Oblivious RAM},
	journal = {arXiv:1106.3652},
	year = {2011},
	month = {2011},
	abstract = {We take an important step forward in making Oblivious RAM (O-RAM) practical. We propose an O-RAM construction achieving an amortized overhead of 20X-35X (for an O-RAM roughly 1 terabyte in size), about 63 times faster than the best existing scheme. On the theoretic front, we propose a fundamentally novel technique for constructing Oblivious RAMs: specifically, we partition a bigger O-RAM into smaller O-RAMs, and employ a background eviction technique to obliviously evict blocks from the client-side cache into a randomly assigned server-side partition. This novel technique is the key to achieving the gains in practical performance.},
	keywords = {Computer Science - Cryptography and Security},
	url = {http://arxiv.org/abs/1106.3652},
	author = {Stefanov, Emil and Elaine Shi and Song, Dawn}
}
