Sciweavers

1066 search results - page 19 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
80
Voted
DCC
2007
IEEE
15 years 10 months ago
Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
Let p be a prime and let E(IFp) be an elliptic curve defined over the finite field IFp of p elements. For a given point G E(IFp) the linear congruential genarator on elliptic curv...
Jaime Gutierrez, Álvar Ibeas
ACSC
2008
IEEE
15 years 5 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
PDCAT
2007
Springer
15 years 5 months ago
Privacy Preserving Set Intersection Protocol Secure against Malicious Behaviors
When datasets are distributed on different sources, finding out their intersection while preserving the privacy of the datasets is a widely required task. In this paper, we addre...
Yingpeng Sang, Hong Shen
EC
2008
153views ECommerce» more  EC 2008»
14 years 10 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
GCC
2007
Springer
15 years 5 months ago
Improving the Performance of MPI Applications over Computational Grid
The Message Passing Interface (MPI) is a standard in parallel computing, and can also be used as a highperformance programming model for Grid application development. How to execu...
Bo Song, Guangwen Yang, Qiming Fang