Sciweavers

977 search results - page 90 / 196
» Secure Computation with Fixed-Point Numbers
Sort
View
WISA
2007
Springer
14 years 3 months ago
Breaking 104 Bit WEP in Less Than 60 Seconds
We demonstrate an active attack on the WEP protocol that is able to recover a 104-bit WEP key using less than 40,000 frames with a success probability of 50%. In order to succeed i...
Erik Tews, Ralf-Philipp Weinmann, Andrei Pyshkin
IPCCC
2005
IEEE
14 years 2 months ago
A key distribution scheme for double authentication in link state routing protocol
The Double Authentication (DA) scheme presented in [1] is designed to provide security against impersonation attack to link state routing protocol at a lower computational cost as...
D. Huang, A. Sinha, D. Medhi
SOUPS
2009
ACM
14 years 3 months ago
Ubiquitous systems and the family: thoughts about the networked home
Developments in ubiquitous and pervasive computing herald a future in which computation is embedded into our daily lives. Such a vision raises important questions about how people...
Linda Little, Elizabeth Sillence, Pamela Briggs
MINENET
2006
ACM
14 years 3 months ago
Forensic analysis of autonomous system reachability
Security incidents have an adverse impact not only on end systems, but also on Internet routing, resulting in many out-of-reach prefixes. Previous work has looked at performance ...
D. K. Lee, Sue B. Moon, Taesang Choi, Taesoo Jeong
KDD
2004
ACM
160views Data Mining» more  KDD 2004»
14 years 9 months ago
k-TTP: a new privacy model for large-scale distributed environments
Secure multiparty computation allows parties to jointly compute a function of their private inputs without revealing anything but the output. Theoretical results [2] provide a gen...
Bobi Gilburd, Assaf Schuster, Ran Wolff