5484 search results - page 32 / 1097 » Almost-Everywhere Secure Computation |
CRYPTO
2001
Springer
15 years 4 months ago
2001
Springer
In this paper we show that any two-party functionality can be securely computed in a constant number of rounds, where security is obtained against malicious adversaries that may ar...
SP
1987
IEEE
15 years 3 months ago
1987
IEEE
Most discussions of computer security focus on control of disclosure. In Particular, the U.S. Department of Defense has developed a set of criteria for computer mechanisms to prov...
101
click to vote
SP
2006
IEEE
15 years 5 months ago
2006
IEEE
We present a new mechanized prover for secrecy properties of security protocols. In contrast to most previous provers, our tool does not rely on the Dolev-Yao model, but on the co...
103
click to vote
CCS
2008
ACM
15 years 1 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...
CSFW
2006
IEEE
15 years 5 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...