Sciweavers

1255 search results - page 47 / 251
» On Simple and Secure Key Distribution
Sort
View
DAGSTUHL
2007
15 years 7 months ago
Tightness of the Security Bound of CENC
CENC (Cipher-based ENCryption) is the recently designed encryption mode for blockciphers. It is provably secure with beyond the birthday bound. In this note, we present a simple di...
Tetsu Iwata
ICPADS
2005
IEEE
15 years 11 months ago
Key Agreement for Heterogeneous Mobile Ad-Hoc Groups
In this paper we propose an efficient key agreement protocol suite for heterogeneous mobile ad-hoc groups, whose members use mobile devices with different performance limitations...
Mark Manulis
MST
2006
136views more  MST 2006»
15 years 5 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl
SP
2003
IEEE
104views Security Privacy» more  SP 2003»
15 years 11 months ago
Using Replication and Partitioning to Build Secure Distributed Systems
A challenging unsolved security problem is how to specify and enforce system-wide security policies; this problem is even more acute in distributed systems with mutual distrust. T...
Lantian Zheng, Stephen Chong, Andrew C. Myers, Ste...
CCS
2006
ACM
15 years 9 months ago
Improving secure server performance by re-balancing SSL/TLS handshakes
Much of today's distributed computing takes place in a client/server model. Despite advances in fault tolerance
Claude Castelluccia, Einar Mykletun, Gene Tsudik