Sciweavers

577 search results - page 23 / 116
» Engineering Sufficiently Secure Computing
Sort
View
82
Voted
OOPSLA
2005
Springer
15 years 3 months ago
A delta-driven execution model for semantic computing
We describe (and demonstrate) the execution model of a computing platform where computation is both incremental and data-driven. We call such an approach delta-driven. The platfor...
Roly Perera, Jeff Foster, György Koch
IJISEC
2002
58views more  IJISEC 2002»
14 years 9 months ago
A complete characterization of a family of key exchange protocols
Using a random deal of cards to players and a computationally unlimited eavesdropper, all players wish to share a one-bit secret key which is informationtheoretically secure from t...
Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki
85
Voted
FOSSACS
2006
Springer
15 years 1 months ago
Guessing Attacks and the Computational Soundness of Static Equivalence
The indistinguishability of two pieces of data (or two lists of pieces of data) can be represented formally in terms of a relation called static equivalence. Static equivalence dep...
Martín Abadi, Mathieu Baudet, Bogdan Warins...
COMPSAC
2004
IEEE
15 years 1 months ago
Services-Oriented Dynamic Reconfiguration Framework for Dependable Distributed Computing
Web services (WS) received significant attention recently because services can be searched, bound, and executed at runtime over the Internet. This paper proposes a dynamic reconfi...
Wei-Tek Tsai, Weiwei Song, Raymond A. Paul, Zhibin...
CCS
2010
ACM
14 years 9 months ago
On the soundness of authenticate-then-encrypt: formalizing the malleability of symmetric encryption
A communication channel from an honest sender A to an honest receiver B can be described as a system with three interfaces labeled A, B, and E (the adversary), respectively, where...
Ueli Maurer, Björn Tackmann