Sciweavers

524 search results - page 25 / 105
» ets 2010
Sort
View
JCIT
2010
158views more  JCIT 2010»
13 years 2 months ago
Improvement of a Secure Convex Hull Two-Party Computation Protocol
In 2008, Wang et. al. first investigate a sort of specific secure multi-party computation--secure convex hull two-party computation, and construct two protocols based on Gift wrap...
Wenjie Zhao, Mingxing He
JMLR
2010
128views more  JMLR 2010»
13 years 2 months ago
Optimal Allocation Strategies for the Dark Pool Problem
We study the problem of allocating stocks to dark pools. We propose and analyze an optimal approach for allocations, if continuousvalued allocations are allowed. We also propose a...
Alekh Agarwal, Peter L. Bartlett, Max Dama
IWPEC
2010
Springer
13 years 5 months ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...
COMPSEC
2010
93views more  COMPSEC 2010»
13 years 6 months ago
A secure peer-to-peer backup service keeping great autonomy while under the supervision of a provider
Making backup is so cumbersome and expensive that individuals hardly ever backup their data and companies usually duplicate their data into a secondary server. This paper proposes...
Houssem Jarraya, Maryline Laurent
ASIACRYPT
2010
Springer
13 years 5 months ago
Faster Fully Homomorphic Encryption
Abstract. We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardn...
Damien Stehlé, Ron Steinfeld