Sciweavers

39 search results - page 5 / 8
» Public Key Locally Decodable Codes with Short Keys
Sort
View
TCOM
2010
111views more  TCOM 2010»
13 years 5 months ago
Design of irregular LDPC codes with optimized performance-complexity tradeoff
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...
Benjamin Smith, Masoud Ardakani, Wei Yu, Frank R. ...
CRYPTO
2009
Springer
154views Cryptology» more  CRYPTO 2009»
14 years 1 months ago
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...
Vadim Lyubashevsky, Daniele Micciancio
CORR
2010
Springer
67views Education» more  CORR 2010»
13 years 4 months ago
Secret Sharing LDPC Codes for the Constrained Gaussian Wiretap Channel
The problem of secret sharing over the Gaussian wiretap channel is considered. A source and a destination intend to share secret information over a Gaussian channel in the presenc...
Chan Wong Wong, Tan F. Wong, John M. Shea
TIP
2010
357views more  TIP 2010»
13 years 5 months ago
Efficient Compression of Encrypted Grayscale Images
—Lossless compression of encrypted sources can be achieved through Slepian-Wolf coding. For encrypted real-world sources such as images, the key to improve the compression effici...
Wei Liu, Wenjun Zeng, Lina Dong, Qiuming Yao
IACR
2011
82views more  IACR 2011»
12 years 6 months ago
Wild McEliece Incognito
The wild McEliece cryptosystem uses wild Goppa codes over finite fields to achieve smaller public key sizes compared to the original McEliece cryptosystem at the same level of se...
Daniel J. Bernstein, Tanja Lange, Christiane Peter...