Sciweavers

Share
8 search results - page 1 / 2
» New Circular Security Counterexamples from Decision Linear a...
Sort
View
ASIACRYPT
2015
Springer
3 years 6 months ago
New Circular Security Counterexamples from Decision Linear and Learning with Errors
We investigate new constructions of n-circular counterexamples with a focus on the case of n = 2. We have a particular interest in what qualities a cryptosystem must have to be ab...
Allison Bishop, Susan Hohenberger, Brent Waters
IACR
2016
42views Biometrics» more  IACR 2016»
3 years 6 months ago
Circular Security Counterexamples for Arbitrary Length Cycles from LWE
We describe a public key encryption that is IND-CPA secure under the Learning with Errors (LWE) assumption, but that is not circular secure for arbitrary length cycles. Previous s...
Venkata Koppula, Brent Waters
EWRL
2008
9 years 1 days ago
New Error Bounds for Approximations from Projected Linear Equations
We consider linear fixed point equations and their approximations by projection on a low dimensional subspace. We derive new bounds on the approximation error of the solution, whi...
Huizhen Yu, Dimitri P. Bertsekas
STOC
2005
ACM
198views Algorithms» more  STOC 2005»
9 years 10 months ago
On lattices, learning with errors, random linear codes, and cryptography
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
Oded Regev
ICML
2001
IEEE
9 years 11 months ago
Off-Policy Temporal Difference Learning with Function Approximation
We introduce the first algorithm for off-policy temporal-difference learning that is stable with linear function approximation. Off-policy learning is of interest because it forms...
Doina Precup, Richard S. Sutton, Sanjoy Dasgupta
books