Sciweavers

8644 search results - page 180 / 1729
» On the Composition of Secure Systems
Sort
View
FSTTCS
2003
Springer
15 years 12 months ago
A Cryptographically Sound Security Proof of the Needham-Schroeder-Lowe Public-Key Protocol
We prove the Needham-Schroeder-Lowe public-key protocol secure under real, active cryptographic attacks including concurrent protocol runs. This proof is based on an abstract crypt...
Michael Backes, Birgit Pfitzmann
EUROCRYPT
2007
Springer
15 years 10 months ago
Round-Efficient Secure Computation in Point-to-Point Networks
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
Jonathan Katz, Chiu-Yuen Koo
JALC
2006
87views more  JALC 2006»
15 years 6 months ago
A Team Automaton Scenario for the Analysis of Security Properties of Communication Protocols
Formal methods are a popular means to specify and verify security properties of a variety of communication protocols. In this article we take a step towards the use of team automa...
Maurice H. ter Beek, Gabriele Lenzini, Marinella P...
140
Voted
SACMAT
2009
ACM
16 years 1 months ago
Extending access control models with break-glass
Achim D. Brucker, Helmut Petritsch
ICIW
2007
IEEE
16 years 28 days ago
A New Security Scheme for Integration of Mobile Agents and Web Services
Web services specification provides an open standard for the distributed service oriented architecture. It is widely used in Internet and pervasive networks supporting wireless m...
Junqi Zhang, Yan Wang 0002, Vijay Varadharajan