38 search results - page 5 / 8 » Probabilistic Noninterference in a Concurrent Language |
POPL
2008
ACM
14 years 7 months ago
2008
ACM
In language-based security, confidentiality and integrity policies conveniently specify the permitted flows of information between different parts of a program with diverse levels...
STOC
1998
ACM
13 years 11 months ago
1998
ACM
Abstract. Loosely speaking, an interactive proof is said to be zeroknowledge if the view of every “efficient” verifier can be “efficiently” simulated. An outstanding open ...
CCS
2011
ACM
12 years 7 months ago
2011
ACM
We develop a flexible information-flow type system for a range of encryption primitives, precisely reflecting their diverse functional and security features. Our rules enable e...
CONCUR
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. We extend cc to allow the specification of a discrete probability distribution for random variables. We demonstrate the expressiveness of pcc by synthesizing combinators...
CSFW
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract. Interactive programs allow users to engage in input and output throughout execution. The ubiquity of such programs motivates the development of models for reasoning about...