Sciweavers

184 search results - page 19 / 37
» Querying Proofs
Sort
View
SAS
2004
Springer
123views Formal Methods» more  SAS 2004»
15 years 7 months ago
Non-termination Inference for Constraint Logic Programs
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...
Étienne Payet, Frédéric Mesna...
CCS
2008
ACM
15 years 3 months ago
Authenticated hash tables
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
Charalampos Papamanthou, Roberto Tamassia, Nikos T...
190
Voted
SIGMOD
2009
ACM
157views Database» more  SIGMOD 2009»
16 years 2 months ago
Authenticated join processing in outsourced databases
Database outsourcing requires that a query server constructs a proof of result correctness, which can be verified by the client using the data owner's signature. Previous aut...
Yin Yang, Dimitris Papadias, Stavros Papadopoulos,...
DBSEC
2008
196views Database» more  DBSEC 2008»
15 years 3 months ago
Shared and Searchable Encrypted Data for Untrusted Servers
Current security mechanisms are not suitable for organisations that outsource their data management to untrusted servers. Encrypting and decrypting sensitive data at the client si...
Changyu Dong, Giovanni Russello, Naranker Dulay
113
Voted
STOC
2004
ACM
110views Algorithms» more  STOC 2004»
16 years 2 months ago
On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
Uriel Feige