Sciweavers

1286 search results - page 33 / 258
» A Practical Modelling Notation for Secure Distributed Comput...
Sort
View
CRYPTO
2001
Springer
95views Cryptology» more  CRYPTO 2001»
15 years 7 months ago
Robustness for Free in Unconditional Multi-party Computation
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...
Martin Hirt, Ueli M. Maurer
IPPS
2002
IEEE
15 years 7 months ago
Architecture of the Entropia Distributed Computing System
Distributed Computing, the exploitation of idle cycles on pervasive desktop PC systems offers the opportunity to increase the available computing power by orders of magnitude (10x...
Andrew A. Chien
106
Voted
SIGCSE
2004
ACM
112views Education» more  SIGCSE 2004»
15 years 8 months ago
Great principles in computing curricula
The nearly three dozen core technologies of computing sit in a simple framework defined by great principles and by computing practices. The great principles are of two kinds, mech...
Peter J. Denning
110
Voted
NSPW
2003
ACM
15 years 8 months ago
SELF: a transparent security extension for ELF binaries
The ability to analyze and modify binaries is often very useful from a security viewpoint. Security operations one would like to perform on binaries include the ability to extract...
Daniel C. DuVarney, V. N. Venkatakrishnan, Sandeep...
165
Voted
EUROCRYPT
2008
Springer
15 years 4 months ago
Efficient Two Party and Multi Party Computation Against Covert Adversaries
Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure...
Vipul Goyal, Payman Mohassel, Adam Smith