Sciweavers

3504 search results - page 417 / 701
» Secure protocol composition
Sort
View
116
Voted
ENTCS
2006
103views more  ENTCS 2006»
15 years 2 months ago
Static Equivalence is Harder than Knowledge
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
Johannes Borgström
139
Voted
MASS
2010
181views Communications» more  MASS 2010»
15 years 14 days ago
Perfectly anonymous data aggregation in wireless sensor networks
Clustering and data aggregation in wireless sensor networks improves scalability, and helps the efficient use of scarce resources. Yet, these mechanisms also introduce some securi...
Levente Buttyán, Tamás Holczer
264
Voted
INFOCOM
2012
IEEE
14 years 26 days ago
Expected loss bounds for authentication in constrained channels
We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy conditions and communication costs. This is motivated by a numbe...
Christos Dimitrakakis, Aikaterini Mitrokotsa, Serg...
117
Voted
TCC
2010
Springer
169views Cryptology» more  TCC 2010»
15 years 11 months ago
On Complete Primitives for Fairness
Abstract. For secure two-party and multi-party computation with abort, classification of which primitives are complete has been extensively studied in the literature. However, for...
S. Dov Gordon, Yuval Ishai, Tal Moran, Rafail Ostr...
134
Voted
SP
1998
IEEE
173views Security Privacy» more  SP 1998»
15 years 6 months ago
An Automated Approach for Identifying Potential Vulnerabilities in Software
This paper presents results from analyzing the vulnerability of security-critical software applications to malicious threats and anomalous events using an automated fault injectio...
Anup K. Ghosh, Tom O'Connor, Gary McGraw