Sciweavers

2139 search results - page 99 / 428
» Distributed computing and computer security education
Sort
View
ICITS
2009
15 years 4 months ago
On the Security of Pseudorandomized Information-Theoretically Secure Schemes
In this article, we discuss a naive method of randomness reduction for cryptographic schemes, which replaces the required perfect randomness with output distribution of a computat...
Koji Nuida, Goichiro Hanaoka
CORR
2008
Springer
133views Education» more  CORR 2008»
15 years 6 months ago
A simple local 3-approximation algorithm for vertex cover
We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxili...
Valentin Polishchuk, Jukka Suomela
SIGCSE
2009
ACM
221views Education» more  SIGCSE 2009»
16 years 6 months ago
Virtualized games for teaching about distributed systems
Complex distributed systems are increasingly important in modern computer science, yet many undergraduate curricula do not give students the opportunity to develop the skill sets ...
Joel Wein, Kirill Kourtchikov, Yan Cheng, Ron Guti...
CN
1999
88views more  CN 1999»
15 years 6 months ago
Building a high-performance, programmable secure coprocessor
Secure coprocessors enable secure distributed applications by providing safe havens where an application program can Z .execute and accumulate state , free of observation and inte...
Sean W. Smith, Steve Weingart
CORR
2008
Springer
166views Education» more  CORR 2008»
15 years 6 months ago
Information-Theoretically Secure Voting Without an Honest Majority
We present three voting protocols with unconditional privacy and information-theoretic correctness, without assuming any bound on the number of corrupt voters or voting authorities...
Anne Broadbent, Alain Tapp