Sciweavers

713 search results - page 133 / 143
» Dispersing Hash Functions
Sort
View
FSE
2008
Springer
141views Cryptology» more  FSE 2008»
14 years 11 months ago
Cryptanalysis of LASH
We show that the LASH-x hash function is vulnerable to attacks that trade time for memory, including collision attacks as fast as 2(4x/11) and preimage attacks as fast as 2(4x/7) ....
Ron Steinfeld, Scott Contini, Krystian Matusiewicz...
NIPS
2008
14 years 11 months ago
Online Metric Learning and Fast Similarity Search
Metric learning algorithms can provide useful distance functions for a variety of domains, and recent work has shown good accuracy for problems where the learner can access all di...
Prateek Jain, Brian Kulis, Inderjit S. Dhillon, Kr...
95
Voted
CORR
2010
Springer
99views Education» more  CORR 2010»
14 years 9 months ago
Security in Distributed Storage Systems by Communicating a Logarithmic Number of Bits
Abstract--We investigate the problem of maintaining an encoded distributed storage system when some nodes contain adversarial errors. Using the error-correction capabilities that a...
Theodoros K. Dikaliotis, Alexandros G. Dimakis, Tr...
CORR
2006
Springer
104views Education» more  CORR 2006»
14 years 9 months ago
Unmanaged Internet Protocol: Taming the Edge Network Management Crisis
Though appropriate for core Internet infrastructure, the Internet Protocol is unsuited to routing within and between emerging ad-hoc edge networks due to its dependence on hierarc...
Bryan Ford
ECCC
2006
77views more  ECCC 2006»
14 years 9 months ago
Extractors and condensers from univariate polynomials
We give new constructions of randomness extractors and lossless condensers that are optimal to within constant factors in both the seed length and the output length. For extractor...
Venkatesan Guruswami, Christopher Umans, Salil P. ...