Sciweavers

3115 search results - page 361 / 623
» Synthesizing Secure Protocols
Sort
View
FC
2000
Springer
83views Cryptology» more  FC 2000»
15 years 10 months ago
Secret Key Authentication with Software-Only Verification
Abstract Two protocols for authentication based on symmetric key cryptography are described, where the verifier can be implemented in software completely, without the need for secu...
Jaap-Henk Hoepman
ENTCS
2006
103views more  ENTCS 2006»
15 years 6 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
MASS
2010
181views Communications» more  MASS 2010»
15 years 4 months 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
INFOCOM
2012
IEEE
14 years 4 months 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...
TCC
2010
Springer
169views Cryptology» more  TCC 2010»
16 years 3 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...