Information sharing across private databases
Citations
3,780 citations
2,700 citations
Cites background from "Information sharing across private ..."
...Agrawal et al. [ Agrawal et al. 2003 ] employ commutative encryption techniques for information sharing across private database....
[...]
2,080 citations
1,239 citations
750 citations
Cites background or methods from "Information sharing across private ..."
...The most relevant work to our paper is by Freedman, Nissim, and Pinkas (FNP) [14] and Rakesh Agrawal and Alexandre Evfimievski and Ramakrishnan Srikant [1]....
[...]
...• Evaluation of an encrypted polynomial at an unencrypted point: given the encryption of polynomial f1, we can efficiently compute the encryption of a := f1(b), by calculating Epk(a) := (b0 ×h Epk(f1[0])) +h (b1 ×h Epk(f1[1])) +h ....
[...]
References
14,980 citations
"Information sharing across private ..." refers methods in this paper
...Our definition of commutative encryption below is similar to the constructions used in [9, 18, 20, 42] and others....
[...]
12,059 citations
"Information sharing across private ..." refers methods in this paper
...The documents have been preprocessed to only include the most significant words, using some measure such as term frequency times inverse document frequency [41]....
[...]
8,777 citations
"Information sharing across private ..." refers background in this paper
...Perfect Secrecy [43]: For any ext(v),the value of KK(ext(v))is indistinguishable from a .xed (independent of ext(v)) distribution Dextover Cextwhen I2rDomF....
[...]
...“Perfect Secrecy” [43]: For any , the value of ) is indistinguishable from a fixed (independent of ) distribution over when PO B D/FH9 ....
[...]
7,514 citations
5,313 citations
"Information sharing across private ..." refers methods in this paper
...In the proofs of our security statements we shall rely on the standard random oracle model [8, 24, 46]....
[...]