Sciweavers

1342 search results - page 165 / 269
» Attacks are Protocols Too
Sort
View
IPL
2007
72views more  IPL 2007»
15 years 6 months ago
How to safely close a discussion
In the secure communication problem, we focus on safe termination. In applications such as electronic transactions, we want each party to be ensured that both sides agree on the s...
Gildas Avoine, Serge Vaudenay
CORR
2010
Springer
164views Education» more  CORR 2010»
15 years 4 months ago
Securing AODV for MANETs using Message Digest with Secret Key
Due to lack of the infrastructure, open peer-to-peer architecture, shared wireless medium, limited resource constraints and highly dynamic topology, MANETs (Mobile Adhoc Networks) ...
Kamaljit I. Lakhtaria, Bhaskar N. Patel, Satish G....
SP
2008
IEEE
103views Security Privacy» more  SP 2008»
16 years 23 days ago
Preserving Caller Anonymity in Voice-over-IP Networks
— Applications such as VoIP need to provide anonymity to clients while maintaining low latency to satisfy quality of service (QoS) requirements. Existing solutions for providing ...
Mudhakar Srivatsa, Ling Liu, Arun Iyengar
INFOCOM
2006
IEEE
16 years 13 days ago
Detecting Stations Cheating on Backoff Rules in 802.11 Networks Using Sequential Analysis
— As the commercial success of the IEEE 802.11 protocol has made wireless infrastructure widely deployed, user organizations are increasingly concerned about the new vulnerabilit...
Yanxia Rong, Sang Kyu Lee, Hyeong-Ah Choi
IFIP
2005
Springer
15 years 12 months ago
Probable Innocence Revisited
In this paper we propose a formalization of probable innocence, a notion of probabilistic anonymity that is associated to “realistic” protocols such as Crowds. We analyze crit...
Konstantinos Chatzikokolakis, Catuscia Palamidessi