Sciweavers

5476 search results - page 311 / 1096
» Resettably Secure Computation
Sort
View
NSPW
2006
ACM
16 years 22 days ago
Large-scale collection and sanitization of network security data: risks and challenges
Over the last several years, there has been an emerging interest in the development of widearea data collection and analysis centers to help identify, track, and formulate respons...
Phillip A. Porras, Vitaly Shmatikov
173
Voted
ASM
2005
ASM
16 years 9 days ago
Verifying Security Protocols: An ASM Approach
In this paper we present a modeling technique for security protocols using Abstract State Machines [BS03,Gur95] (ASMs). We describe how we model the different agents in the scenar...
Dominik Haneberg, Holger Grandy, Wolfgang Reif, Ge...
ESORICS
2006
Springer
15 years 10 months ago
Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos
Abstract We present a computational analysis of basic Kerberos with and without its public-key extension PKINIT in which we consider authentication and key secrecy properties. Our ...
Michael Backes, Iliano Cervesato, Aaron D. Jaggard...
197
Voted
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
15 years 11 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
MOBISYS
2011
ACM
14 years 9 months ago
Security versus energy tradeoffs in host-based mobile malware detection
The rapid growth of mobile malware necessitates the presence of robust malware detectors on mobile devices. However, running malware detectors on mobile devices may drain their ba...
Jeffrey Bickford, H. Andrés Lagar-Cavilla, ...