92
Voted
TCC
2016
Springer
9 years 8 months ago
2016
Springer
92
Voted
TCC
2016
Springer
9 years 8 months ago
2016
Springer
Rational proofs, introduced by Azar and Micali (STOC 2012) are a variant of interactive proofs in which the prover is neither honest nor malicious, but rather rational. The advanta...
84
Voted
TCC
2016
Springer
9 years 8 months ago
2016
Springer
89
Voted
TCC
2016
Springer
9 years 8 months ago
2016
Springer
A Probabilistically Checkable Proof (PCP) allows a randomized verifier, with oracle access to a purported proof, to probabilistically verify an input statement of the form “x ...
93
Voted
TCC
2016
Springer
9 years 8 months ago
2016
Springer
We show that homomorphic evaluation of any non-trivial functionality of sufficiently many inputs with respect to any CPA secure homomorphic encryption scheme cannot be implemented ...
116
Voted
PVLDB
2016
9 years 8 months ago
2016
This paper introduces a dynamic graph partitioning algorithm, designed for large, constantly changing graphs. We propose a partitioning framework that adjusts on the fly as the g...
86
Voted
PVLDB
2016
9 years 8 months ago
2016
Since regular expressions are often used to detect errors in sequences such as strings or date, it is natural to use them for data repair. Motivated by this, we propose a data rep...
98
Voted
PVLDB
2016
9 years 8 months ago
2016
Set queries are fundamental operations in computer systems and applications. This paper addresses the fundamental problem of designing a probabilistic data structure that can quic...
113
Voted
PVLDB
2016
9 years 8 months ago
2016
The advent of semantic data on the Web requires efficient reasoning systems to infer RDF and OWL data. The linked nature and the huge volume of data entail efficiency and scalabil...
92
Voted
PVLDB
2016
9 years 8 months ago
2016
Increasingly large Knowledge Bases are being created, by crawling the Web or other corpora of documents, and by extracting facts and relations using machine learning techniques. T...