Sciweavers

621 search results - page 9 / 125
» Efficient Secure Multi-party Computation
Sort
View
CCS
2010
ACM
13 years 10 months ago
TASTY: tool for automating secure two-party computations
Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the ou...
Wilko Henecka, Stefan Kögl, Ahmad-Reza Sadegh...
EUROCRYPT
2007
Springer
14 years 1 months ago
Revisiting the Efficiency of Malicious Two-Party Computation
In a recent paper Mohassel and Franklin study the efficiency of secure two-party computation in the presence of malicious behavior. Their aim is to make classical solutions to this...
David P. Woodruff
ESORICS
2006
Springer
14 years 1 months ago
TrustedPals: Secure Multiparty Computation Implemented with Smart Cards
We study the problem of Secure Multi-party Computation (SMC) in a model where individual processes contain a tamper-proof security module, and introduce the TrustedPals framework, ...
Milan Fort, Felix C. Freiling, Lucia Draque Penso,...
CCS
2008
ACM
13 years 11 months ago
Efficient security primitives derived from a secure aggregation algorithm
By functionally decomposing a specific algorithm (the hierarchical secure aggregation algorithm of Chan et al. [3] and Frikken et al. [7]), we uncover a useful general functionali...
Haowen Chan, Adrian Perrig
CCS
1998
ACM
14 years 2 months ago
A Security Architecture for Computational Grids
State-of-the-art and emerging scientific applications require fast access to large quantities of data and commensurately fast computational resources. Both resources and data are ...
Ian T. Foster, Carl Kesselman, Gene Tsudik, Steven...