Sciweavers

122 search results - page 17 / 25
» Achieving Security Despite Compromise Using Zero-knowledge
Sort
View
89
Voted
CRYPTO
2011
Springer
207views Cryptology» more  CRYPTO 2011»
13 years 9 months ago
Secure Computation on the Web: Computing without Simultaneous Interaction
Secure computation enables mutually suspicious parties to compute a joint function of their private inputs while providing strong security guarantees. Amongst other things, even i...
Shai Halevi, Yehuda Lindell, Benny Pinkas
INFOCOM
2006
IEEE
15 years 3 months ago
Establishing Pair-Wise Keys in Heterogeneous Sensor Networks
— Many applications that make use of sensor networks require secure communication. Because asymmetric-key solutions are difficult to implement in such a resource-constrained env...
Patrick Traynor, Heesook Choi, Guohong Cao, Sencun...
EUROCRYPT
2008
Springer
14 years 11 months ago
Almost-Everywhere Secure Computation
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
Juan A. Garay, Rafail Ostrovsky
MICRO
2008
IEEE
103views Hardware» more  MICRO 2008»
15 years 3 months ago
Testudo: Heavyweight security analysis via statistical sampling
Heavyweight security analysis systems, such as taint analysis and dynamic type checking, are powerful technologies used to detect security vulnerabilities and software bugs. Tradi...
Joseph L. Greathouse, Ilya Wagner, David A. Ramos,...
ESORICS
2009
Springer
15 years 10 months ago
Model-Checking DoS Amplification for VoIP Session Initiation
Current techniques for the formal modeling analysis of DoS attacks do not adequately deal with amplification attacks that may target a complex distributed system as a whole rather ...
Carl A. Gunter, José Meseguer, Musab AlTurk...