60 search results - page 7 / 12 » Cryptographic Hardness Based on the Decoding of Reed-Solomon... |
TIT
2008
13 years 7 months ago
2008
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
IACR
2011
12 years 7 months ago
2011
Abstract. Homomorphic encryption schemes are powerful cryptographic primitives that allow for a variety of applications. Consequently, a variety of proposals have been made in the ...
ACSAC
2005
IEEE
14 years 1 months ago
2005
IEEE
Understanding the security goals provided by cryptographic protocol implementations is known to be difficult, since security requirements such as secrecy, integrity and authentici...
MYCRYPT
2005
Springer
14 years 1 months ago
2005
Springer
Recently, some collisions have been exposed for a variety of cryptographic hash functions [20,21] including some of the most widely used today. Many other hash functions using simi...
ICMCS
2008
IEEE
14 years 1 months ago
2008
IEEE
Arising needs for extremely simple encoder motivate investigations on distributed video coding (DVC). The Wyner-Ziv coding, one of the representative DVC schemes, reconstructs vid...