Sciweavers

20175 search results - page 31 / 4035
» Is abstraction the key to computing
Sort
View
FC
2010
Springer
205views Cryptology» more  FC 2010»
15 years 4 months ago
On Robust Key Agreement Based on Public Key Authentication
—This paper discusses public-key authenticated key agreement protocols. First, we critically analyze several authenticated key agreement protocols and uncover various theoretical...
Feng Hao
138
Voted
SCN
2010
Springer
232views Communications» more  SCN 2010»
14 years 10 months ago
Authenticated Key Agreement with Key Re-use in the Short Authenticated Strings Model
Serge Vaudenay [20] introduced a notion of Message Authentication (MA) protocols in the Short Authenticated String (SAS) model. A SAS-MA protocol authenticates arbitrarily long mes...
Stanislaw Jarecki, Nitesh Saxena
67
Voted
ICRA
2009
IEEE
125views Robotics» more  ICRA 2009»
15 years 7 months ago
On computing robust n-finger force-closure grasps of 3D objects
Abstract— The paper deals with computing frictional forceclosure grasps of 3D objects problem. The key idea of the presented work is the demonstration that wrenches associated to...
Sahar El-Khoury, Anis Sahbani
ICALP
2004
Springer
15 years 5 months ago
A General Technique for Managing Strings in Comparison-Driven Data Structures
Abstract. This paper presents a general technique for optimally transforming any dynamic data structure D that operates on atomic and indivisible keys by constant-time comparisons,...
Gianni Franceschini, Roberto Grossi