Sciweavers

1845 search results - page 313 / 369
» Computing the Angularity Tolerance
Sort
View
ISCA
1999
IEEE
187views Hardware» more  ISCA 1999»
14 years 2 months ago
Area Efficient Architectures for Information Integrity in Cache Memories
Information integrity in cache memories is a fundamental requirement for dependable computing. Conventional architectures for enhancing cache reliability using check codes make it...
Seongwoo Kim, Arun K. Somani
FC
1999
Springer
102views Cryptology» more  FC 1999»
14 years 2 months ago
Risk Management for E-Cash Systems with Partial Real-Time Audit
We analyze “coin-wallet” and “balance-wallet” under partial real-time audit, and compute upper bounds on theft due to the fact that not all the transactions are audited in ...
Yacov Yacobi
ATAL
2006
Springer
14 years 1 months ago
Balancing the needs of players and spectators in agent-based commentary systems
We describe an agent-based commentary system for computer games which produces real-time and post-game commentary for spectators. Our system adopts an embodied approach in which r...
Dan Fielding, Brian Logan, Steve Benford
CCS
2006
ACM
14 years 1 months ago
Lightweight, pollution-attack resistant multicast authentication scheme
Authentication is an important security measure for multicast applications, providing receivers with confidence that the packets they receive are valid. Simply signing every multi...
Ya-Jeng Lin, Shiuhpyng Shieh, Warren W. Lin
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
14 years 1 months ago
On Expected Constant-Round Protocols for Byzantine Agreement
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. H...
Jonathan Katz, Chiu-Yuen Koo