Sciweavers

56 search results - page 8 / 12
» Cryptographically verified implementations for TLS
Sort
View
PERCOM
2005
ACM
14 years 7 months ago
Secure Routing and Intrusion Detection in Ad Hoc Networks
Numerous schemes have been proposed for secure routing protocols, and Intrusion Detection and Response Systems, for ad hoc networks. In this paper, we present a proof-of-concept i...
Anand Patwardhan, Jim Parker, Anupam Joshi, Michae...
TACAS
2007
Springer
105views Algorithms» more  TACAS 2007»
14 years 1 months ago
Hoare Logic for Realistically Modelled Machine Code
This paper presents a mechanised Hoare-style programming logic framework for assembly level programs. The framework has been designed to fit on top of operational semantics of rea...
Magnus O. Myreen, Michael J. C. Gordon
ISCN
2006
IEEE
14 years 1 months ago
An optimistic fair e-commerce protocol for large e-goods
Suppose two entities that do not trust each other want to exchange some arbitrary data over a public channel. A fair exchange protocol ensures that both parties get what they want ...
Cagil Can Oniz, Erkay Savas, Albert Levi
CORR
2006
Springer
82views Education» more  CORR 2006»
13 years 7 months ago
Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
Véronique Cortier, Heinrich Hördegen, ...
FDTC
2010
Springer
138views Cryptology» more  FDTC 2010»
13 years 5 months ago
A Continuous Fault Countermeasure for AES Providing a Constant Error Detection Rate
Many implementations of cryptographic algorithms have shown to be susceptible to fault attacks. For some of them, countermeasures against specific fault models have been proposed. ...
Marcel Medwed, Jörn-Marc Schmidt