5476 search results - page 47 / 1096 » Resettably Secure Computation |
170
click to vote
CCS
2008
ACM
15 years 8 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...
174
click to vote
CSFW
2006
IEEE
16 years 7 days ago
2006
IEEE
We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventiona...
150
click to vote
NSPW
2004
ACM
15 years 11 months ago
2004
ACM
Current models of Internet Computing are highly asymmetric – a host protects itself from malicious mobile Java programs, but there is no way to get assurances about the behavior...
169
click to vote
SOUPS
2010
ACM
15 years 10 months ago
2010
ACM
Home computer systems are frequently insecure because they are administered by untrained, unskilled users. The rise of botnets has amplified this problem; attackers can compromis...
176
click to vote
CTRSA
2009
Springer
16 years 29 days ago
2009
Springer
In the setting of multiparty computation a set of parties with private inputs wish to compute some joint function of their inputs, whilst preserving certain security properties (l...