Sciweavers

3811 search results - page 94 / 763
» The Safe-Tcl Security Model
Sort
View
CCS
2011
ACM
14 years 4 months ago
Trust-based anonymous communication: adversary models and routing algorithms
We introduce a novel model of routing security that incorporates the ordinarily overlooked variations in trust that users have for different parts of the network. We focus on ano...
Aaron Johnson, Paul F. Syverson, Roger Dingledine,...
SP
2009
IEEE
15 years 11 months ago
Sphinx: A Compact and Provably Secure Mix Format
Sphinx is a cryptographic message format used to relay anonymized messages within a mix network. It is more compact than any comparable scheme, and supports a full set of security...
George Danezis, Ian Goldberg
DASFAA
2007
IEEE
188views Database» more  DASFAA 2007»
15 years 11 months ago
Security-Conscious XML Indexing
To support secure exchanging and sharing of XML data over the Internet, a myriad of XML access control mechanisms have been proposed. In the setting of node-level fine-grained acc...
Yan Xiao, Bo Luo, Dongwon Lee
ESAS
2005
Springer
15 years 10 months ago
Provable Security of On-Demand Distance Vector Routing in Wireless Ad Hoc Networks
Abstract. In this paper, we propose a framework for the security analysis of on-demand, distance vector routing protocols for ad hoc networks, such as AODV, SAODV, and ARAN. The pr...
Gergely Ács, Levente Buttyán, Istv&a...
PROVSEC
2009
Springer
15 years 9 months ago
Oracle Separation in the Non-uniform Model
Abstract. Oracle separation methods are used in cryptography to rule out blackbox reductions between cryptographic primitives. It is sufficient to find an oracle relative to whic...
Ahto Buldas, Sven Laur, Margus Niitsoo