Sciweavers

5476 search results - page 209 / 1096
» Resettably Secure Computation
Sort
View
IJNSEC
2008
115views more  IJNSEC 2008»
15 years 6 months ago
A Simple User Authentication Scheme for Grid Computing
The security issue has become an important concern of grid computing. To prevent the grid resources from being illegally visited, the strong mutual authentication is needed for us...
Rongxing Lu, Zhenfu Cao, Zhenchuan Chai, Xiaohui L...
WIKIS
2009
ACM
16 years 1 months ago
Suffr: democratic control of computing infrastructure
Suffr uses Wiki to facilitate corporate governance. Suffr allows a group's members to administer a computer system and its information resources collectively. Categories and ...
Kirk Zurell
ASIACRYPT
2004
Springer
16 years 12 hour ago
Practical Two-Party Computation Based on the Conditional Gate
Abstract. We present new results in the framework of secure multiparty computation based on homomorphic threshold cryptosystems. We introduce the conditional gate as a special type...
Berry Schoenmakers, Pim Tuyls
NIXDORF
1992
127views Hardware» more  NIXDORF 1992»
15 years 10 months ago
Three non Conventional Paradigms of Parallel Computation
Abstract. We consider three paradigms of computation where the bene ts of a parallel solution are greater than usual. Paradigm 1 works on a time-varying input data set, whose size ...
Fabrizio Luccio, Linda Pagli, Geppino Pucci
JPDC
2006
134views more  JPDC 2006»
15 years 6 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong