54 search results - page 7 / 11 » On the Concurrent Composition of Zero-Knowledge Proofs |
143
Voted
FOCS
2003
IEEE
15 years 4 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...
128
click to vote
HASKELL
2009
ACM
15 years 6 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
14 years 2 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...
103
click to vote
FSTTCS
2003
Springer
15 years 4 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...
124
click to vote
PLDI
2012
ACM
13 years 2 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...