Sciweavers

325 search results - page 63 / 65
» Concurrent Composition of Secure Protocols in the Timing Mod...
Sort
View
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
13 years 9 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
NCA
2007
IEEE
14 years 15 days ago
Decoupled Quorum-Based Byzantine-Resilient Coordination in Open Distributed Systems
Open distributed systems are typically composed by an unknown number of processes running in heterogeneous hosts. Their communication often requires tolerance to temporary disconn...
Alysson Neves Bessani, Miguel Correia, Joni da Sil...
ICFEM
2009
Springer
14 years 24 days ago
Combining Static Model Checking with Dynamic Enforcement Using the Statecall Policy Language
Internet protocols encapsulate a significant amount of state, making implementing the host software complex. In this paper, we define the Statecall Policy Language (SPL) which pr...
Anil Madhavapeddy
ASE
2002
160views more  ASE 2002»
13 years 6 months ago
Proving Invariants of I/O Automata with TAME
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
Myla Archer, Constance L. Heitmeyer, Elvinia Ricco...
ANSS
2005
IEEE
13 years 12 months ago
J-Sim: A Simulation Environment for Wireless Sensor Networks
Wireless Sensor Networks (WSNs) have gained considerable attention in the past few years. As such, there has been an increasing need for defining and developing simulation framew...
Ahmed Sobeih, Wei-Peng Chen, Jennifer C. Hou, Lu-C...