Sciweavers

298 search results - page 56 / 60
» Strong Anonymous Signatures
Sort
View
CLUSTER
2006
IEEE
13 years 11 months ago
Modeling Network Contention Effects on All-to-All Operations
One of the most important collective communication patterns used in scientific applications is the complete exchange, also called All-to-All. Although efficient complete exchange ...
Luiz Angelo Steffenel
CRYPTO
2006
Springer
125views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Automated Security Proofs with Sequences of Games
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
Bruno Blanchet, David Pointcheval
CSL
2006
Springer
13 years 11 months ago
Relating Two Standard Notions of Secrecy
Abstract. Two styles of definitions are usually considered to express that a security protocol preserves the confidentiality of a data s. Reachability-based secrecy means that s sh...
Véronique Cortier, Michaël Rusinowitch...
ADHOC
2008
132views more  ADHOC 2008»
13 years 7 months ago
Defending against cache consistency attacks in wireless ad hoc networks
Caching techniques can be used to reduce bandwidth consumption and data access delay in wireless ad hoc networks. When cache is used, the issue of cache consistency must be addres...
Wensheng Zhang, Guohong Cao
ENTCS
2007
129views more  ENTCS 2007»
13 years 7 months ago
Protocol Composition Logic (PCL)
Protocol Composition Logic (PCL) is a logic for proving security properties of network protocols that use public and symmetric key cryptography. The logic is designed around a pro...
Anupam Datta, Ante Derek, John C. Mitchell, Arnab ...