Sciweavers

324 search results - page 13 / 65
» Guessing based on length functions
Sort
View
BMCBI
2010
190views more  BMCBI 2010»
13 years 7 months ago
A parallel and incremental algorithm for efficient unique signature discovery on DNA databases
Background: DNA signatures are distinct short nucleotide sequences that provide valuable information that is used for various purposes, such as the design of Polymerase Chain Reac...
Hsiao Ping Lee, Tzu-Fang Sheu, Chuan Yi Tang
CRYPTOLOGIA
2006
155views more  CRYPTOLOGIA 2006»
13 years 7 months ago
The Whirlpool Secure Hash Function
In this paper, we describe Whirlpool, which is a block-cipher-based secure hash function. Whirlpool produces a hash code of 512 bits for an input message of maximum length less tha...
William Stallings
SASN
2006
ACM
14 years 1 months ago
RANBAR: RANSAC-based resilient aggregation in sensor networks
We present a novel outlier elimination technique designed for sensor networks. This technique is called RANBAR and it is based on the RANSAC (RANdom SAmple Consensus) paradigm, wh...
Levente Buttyán, Péter Schaffer, Ist...
DATE
2006
IEEE
102views Hardware» more  DATE 2006»
14 years 1 months ago
Pseudorandom functional BIST for linear and nonlinear MEMS
Pseudorandom test techniques are widely used for measuring the impulse response (IR) for linear devices and Volterra kernels for nonlinear devices, especially in the acoustics dom...
Achraf Dhayni, Salvador Mir, Libor Rufer, Ahc&egra...
EUROCRYPT
2011
Springer
12 years 11 months ago
Homomorphic Signatures for Polynomial Functions
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an...
Dan Boneh, David Mandell Freeman