Sciweavers

73 search results - page 8 / 15
» Public-Key Locally-Decodable Codes
Sort
View
ECCC
2010
122views more  ECCC 2010»
13 years 7 months ago
Query Complexity Lower Bounds for Reconstruction of Codes
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah
ASIACRYPT
2001
Springer
14 years 1 months ago
How to Achieve a McEliece-Based Digital Signature Scheme
Abstract. McEliece is one of the oldest known public key cryptosystems. Though it was less widely studied than RSA, it is remarkable that all known attacks are still exponential. I...
Nicolas Courtois, Matthieu Finiasz, Nicolas Sendri...
STACS
2009
Springer
14 years 3 months ago
Error-Correcting Data Structures
We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries...
Ronald de Wolf
EUROCRYPT
2007
Springer
14 years 2 months ago
Cryptanalysis of the Sidelnikov Cryptosystem
We present a structural attack against the Sidelnikov cryptosystem [8]. The attack creates a private key from a given public key. Its running time is subexponential and is effecti...
Lorenz Minder, Amin Shokrollahi
IPPS
2007
IEEE
14 years 2 months ago
Authentication in Reprogramming of Sensor Networks for Mote Class Adversaries
Reprogramming is an essential service for wireless sensor networks. Authenticating reprogramming process is important as sensors need to verify that the code image is truly from a...
Limin Wang, Sandeep S. Kulkarni