Sciweavers

1769 search results - page 216 / 354
» Cryptography
Sort
View
WS
2006
ACM
15 years 9 months ago
Modeling Ad-hoc rushing attack in a negligibility-based security framework
In this paper, we propose a formal notion of network security for ad hoc networks. We adopt a probabilistic security framework, that is, security is defined by a polynomially bou...
Jiejun Kong, Xiaoyan Hong, Mario Gerla
STORAGESS
2005
ACM
15 years 9 months ago
Secure capabilities for a petabyte-scale object-based distributed file system
Recently, the Network-Attached Secure Disk (NASD) model has become a more widely used technique for constructing large-scale storage systems. However, the security system proposed...
Christopher Olson, Ethan L. Miller
CRYPTO
2005
Springer
113views Cryptology» more  CRYPTO 2005»
15 years 9 months ago
Secure Communications over Insecure Channels Based on Short Authenticated Strings
Abstract. We propose a way to establish peer-to-peer authenticated communications over an insecure channel by using an extra channel which can authenticate very short strings, e.g....
Serge Vaudenay
FSE
2005
Springer
108views Cryptology» more  FSE 2005»
15 years 9 months ago
Unbiased Random Sequences from Quasigroup String Transformations
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
Smile Markovski, Danilo Gligoroski, Ljupco Kocarev
WETICE
2003
IEEE
15 years 9 months ago
Attack-Resistance of Computational Trust Models
The World Wide Web encourages widely-distributed, open, decentralised systems that span multiple administrative domains. Recent research has turned to trust management [4] as a fr...
Andrew Twigg, Nathan Dimmock