177
Voted
IACR
2011
14 years 6 months ago
2011
Let r, B and w be positive integers. Let C be a linear code of length Bw and subspace of Fr 2. The k-regular-decoding problem is to find a nonzero codeword consisting of w length...
162
click to vote
IACR
2011
14 years 6 months ago
2011
On-Line Authenticated Encryption (OAE) combines confidentiality with data integrity and is on-line computable. Most block cipher-based schemes for Authenticated Encryption can be ...
195
click to vote
IACR
2011
14 years 6 months ago
2011
We propose a new homomorphic encryption scheme based on the hardness of decoding under independent random noise from certain affine families of codes. Unlike in previous latticeba...
186
click to vote
IACR
2011
14 years 6 months ago
2011
Although anonymous authentication has been extensively studied, so far no scheme has been widely adopted in practice. A particular issue with fully anonymous authentication schemes...