Sciweavers

1518 search results - page 2 / 304
» Cryptographic Test Correction
Sort
View
ACNS
2006
Springer
241views Cryptology» more  ACNS 2006»
13 years 11 months ago
High Diffusion Cipher: Encryption and Error Correction in a Single Cryptographic Primitive
In this paper we combine the error correction and encryption functionality into one block cipher, which we call High Diffusion (HD) cipher. The error correcting property of this ci...
Chetan Nanjunda Mathur, Karthik Narayan, K. P. Sub...
IPPS
2008
IEEE
14 years 1 months ago
What is the best way to prove a cryptographic protocol correct?
In this paper, we identify that protocol verification using invariants have significant limitations such as inapplicability to some protocols, non-standard attacker inferences a...
Sreekanth Malladi, Gurdeep S. Hura
SCP
2008
91views more  SCP 2008»
13 years 7 months ago
Towards mechanized correctness proofs for cryptographic algorithms: Axiomatization of a probabilistic Hoare style logic
In [5] we build a formal verification technique for game based correctness proofs of cryptograhic algorithms based on a probabilistic Hoare style logic [10]. An important step towa...
Jerry den Hartog
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 7 months ago
Automatic Verification of Correspondences for Security Protocols
We present a new technique for verifying correspondences in security protocols. In particular, correspondences can be used to formalize authentication. Our technique is fully auto...
Bruno Blanchet
FC
2005
Springer
134views Cryptology» more  FC 2005»
14 years 27 days ago
Analysis of a Multi-party Fair Exchange Protocol and Formal Proof of Correctness in the Strand Space Model
Abstract. A multi-party fair exchange protocol is a cryptographic protocol allowing several parties to exchange commodities in such a way that everyone gives an item away if and on...
Aybek Mukhamedov, Steve Kremer, Eike Ritter