Sciweavers

9166 search results - page 1488 / 1834
» A framework for comparing models of computation
Sort
View
FDTC
2006
Springer
102views Cryptology» more  FDTC 2006»
15 years 10 months ago
Cryptographic Key Reliable Lifetimes: Bounding the Risk of Key Exposure in the Presence of Faults
With physical attacks threatening the security of current cryptographic schemes, no security policy can be developed without taking into account the physical nature of computation....
Alfonso De Gregorio
SC
1991
ACM
15 years 10 months ago
Delayed consistency and its effects on the miss rate of parallel programs
In cache based multiprocessors a protocol must maintain coherence among replicated copies of shared writable data. In delayed consistency protocols the effect of out-going and in-...
Michel Dubois, Jin-Chin Wang, Luiz André Ba...
ICPR
2010
IEEE
15 years 10 months ago
Recognition and Prediction of Situations in Urban Traffic Scenarios
The recognition and prediction of intersection situations and an accompanying threat assessment are an indispensable skill of future driver assistance systems. This study focuses o...
Eugen Käfer, Christoph Hermes, Christian Wöhler,...
FSE
2010
Springer
146views Cryptology» more  FSE 2010»
15 years 10 months ago
A Unified Method for Improving PRF Bounds for a Class of Blockcipher Based MACs
This paper provides a unified framework for improving PRF (pseudorandom function) advantages of several popular MACs (message authentication codes) based on a blockcipher modeled a...
Mridul Nandi
CSR
2009
Springer
15 years 10 months ago
Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise ...
Olaf Beyersdorff, Zenon Sadowski
« Prev « First page 1488 / 1834 Last » Next »