90 search results - page 11 / 18 » Schemes for deterministic polynomial factoring |
73
Voted
CHES
2009
Springer
15 years 10 months ago
2009
Springer
Fault attacks exploit hardware malfunctions to recover secrets from embedded electronic devices. In the late 90's, Boneh, DeMillo and Lipton [6] introduced fault-based attacks...
SIAMDM
2000
14 years 9 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
IACR
2011
13 years 9 months ago
2011
We present a radically new approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions. A central conceptual con...
STACS
2007
Springer
15 years 3 months ago
2007
Springer
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
ICRA
2002
IEEE
15 years 2 months ago
2002
IEEE
This paper presents an algorithm for simultaneous localization and mapping for a mobile robot using monocular vision and odometry. The approach uses Variable State Dimension Filte...