Sciweavers

849 search results - page 25 / 170
» Completely Non-malleable Schemes
Sort
View
ACSAC
2009
IEEE
14 years 6 months ago
A Study of User-Friendly Hash Comparison Schemes
—Several security protocols require a human to compare two hash values to ensure successful completion. When the hash values are represented as long sequences of numbers, humans ...
Hsu-Chun Hsiao, Yue-Hsun Lin, Ahren Studer, Cassan...
SMA
1997
ACM
120views Solid Modeling» more  SMA 1997»
14 years 3 months ago
The Generic Geometric Complex (GGC): A Modeling Scheme for Families of Decomposed Pointsets
: Modeling of families of geometric objects is a major topic in modern geometric and solid modeling. Object families are central to many important solid modeling applications, incl...
Ari Rappoport
ACSW
2006
14 years 18 days ago
Redundant parallel data transfer schemes for the grid environment
In this paper, we proposed dynamic co-allocation schemes for parallel data transfer in a grid environment, which copes up with highly inconsistent network performances of the serv...
Raghuvel S. Bhuvaneswaran, Yoshiaki Katayama, Naoh...
CATA
2003
14 years 17 days ago
A Task Migration Scheme for High Performance Real-Time Cluster System
In a real-time system, it is attractive to use cluster computing system for realizing high performance and high availability. The objectives of the real-time clusters are maximize...
Makoto Suzuki, Hidenori Kobayashi, Nobuyuki Yamasa...
ACNS
2004
Springer
131views Cryptology» more  ACNS 2004»
14 years 2 months ago
Evaluating Security of Voting Schemes in the Universal Composability Framework
In the literature, voting protocols are considered secure if they satisfy requirements such as privacy, accuracy, robustness, etc. It can be time consuming to evaluate a voting pr...
Jens Groth