Sciweavers

141 search results - page 6 / 29
» Verifying Generics and Delegates
Sort
View
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first...
Tal Moran, Moni Naor
ETFA
2008
IEEE
13 years 9 months ago
Hardware acceleration for verifiable, adaptive real-time communication
Distributed real-time applications implement distributed applications with timeliness requirements. Such systems require a deterministic communication medium with bounded communic...
Sebastian Fischmeister, Insup Lee, Robert Trausmut...
CN
2006
117views more  CN 2006»
13 years 7 months ago
Using equivalence-checking to verify robustness to denial of service
In this paper, we introduce a new security property which intends to capture the ability of a cryptographic protocol being resistant to denial of service. This property, called im...
Stéphane Lafrance
JCS
2002
118views more  JCS 2002»
13 years 7 months ago
Verified Formal Security Models for Multiapplicative Smart Cards
We present two generic formal security models for operating systems of multiapplicative smart cards. The models formalize the main security aspects of secrecy, integrity, secure co...
Gerhard Schellhorn, Wolfgang Reif, Axel Schairer, ...
HPCA
2007
IEEE
14 years 1 months ago
An Adaptive Cache Coherence Protocol Optimized for Producer-Consumer Sharing
Shared memory multiprocessors play an increasingly important role in enterprise and scientific computing facilities. Remote misses limit the performance of shared memory applicat...
Liqun Cheng, John B. Carter, Donglai Dai