200
click to vote
IACR
2011
14 years 6 months ago
2011
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...
198
click to vote
IACR
2011
14 years 6 months ago
2011
In the area of privacy-preserving data mining, a differentially private mechanism intuitively encourages people to share their data truthfully because they are at little risk of ...
169
click to vote
IACR
2011
14 years 6 months ago
2011
At Eurocrypt 2010, Howgrave-Graham and Joux described an algorithm for solving hard knapsacks of density close to 1 in time ˜O(20.337n ) and memory ˜O(20.256n ), thereby improvin...
169
click to vote
IACR
2011
14 years 6 months ago
2011
This paper presents a method for constructing n-stage Galois NLFSRs with period 2n − 1 from n-stage maximum length LFSRs. We introduce nonlinearity into state cycles by adding a ...
210
click to vote
IACR
2011
14 years 6 months ago
2011
Abstract. We show that the Winternitz one-time signature scheme is existentially unforgeable under adaptive chosen message attacks when instantiated with a family of pseudo random ...