Sciweavers

160 search results - page 31 / 32
» On the List-Decodability of Random Linear Codes
Sort
View
EUROCRYPT
2009
Springer
14 years 8 months ago
Smashing SQUASH-0
At the RFID Security Workshop 2007, Adi Shamir presented a new challenge-response protocol well suited for RFIDs, although based on the Rabin public-key cryptosystem. This protocol...
Khaled Ouafi, Serge Vaudenay
EUROCRYPT
2003
Springer
14 years 27 days ago
Extracting Group Signatures from Traitor Tracing Schemes
Abstract. Digital Signatures emerge naturally from Public-Key Encryption based on trapdoor permutations, and the “duality” of the two primitives was noted as early as Diffie-He...
Aggelos Kiayias, Moti Yung
BMCBI
2005
127views more  BMCBI 2005»
13 years 7 months ago
Genomes are covered with ubiquitous 11 bp periodic patterns, the "class A flexible patterns"
Background: The genomes of prokaryotes and lower eukaryotes display a very strong 11 bp periodic bias in the distribution of their nucleotides. This bias is present throughout a g...
Etienne Larsabal, Antoine Danchin
APPROX
2009
Springer
112views Algorithms» more  APPROX 2009»
14 years 2 months ago
Deterministic Approximation Algorithms for the Nearest Codeword Problem
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
Noga Alon, Rina Panigrahy, Sergey Yekhanin
BMCBI
2008
171views more  BMCBI 2008»
13 years 7 months ago
A general approach to simultaneous model fitting and variable elimination in response models for biological data with many more
Background: With the advent of high throughput biotechnology data acquisition platforms such as micro arrays, SNP chips and mass spectrometers, data sets with many more variables ...
Harri T. Kiiveri