Sciweavers

117 search results - page 11 / 24
» Concurrent general composition of secure protocols in the ti...
Sort
View
ACISP
2009
Springer
14 years 1 months ago
Towards Denial-of-Service-Resilient Key Agreement Protocols
Denial of service resilience is an important practical consideration for key agreement protocols in any hostile environment such as the Internet. There are well-known models that ...
Douglas Stebila, Berkant Ustaoglu
ICALP
1994
Springer
13 years 10 months ago
Liveness in Timed and Untimed Systems
When provingthe correctness of algorithmsin distributed systems, one generally considers safety conditions and liveness conditions. The Input Output I O automaton model and its ti...
Rainer Gawlick, Roberto Segala, Jørgen F. S...
ICDM
2006
IEEE
131views Data Mining» more  ICDM 2006»
14 years 23 days ago
Transforming Semi-Honest Protocols to Ensure Accountability
The secure multi-party computation (SMC) model provides means for balancing the use and confidentiality of distributed data. This is especially important in the field of privacy...
Wei Jiang, Chris Clifton
LICS
1998
IEEE
13 years 10 months ago
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
Eugene W. Stark, Scott A. Smolka
PLDI
2012
ACM
11 years 9 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa