54 search results - page 7 / 11 » On the Concurrent Composition of Zero-Knowledge Proofs |
FOCS
2003
IEEE
14 years 1 months ago
2003
IEEE
Concurrent general composition relates to a setting where a secure protocol is run in a network concurrently with other, arbitrary protocols. Clearly, security in such a setting i...
HASKELL
2009
ACM
14 years 3 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
JLP
2011
12 years 11 months ago
2011
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchange law: when applied in a trace model of program semantics, one of them stands...
FSTTCS
2003
Springer
14 years 1 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...
PLDI
2012
ACM
11 years 11 months ago
2012
ACM
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...