Sciweavers

7924 search results - page 971 / 1585
» Non-Malleable Functions and Their Applications
Sort
View
MSS
2000
IEEE
96views Hardware» more  MSS 2000»
15 years 12 months ago
APRIL: A Run-Time Library for Tape-Resident Data
Over the last decade, processors have made enormous gains in speed. But increase in the speed of the secondary and tertiary storage devices could not cope with these gains. The re...
Gokhan Memik, Mahmut T. Kandemir, Alok N. Choudhar...
VR
2000
IEEE
103views Virtual Reality» more  VR 2000»
15 years 11 months ago
Extending Locales: Awareness Management in MASSIVE-3
Locales (as first embodied in the SPLINE system) are a very good approach to constructing and organising large virtual environments, especially for distributed and multiuser syste...
Jim Purbrick, Chris Greenhalgh
COMPGEOM
2000
ACM
15 years 11 months ago
When crossings count - approximating the minimum spanning tree
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
Sariel Har-Peled, Piotr Indyk
ASIACRYPT
2000
Springer
15 years 11 months ago
Increasing the Lifetime of a Key: A Comparative Analysis of the Security of Re-keying Techniques
Rather than use a shared key directly to cryptographically process (e.g. encrypt or authenticate) data one can use it as a master key to derive subkeys, and use the subkeys for the...
Michel Abdalla, Mihir Bellare
ICDE
2010
IEEE
248views Database» more  ICDE 2010»
15 years 11 months ago
MashRank: Towards uncertainty-aware and rank-aware mashups
Mashups are situational applications that build data flows to link the contents of multiple Web sources. Often times, ranking the results of a mashup is handled in a materializethe...
Mohamed A. Soliman, Mina Saleeb, Ihab F. Ilyas