325 search results - page 4 / 65 » Concurrent Composition of Secure Protocols in the Timing Mod... |
FSTTCS
2003
Springer
13 years 11 months ago
2003
Springer
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...
CSFW
2007
IEEE
14 years 10 days ago
2007
IEEE
Task-PIOA is a modeling framework for distributed systems with both probabilistic and nondeterministic behaviors. It is suitable for cryptographic applications because its task-bas...
ICFEM
2010
Springer
13 years 4 months ago
2010
Springer
The correct behavior of a service composition depends on the appropriate coordination of its services. According to the idea of channelbased coordination, services exchange message...
TKDE
2002
13 years 5 months ago
2002
Database systems for real-time applications must satisfy timing constraints associated with transactions. Typically, a timing constraint is expressed in the form of a deadline and ...
FOCS
2003
IEEE
13 years 11 months ago
2003
IEEE
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...