Sciweavers

5476 search results - page 31 / 1096
» Resettably Secure Computation
Sort
View
FC
2010
Springer
196views Cryptology» more  FC 2010»
15 years 4 months ago
Secure Computation with Fixed-Point Numbers
Abstract. Secure computation is a promising approach to business problems in which several parties want to run a joint application and cannot reveal their inputs. Secure computatio...
Octavian Catrina, Amitabh Saxena
CCS
1998
ACM
15 years 7 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...
TC
2008
15 years 3 months ago
On the Computational Security of a Distributed Key Distribution Scheme
In a distributed key distribution scheme, a set of servers help a set of users in a group to securely obtain a common key. Security means that an adversary who corrupts some server...
Vanesa Daza, Javier Herranz, Germán S&aacut...
93
Voted
CACM
2010
87views more  CACM 2010»
15 years 28 days ago
Security in the cloud
Gary Anthes
EUROCRYPT
2004
Springer
15 years 9 months ago
Multi-party Computation with Hybrid Security
It is well-known that n players connected only by pairwise secure channels can achieve multi-party computation secure against an active adversary if and only if – t < n/2 of t...
Matthias Fitzi, Thomas Holenstein, Jürg Wulls...