IACR
2011
12 years 11 months ago
2011
At PKC 2010 Smart and Vercauteren presented a variant of Gentry’s fully homomorphic public key encryption scheme and mentioned that the scheme could support SIMD style operations...
IACR
2011
12 years 11 months ago
2011
: Random number generator designs are discussed, which utilize oscillatory metastability, induced by switching between two stable states of ring‐connected di...
IACR
2011
12 years 11 months ago
2011
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
IACR
2011
12 years 11 months ago
2011
In this paper we present a new practical key-recovery attack on the SFLASH signature scheme. SFLASH is a derivative of the older C∗ encryption and signature scheme that was broke...
IACR
2011
12 years 11 months ago
2011
TLS is the most important cryptographic protocol in use today. However, up to now there is no complete cryptographic security proof in the standard model, nor in any other model. ...
IACR
2011
12 years 11 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...
IACR
2011
12 years 11 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 ...
IACR
2011
12 years 11 months ago
2011
IACR
2011
12 years 11 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...
IACR
2011
12 years 11 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...