Sciweavers

900 search results - page 139 / 180
» Formalizing Ontological Commitment
Sort
View
ICDCS
2002
IEEE
15 years 4 months ago
The Complexity of Adding Failsafe Fault-Tolerance
In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) progra...
Sandeep S. Kulkarni, Ali Ebnenasir
PKC
2010
Springer
148views Cryptology» more  PKC 2010»
15 years 3 months ago
On the Feasibility of Consistent Computations
In many practical settings, participants are willing to deviate from the protocol only if they remain undetected. Aumann and Lindell introduced a concept of covert adversaries to f...
Sven Laur, Helger Lipmaa
FSEN
2009
Springer
15 years 3 months ago
Executable Interface Specifications for Testing Asynchronous Creol Components
We propose and explore a formal approach for black-box testing asynchronously communicating components in open environments. Asynchronicity poses a challenge for validating and tes...
Immo Grabe, Marcel Kyas, Martin Steffen, Arild B. ...
ASIACRYPT
2008
Springer
15 years 1 months ago
Ambiguous Optimistic Fair Exchange
Optimistic fair exchange (OFE) is a protocol for solving the problem of exchanging items or services in a fair manner between two parties, a signer and a verifier, with the help o...
Qiong Huang, Guomin Yang, Duncan S. Wong, Willy Su...
CISC
2008
Springer
148views Cryptology» more  CISC 2008»
15 years 1 months ago
Publicly Verifiable Privacy-Preserving Group Decryption
Anonymity is one of the main concerns in group-oriented cryptography. However, most efforts, for instance, group signatures and ring signatures, are only made to provide anonymity ...
Bo Qin, Qianhong Wu, Willy Susilo, Yi Mu