Sciweavers

3504 search results - page 515 / 701
» Secure protocol composition
Sort
View
CCS
2006
ACM
15 years 5 months ago
Providing witness anonymity in peer-to-peer systems
In this paper, we introduce the concept of witness anonymity for peer-to-peer systems. Witness anonymity combines the seemingly conflicting requirements of anonymity (for honest p...
Bo Zhu, Sanjeev Setia, Sushil Jajodia
PODC
2009
ACM
16 years 2 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
ICSE
2009
IEEE-ACM
16 years 2 months ago
Modular string-sensitive permission analysis with demand-driven precision
In modern software systems, programs are obtained by dynamically assembling components. This has made it necessary to subject component providers to access-control restrictions. W...
Emmanuel Geay, Marco Pistoia, Takaaki Tateishi, Ba...
SOCO
2009
Springer
15 years 8 months ago
Specifying and Composing Non-functional Requirements in Model-Based Development
Abstract. Non-functional requirements encompass important design concerns such as schedulability, security, and communication constraints. In model-based development they non-local...
Ethan K. Jackson, Dirk Seifert, Markus Dahlweid, T...
126
Voted
CONCUR
2001
Springer
15 years 6 months ago
Probabilistic Information Flow in a Process Algebra
We present a process algebraic approach for extending to the probabilistic setting the classical logical information flow analysis of computer systems. In particular, we employ a ...
Alessandro Aldini