Given two or more video sequences containing similar human activities (running, jumping, etc.) we want to devise a method which extracts spatio-temporal signatures associated with these activities, compares these signatures, and aligns key positions of different videos. In this paper we introduce a method which, in conjunction with a number of hypotheses, allows the analysis of the motion of sp...

Motivated by the problem of one-time password generation, we introduce the notion of adjustable signature schemes that allow the length of a signature to be adjusted—at the setup, signing or verification stages, depending on the application. We provide security definitions that precisely capture the trade-off between signature length and security for such schemes. We then provide both concrete ...

Novel contract signing protocol based on the OTPK scheme were recommended. OTPK means one time password key. This recommended protocol capable will be brought into action only if one party fails to sign the to permit two parties to sign the matching contract and then those parties can exchange their digital signatures. The protocol proficient to ensure fairness in and it offers parties with gre...

The advent of electronic voting gives rise to a new threat: Adversaries may execute undetectable, automated attacks against the system. Elections are often secured through complex policies, which may be difficult to enforce; Completely Automated Public Turing Tests to Tell Computers and Humans Apart (CAPTCHAs) provide an inexpensive alternative. The goal of this study is to introduce a unique a...

Abstract— Multicast has been envisioned to be useful in many Smart Grid applications such as demand-response, wide area protection, in-substation protection, and various operation and control. Since the multicast messages are related to critical control, authentication is necessary to prevent message forgery attacks. In this paper, we first identify the requirements of multicast communication a...

A one-time signature scheme using run-length encoding is presented, that in the random oracle model offers security against chosen-message attacks. For parameters of interest, the proposed scheme enables about 33% faster verification with a comparable signature size than a construction of Merkle and Winternitz. The public key size remains unchanged (1 hash value). The main price for the faster ...

A minimal cutset of a tree directed from the leaves to the root is a minimal set of vertices such that every path from a leaf to the root meets at least one of these vertices. An order relation on the set of minmal cutsets can be deened: U V if and only if every vertex of U is on the path from some vertex in V to the root. Motivated by the design of eecient cryptographic digital signature schem...

We show that the Winternitz one-time signature scheme is existentially unforgeable under adaptive chosen message attacks when instantiated with a family of pseudo random functions. Compared to previous results, which require a collision resistant hash function, our result provides significantly smaller signatures at the same security level. We also consider security in the strong sense and show...