page 59807 / 60054 » publications |
202
click to vote
IACR
2011
14 years 6 months ago
2011
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
172
click to vote
IACR
2011
14 years 6 months ago
2011
Zero knowledge sets (ZKS) [18] allow a party to commit to a secret set S and then to, non interactively, produce proofs for statements such as x ∈ S or x /∈ S. As recognized in...
182
click to vote
IACR
2011
14 years 6 months ago
2011
Program Obfuscation is the problem of transforming a program into one which is functionally equivalent, yet whose inner workings are completely unintelligible to an adversary. Des...
191
click to vote
IACR
2011
14 years 6 months ago
2011
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
192
click to vote
IACR
2011
14 years 6 months ago
2011
We study the problem of authentication based on a weak key in the information-theoretic setting. A key is weak if its min-entropy is an arbitrary small fraction of its bit length. ...