Sciweavers

1777 search results - page 230 / 356
» Programming Cryptographic Protocols
Sort
View
FOCS
2007
IEEE
14 years 3 months ago
Covert Multi-Party Computation
In STOC’05, Ahn, Hopper and Langford introduced the notion of covert computation. A covert computation protocol is one in which parties can run a protocol without knowing if oth...
Nishanth Chandran, Vipul Goyal, Rafail Ostrovsky, ...
MPC
2004
Springer
97views Mathematics» more  MPC 2004»
14 years 2 months ago
Friends Need a Bit More: Maintaining Invariants Over Shared State
A friendship system is introduced for modular static verification of object invariants. It extends a previous methodology, based on ownership hierarchy encoded in auxiliary state,...
Michael Barnett, David A. Naumann
APLAS
2007
ACM
14 years 27 days ago
Timed, Distributed, Probabilistic, Typed Processes
This paper studies types and probabilistic bisimulations for a timed -calculus as an effective tool for a compositional analysis of probabilistic distributed behaviour. The types c...
Martin Berger, Nobuko Yoshida
ECOOP
2006
Springer
14 years 17 days ago
Modular Software Upgrades for Distributed Systems
Abstract. Upgrading the software of long-lived, highly-available distributed systems is difficult. It is not possible to upgrade all the nodes in a system at once, since some nodes...
Sameer Ajmani, Barbara Liskov, Liuba Shrira
DAGSTUHL
2008
13 years 10 months ago
Mathematica Connectivity to Interval Libraries filib++ and C-XSC
Abstract. Building interval software interoperability can be a good solution when re-using high-quality legacy code or when accessing functionalities unavailable natively in one of...
Evgenija D. Popova