Sciweavers

85 search results - page 11 / 17
» Distance Hijacking Attacks on Distance Bounding Protocols
Sort
View
MMMACNS
2001
Springer
13 years 12 months ago
Generalized Oblivious Transfer Protocols Based on Noisy Channels
The main cryptographic primitives (Bit Commitment (BC) and Oblivious Transfer (OT) protocols) based on noisy channels have been considered in [1] for asymptotic case. Non-asymptoti...
Valeri Korjik, Kirill Morozov
NOSSDAV
2010
Springer
14 years 5 days ago
RTP-miner: a real-time security framework for RTP fuzzing attacks
Real-time Transport Protocol (RTP) is a widely adopted standard for transmission of multimedia traffic in Internet telephony (commonly known as VoIP). Therefore, it is a hot poten...
M. Ali Akbar, Muddassar Farooq
COMCOM
2008
131views more  COMCOM 2008»
13 years 7 months ago
CORA: Collaborative Opportunistic Recovery Algorithm for loss controlled, delay bounded ad hoc multicast
In this paper, we present Collaborative Opportunistic Recovery Algorithm (CORA) designed for multicast multimedia applications with low loss as well as latency constraints in ad h...
Yunjung Yi, Jiejun Kong, Mario Gerla, Joon-Sang Pa...
MSWIM
2005
ACM
14 years 29 days ago
Experimental comparisons between SAODV and AODV routing protocols
There have been various secure routing protocols proposed for mobile ad hoc networks. Most of these protocols are analyzed by two standard techniques: simulation and security anal...
Yuxia Lin, Amir Hamed Mohsenian Rad, Vincent W. S....
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
14 years 2 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti