Structure-preserving signature schemes can be very useful in the construction of new cryptographic operations like blind signatures. Recently several of these schemes have been proposed. The security of signature-preserving signature schemes is still proved by hand, which can be a laborious task. One of the ways to prove security of these schemes algebraic analysis can be used. We present an ap...

Blind signatures have proved an essential building block for applications that protect privacy while ensuring unforgeability, i.e., electronic cash and electronic voting. One of the oldest, and most efficient blind signature schemes is the one due to Schnorr that is based on his famous identification scheme. Although it was proposed over twenty years ago, its unforgeability remains an open prob...

This document describes a mechanism that enables the Transport Layer Security (TLS) server to resume sessions and avoid keeping per-client session state. The TLS server encapsulates the session state into a ticket and forwards it to the client. The client can subsequently resume a session using the obtained ticket. Salowey, et al. Standards Track [Page 1] RFC 4507 Stateless TLS Session Resumpti...

Past research shows that consumers tend to equate higher prices with higher value. However, it remains unclear whether consumers of athletic events follow the predictions of equity theory when attributing value to particular teams. We conducted 3 studies to investigate the existence and consequences of a disparity between men’s and women’s college basketball ticket prices. In Study 1, a survey ...

Kerberos is a network authentication protocol & is designed to provide strong authentication for client/server applications by using secret-key cryptography. Our research was aimed at enhancing the security of transactions over a network. In this paper, we used Kerberos Encryption Technique for authentication and transaction security in the network. Further, we created an Authentication Server ...

This paper uses delaying functions, functions that require signiicant calculation time, in the development of a one-pass lottery scheme in which winners are chosen fairly using only internal information. Since all this information may be published (even before the lottery closes), anyone can do the calculation and therefore verify that the winner was chosen correctly. Since the calculation uses...

Many practical MACs are designed by iterating applications of some xed-input-length (FIL) primitive, namely one like a block cipher or compression function that only applies to data of a xed length. Existing security analyses of these constructions either require a stronger security property from the FIL primitive (eg. pseudorandomness) than the unforgeability required of the nal MAC, or, as in...

In 2013, Baseri et al. proposed an untraceable off-line electronic cash scheme from the RSA cryptosystem. They used a method that injects the expiration date and the spenders identity onto the coin to prevent double spending. The authors claimed that the scheme provides the properties of anonymity, unforgeability, double spending detection, and date attachability. Unfortunately, we find that th...

Document image analysis is a major research area in pattern recognition system for identification image objects within a document and their classification. Face recognition is most widely used and efficient system in biometric. Existing methods worked on these areas of document image analysis and face recognition separately. In this paper, an attempt is made to develop a novel system to authent...