Sciweavers

757 search results - page 108 / 152
» How secure are secure interdomain routing protocols
Sort
View
TIFS
2010
130views more  TIFS 2010»
13 years 3 months ago
On the Insecurity of Proactive RSA in the URSA Mobile Ad Hoc Network Access Control Protocol
Access control is the fundamental security service in ad hoc groups. It is needed not only to prevent unauthorized entities from joining the group, but also to bootstrap other secu...
Stanislaw Jarecki, Nitesh Saxena
CRYPTO
2004
Springer
130views Cryptology» more  CRYPTO 2004»
14 years 2 months ago
Signature Schemes and Anonymous Credentials from Bilinear Maps
Abstract. We propose a new and efficient signature scheme that is provably secure in the plain model. The security of our scheme is based on a discrete-logarithm-based assumption p...
Jan Camenisch, Anna Lysyanskaya
ASIAN
2006
Springer
133views Algorithms» more  ASIAN 2006»
14 years 23 days ago
Normal Proofs in Intruder Theories
Given an arbitrary intruder deduction capability, modeled as an inference system S and a protocol, we show how to compute an inference system bS such that the security problem for ...
Vincent Bernat, Hubert Comon-Lundh
SDM
2008
SIAM
135views Data Mining» more  SDM 2008»
13 years 10 months ago
Preemptive Measures against Malicious Party in Privacy-Preserving Data Mining
Currently, many privacy-preserving data mining (PPDM) algorithms assume the semi-honest model and/or malicious model of multi-party interaction. However, both models are far from ...
Shuguo Han, Wee Keong Ng
INFOCOM
2008
IEEE
14 years 3 months ago
Area Avoidance Routing in Distance-Vector Networks
Network routing may be required, under certain applications, to avoid certain areas (or nodes) These areas can be of potential security threat, possess poor quality or have other ...
Haim Zlatokrilov, Hanoch Levy