Abstract. Online ciphers are deterministic length-preserving permutations EK : ({0, 1}n )+ → ({0, 1}n )+ where the i-th block of ciphertext depends only on the first i blocks of...
Most large shared-memory multiprocessors use directory protocols to keep per-processor caches coherent. Some memory references in such systems, however, suffer long latencies for ...
This study empirically examines the general propositions of media capacity theories using a newer and increasing popular communication medium: Instant Messaging. We developed hypo...
Abstract. We investigate a general paradigm for constructing arbitraryinput-length (AIL) MACs from fixed-input-length (FIL) MACs, define the waste as the relevant efficiency para...
Abstract—The relay channel with private messages (RCPM) is a generalized relay channel model where in addition to the traditional communication from source to destination (assist...