Recently Canetti, Krawczyk and Nielsen defined the notion of replayable adaptive chosen ciphertext attack (RCCA) secure encryption. Essentially a cryptosystem that is RCCA secure has full CCA2 security except for the little detail that it may be possible to modify a ciphertext into another ciphertext containing the same plaintext. We investigate the possibility of perfectly replayable RCCA secu...

Pseudo-random sequences with good correlation properties and large linear span are widely used in code-division multiple-access (CDMA) communication systems and cryptology for reliable and secure information transmission. In this paper, sequences with long period, large complexity, balance statistics and low correlation properties are constructed from the addition of m-sequences with pairwise-p...

An (N ;n,m, {w1, . . . , wt})-separating hash family is a set H of N functions h : X −→ Y with |X| = n, |Y | = m, t ≥ 2 having the following property. For any pairwise disjoint subsets C1, . . . , Ct ⊆ X with |Ci| = wi, i = 1, . . . , t, there exists at least one function h ∈ H such that h(C1), h(C2), . . . , h(Ct) are pairwise disjoint. Separating hash families generalize many known combinator...

certificateless public key cryptography (cl-pkc) is a useful method in order to solve the problems of traditional public key infrastructure (i. e. large amount of computation, storage and communication cost for managing certificates) and id-based public key cryptography (i. e. key escrow problem), simultaneously. a signcryption scheme is an important primitive in cryptographic protocols which p...