Sciweavers

1777 search results - page 112 / 356
» Programming Cryptographic Protocols
Sort
View
127
Voted
PERCOM
2005
ACM
16 years 25 days ago
Secure Routing and Intrusion Detection in Ad Hoc Networks
Numerous schemes have been proposed for secure routing protocols, and Intrusion Detection and Response Systems, for ad hoc networks. In this paper, we present a proof-of-concept i...
Anand Patwardhan, Jim Parker, Anupam Joshi, Michae...
CCS
2005
ACM
15 years 6 months ago
Provable anonymity
This paper provides a formal framework for the analysis of information hiding properties of anonymous communication protocols in terms of epistemic logic. The key ingredient is ou...
Flavio D. Garcia, Ichiro Hasuo, Wolter Pieters, Pe...
ICPPW
2003
IEEE
15 years 6 months ago
Secure Bootstrapping and Routing in an IPv6-Based Ad Hoc Network
The mobile ad hoc network (MANET), which is characterized by an infrastructureless architecture and multi-hop communication, has attracted a lot of attention recently. In the evol...
Yu-Chee Tseng, Jehn-Ruey Jiang, Jih-Hsin Lee
CRYPTO
2003
Springer
93views Cryptology» more  CRYPTO 2003»
15 years 6 months ago
Universal Composition with Joint State
Abstract. Cryptographic systems often involve running multiple concurrent instances of some protocol, where the instances have some amount of joint state and randomness. (Examples ...
Ran Canetti, Tal Rabin
ASIACRYPT
2008
Springer
15 years 3 months ago
Limits of Constructive Security Proofs
The collision-resistance of hash functions is an important foundation of many cryptographic protocols. Formally, collision-resistance can only be expected if the hash function in f...
Michael Backes, Dominique Unruh