Sciweavers

189 search results - page 13 / 38
» On Unconditionally Secure Computation with Vanishing Communi...
Sort
View
DSN
2000
IEEE
14 years 25 days ago
Fault-Secure Scheduling of Arbitrary Task Graphs to Multiprocessor Systems
In this paper, we propose new scheduling algorithms to achieve fault security in multiprocessor systems. We consider scheduling of parallel programs represented by directed acycli...
Koji Hashimoto, Tatsuhiro Tsuchiya, Tohru Kikuno
CCS
2009
ACM
14 years 3 months ago
ShadowWalker: peer-to-peer anonymous communication using redundant structured topologies
Peer-to-peer approaches to anonymous communication promise to eliminate the scalability concerns and central vulnerability points of current networks such as Tor. However, the P2P...
Prateek Mittal, Nikita Borisov
ACNS
2003
Springer
156views Cryptology» more  ACNS 2003»
14 years 2 days ago
An Efficient Tree-Based Group Key Agreement Using Bilinear Map
Secure and reliable group communication is an increasingly active research area by growing popularity in group-oriented and collaborative application. One of the important challeng...
Sangwon Lee, Yongdae Kim, Kwangjo Kim, DaeHyun Ryu
ISI
2006
Springer
13 years 8 months ago
Collective Sampling and Analysis of High Order Tensors for Chatroom Communications
This work investigates the accuracy and efficiency tradeoffs between centralized and collective (distributed) algorithms for (i) sampling, and (ii) n-way data analysis techniques i...
Evrim Acar, Seyit Ahmet Çamtepe, Bülen...
WWW
2008
ACM
14 years 9 months ago
Secure or insure?: a game-theoretic analysis of information security games
Despite general awareness of the importance of keeping one's system secure, and widespread availability of consumer security technologies, actual investment in security remai...
Jens Grossklags, Nicolas Christin, John Chuang