Sciweavers

6164 search results - page 276 / 1233
» Teaching Computer Security
Sort
View
CRYPTO
1990
Springer
79views Cryptology» more  CRYPTO 1990»
15 years 10 months ago
Fair Computation of General Functions in Presence of Immoral Majority
This paper describes a method for n players, a majority of which may be faulty, to compute correctly, privately, and fairly any computable function f(Xl, ...,x,) where xi is the i...
Shafi Goldwasser, Leonid A. Levin
CRYPTO
1992
Springer
154views Cryptology» more  CRYPTO 1992»
15 years 10 months ago
Massively Parallel Computation of Discrete Logarithms
Numerous cryptosystems have been designed to be secure under the assumption that the computation of discrete logarithms is infeasible. This paper reports on an aggressive attempt ...
Daniel M. Gordon, Kevin S. McCurley
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 2 days 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