325 search results - page 22 / 65 » Concurrent Composition of Secure Protocols in the Timing Mod... |
173
click to vote
HASKELL
2009
ACM
15 years 10 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...
180
click to vote
CSFW
2000
IEEE
15 years 8 months ago
2000
IEEE
Some of the non interference properties studied in [4, 6, 18] for information flow analysis in computer systems, notably Æ , are reformulated here in a realtime setting. This is...
140
click to vote
IFM
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We present a framework for model checking concurrent software systems which incorporates both states and events. Contrary to other state/event approaches, our work also i...
120
Voted
IACR
2011
14 years 3 months ago
2011
We put forward a framework for the modular design and analysis of multi-party protocols. Our framework is called “GNUC” (with the recursive meaning “GNUC’s Not UC”), alr...
252
Voted
CRYPTO
2004
Springer
15 years 9 months ago
2004
Springer
In the bare public-key model (BPK in short), each verifier is assumed to have deposited a public key in a file that is accessible by all users at all times. In this model, intro...