5476 search results - page 47 / 1096 » Resettably Secure Computation |
136
click to vote
CCS
2008
ACM
15 years 5 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...
132
Voted
CSFW
2006
IEEE
15 years 9 months 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...
125
Voted
NSPW
2004
ACM
15 years 9 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...
136
Voted
SOUPS
2010
ACM
15 years 7 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...
136
Voted
CTRSA
2009
Springer
15 years 10 months 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...