Sciweavers

87 search results - page 5 / 18
» Two Generic Constructions of Probabilistic Cryptosystems and...
Sort
View
PEPM
2010
ACM
14 years 4 months ago
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
Fritz Henglein
ACSC
2008
IEEE
14 years 1 months ago
Privacy preserving set intersection based on bilinear groups
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
Yingpeng Sang, Hong Shen
IEE
2007
100views more  IEE 2007»
13 years 7 months ago
Designing and constructing modifiable middleware using component frameworks
Because of the increasingly diverse and dynamic environments in which they must operate, modern middleware platforms need to explicitly support modifiability. Modifiability should...
Nikos Parlavantzas, Geoffrey Coulson
RSA
2006
74views more  RSA 2006»
13 years 7 months ago
Robust locally testable codes and products of codes
We continue the investigation of locally testable codes, i.e., error-correcting codes for whom membership of a given word in the code can be tested probabilistically by examining ...
Eli Ben-Sasson, Madhu Sudan
ICDE
2007
IEEE
138views Database» more  ICDE 2007»
14 years 8 months ago
Representing and Querying Correlated Tuples in Probabilistic Databases
Probabilistic databases have received considerable attention recently due to the need for storing uncertain data produced by many real world applications. The widespread use of pr...
Prithviraj Sen, Amol Deshpande