Sciweavers

6861 search results - page 145 / 1373
» Security for Ubiquitous Computing
Sort
View
CRYPTO
2001
Springer
144views Cryptology» more  CRYPTO 2001»
15 years 8 months ago
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
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...
Yehuda Lindell
SP
1987
IEEE
118views Security Privacy» more  SP 1987»
15 years 7 months ago
A Comparison of Commercial and Military Computer Security Policies
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...
D. D. Clark, D. R. Wilson
SP
2006
IEEE
147views Security Privacy» more  SP 2006»
15 years 10 months ago
A Computationally Sound Mechanized Prover for Security Protocols
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...
Bruno Blanchet
HPDC
1996
IEEE
15 years 8 months ago
Legion - A View from 50, 000 Feet
' The coming of giga-bit networks makes possible the realization ofa single nationwide virtual computer comprised of a variety of geographically distributed highpe6ormance mac...
Andrew S. Grimshaw, William A. Wulf
CCS
2008
ACM
15 years 6 months ago
Computational soundness of observational equivalence
Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishabili...
Hubert Comon-Lundh, Véronique Cortier