1546 search results - page 56 / 310 » Context-Aware Computing with Sound |
124
click to vote
TCS
2008
15 years 4 months ago
2008
This paper provides one more step towards bridging the gap between the formal and computational approaches to the verification of cryptographic protocols. We extend the well-known ...
126
click to vote
ESOP
2005
Springer
15 years 10 months ago
2005
Springer
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...
111
click to vote
FSTTCS
2007
Springer
15 years 10 months ago
2007
Springer
Type systems for secure information flow aim to prevent a program from leaking information from variables that hold secret data to variables that hold public data. In this work we...
127
click to vote
CSFW
2005
IEEE
15 years 10 months ago
2005
IEEE
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...
140
click to vote
CCS
2008
ACM
15 years 6 months ago
2008
ACM
Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishabili...