Ooverwhelming growth in communication technology and usage of internet has greatly facilitated transfer of data. The threat of unauthorized data access is increasing along with it. Since last decade, too many data hiding methods have been proposed. Because of large number of redundant bits, image has become popular carrier for data hiding techniques. The advancement in image steganography has p...

Micropayments (payments worth a few pennies) have numerous potential applications. A challenge in achieving them is that payment networks charge fees that are high compared to “micro” sums of money. Wheeler (1996) and Rivest (1997) proposed probabilistic payments as a technique to achieve micropayments: a merchant receives a macro-value payment with a given probability so that, in expectation, ...

A new authenticated encryption (AE) mode for blockcipher is presented. The proposed scheme has attractive features for fast and compact operation. It requires rate-1 blockcipher call, and uses the encryption function of a blockcipher for both encryption and decryption. Moreover, the scheme enables one-pass, parallel operation under two-block partition. The proposed scheme thus attains similar c...

We present an implementation of a method for finding counterexamples to universally quantified conjectures in first-order logic. Our method uses the proof by consistency strategy to guide a search for a counterexample and a standard first-order theorem prover to perform a concurrent check for inconsistency. We explain briefly the theory behind the method, describe our implementation, and evalua...

Vienna Fortran, a machine-independent language extension to Fortran which allows the user to write programs for distributed-memory systems using global addresses, provides the forall loop construct for specifying irregular computations that do not cause inter-iteration dependences. Compilers for distributed-memory systems cannot generate eecient code for such loops using compile-time techniques...

This paper presents compact message formats for onion routing circuit construction using the Sphinx methodology developed for mixes. We significantly compress the circuit construction messages for three onion routing protocols that have emerged as enhancements to the Tor anonymizing network; namely, Tor with predistributed DiffieHellman values, pairing-based onion routing, and certificateless o...

The steady progress of information extraction systems has been helped by sound methodologies for evaluating their performance in controlled experiments. Annual events like MUC, ACE and TAC have developed evaluation approaches enabling researchers to score and rank their systems relative to reference results. Yet these evaluations have only assessed component technologies needed by a knowledge b...

We derive universal classical-quantum superposition coding and multiple access channel by using generalized packing lemmas for the type method. Using our code, we establish capacity region of a compound broadcast with degraded message sets. Our codes have two types codes. One is code joint decoding other separate decoding. It not so easy to construct former that universally achieves general poi...

Message Authentication Codes (MACs) are a valuable tool for ensuring the integrity of messages. MACs may be built around a keyed hash function. In this paper, we propose three variations on NH (a universal hash function explored in UMAC [1]), namely PH, PR and WH. Our main motivation was to prove that universal hash functions can be employed to provide provable security in ultra-low-power appli...