Sciweavers

242 search results - page 40 / 49
» Randomness in Cryptography
Sort
View
CSREASAM
2006
14 years 11 months ago
Cryptcoding - Encryption and Error-Correction Coding in a Single Step
In this paper we re-open a 25 years old question of joint encryption and error-correction coding, named here as Cryptcoding. Cryptcoding is a procedure in which encryption/decrypti...
Danilo Gligoroski, Svein J. Knapskog, Suzana Andov...
CORR
2006
Springer
206views Education» more  CORR 2006»
14 years 9 months ago
ANAP: Anonymous Authentication Protocol in Mobile Ad hoc Networks
The pervasiveness of wireless communication recently gave mobile ad hoc networks (MANET) a significant researcher's attention, due to its innate capabilities of instant commu...
Tomasz Ciszkowski, Zbigniew Kotulski
85
Voted
ENTCS
2006
145views more  ENTCS 2006»
14 years 9 months ago
Real-or-random Key Secrecy of the Otway-Rees Protocol via a Symbolic Security Proof
We present the first cryptographically sound security proof of the well-known Otway-Rees protocol. More precisely, we show that the protocol is secure against arbitrary active att...
Michael Backes
74
Voted
IJNSEC
2006
113views more  IJNSEC 2006»
14 years 9 months ago
An Identity-based Mediated Signature Scheme from Bilinear Pairing
It has always been a critical issue to find efficient methods for fast revocation of a user's identity in identity (ID)based cryptosystems. Unfortunately, none of the previou...
Xiangguo Cheng, Lifeng Guo, Xinmei Wang
ENTCS
2007
129views more  ENTCS 2007»
14 years 9 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 ...