Sciweavers

963 search results - page 110 / 193
» Conditional Digital Signatures
Sort
View
JALC
2006
87views more  JALC 2006»
13 years 10 months ago
A Team Automaton Scenario for the Analysis of Security Properties of Communication Protocols
Formal methods are a popular means to specify and verify security properties of a variety of communication protocols. In this article we take a step towards the use of team automa...
Maurice H. ter Beek, Gabriele Lenzini, Marinella P...
ENTCS
2007
129views more  ENTCS 2007»
13 years 10 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 ...
SOCO
2008
Springer
13 years 10 months ago
Component-Based Access Control: Secure Software Composition through Static Analysis
Abstract. Extensible Component Platforms support the discovery, installation, starting, uninstallation of components at runtime. Since they are often targeted at mobile resource-co...
Pierre Parrend, Stéphane Frénot
TIFS
2008
145views more  TIFS 2008»
13 years 10 months ago
Physical-Layer Authentication
Authentication is the process where claims of identity are verified. Most mechanisms of authentication (e.g., digital signatures and certificates) exist above the physical layer, t...
Paul L. Yu, John S. Baras, Brian M. Sadler
CORR
2004
Springer
107views Education» more  CORR 2004»
13 years 10 months ago
Security of public key cryptosystems based on Chebyshev Polynomials
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptogra...
Pina Bergamo, Paolo D'Arco, Alfredo De Santis, Lju...