While software agents have been employed in payment protocols, they are largely passive entities, i.e., they participate in the payment protocol but do not make decision. In this paper, we propose an agent-assisted payment protocol called LITESET/A+ that empowers the payment agent (PA) to perform encryption operation for its owner. This is realized by introducing a Trusted Third Party (TTP) in ...

Growing interest in Cloud Computing places a heavy workload on cloud providers which is becoming increasingly difficult for them to manage with their primary datacenter infrastructures. Resource limitations can make providers vulnerable to significant reputational damage and it often forces customers to select services from the larger, more established companies, sometimes at a higher price. Fu...

0

Recently, Baghery et al. [1, 2] presented some attacks on two RFID protocols, namely Yoon and Jung et al. protocols, and proposed the improved version of them. However, in this note, we show that the improved version of the Jung et al. protocol suffers from desynchronization attack and the improved version of the Yoon's protocol suffers from secret disclosure attack. The succe...

The problem of analyzing the effect of privacy concerns on the behavior of selfish utility-maximizing agents has received much attention lately. Privacy concerns are often modeled by altering the utility functions of agents to consider also their privacy loss [24,13,19,4]. Such privacy aware agents prefer to take a randomized strategy even in very simple games in which non-privacy aware agents ...

In this study, a novel approach which uses combination of steganography and cryptography for hiding information into digital images as host media is proposed. In the process, secret data is first encrypted using the mono-alphabetic substitution cipher method and then the encrypted secret data is embedded inside an image using an algorithm which combines the random patterns based on Space Fillin...

We show that if a set of players hold shares of a value a ∈ Zp for some prime p (where the set of shares is written [a]p), it is possible to compute, in constant round and with unconditional security, sharings of the bits of a, i.e. compute sharings [a0]p, . . . , [a`−1]p such that ` = dlog 2 (p)e, a0, . . . , a`−1 ∈ {0, 1} and a = ∑`−1 i=0 ai2 . Our protocol is secure against active adversarie...

Data transmission security has become an extremely important field of research. Steganography is an art of hiding information in image, audio and video files in a way that would meet the security requirements in the form of overt or covert. In this study, we propose a new hybrid steganography technique for color images that hide secret messages in the frequency domain of a cover image's blu...