Jaydeep Howlader

Secure Receipt-Free Sealed-Bid Electronic Auction

The auction scheme that provides receipt-freeness, prevents the bidders from bid-rigging by the coercers. Bid-rigging is a dangerous attack in electronic auction. This happen if the bidder gets a receipt of his bidding price, which proves his bidding prices, from the auction protocol. The coercers used to force the bidders to disclose their receipts and hence bidders lose the secrecy of their bidding prices. This paper presents a protocol for a receipt-free, sealed-bid auction. The scheme ensures the receipt-freeness, secrecy of the bid, secrecy of the bidder and public verifiability.

Sealed-bid auction: a cryptographic solution to bid-rigging attack in the collusive environment

Sealed-Bid auction is an efficient and rational way to establish the price and trading goods in the open market. However sealed-bid auctions are subject to bid-rigging attack. Receipt-free mechanisms are proposed to prevent bid-rigging. So far, all the proposed receipt-free mechanisms are based on strict assumptions: i The channel between bidders and the auction authorities like auctioneer, sealer, registering authority etc. must be untappable, 2 the authorities are assumed to be honest not colluded, hence ensure privacy and anonymity of bids. Moreover, the existing receipt-free mechanisms are bandwidth intensive estimated difference between the minimum and maximum bidding price. In this paper, we present a receipt-free sealed-bid auction mechanism which can withstand public channel and colluded authorities. The proposed mechanism can work even under the situation where all the authorities except one are colluded. Unlike the existing mechanisms, the computational complexity of the proposed mechanism is independent of the bandwidth and only depends on the number of valid bids. The auction mechanism requires Omlogm computational steps to resolve the winner, where m is the number of valid bids in the system. Copyright

Practical Receipt-Free Sealed-Bid Auction in the Coercive Environment

Sealed-Bid auction is an efficient and rational method to establish the price in open market. However sealed-bid auctions are subject to bid-rigging attack. Receipt-free mechanisms were proposed to prevent bid-rigging. The prior receipt-free mechanisms are based on two assumptions; firstly, existence of untappable channel between bidders and auction authorities. Secondly, mechanisms assume the authorities to be honest (not colluding). Moreover the bandwidth required to communicate the receipt-free bids is huge. This paper presents a sealed-bid auction mechanism to resist bid-rigging. The proposed method does not assume untappable channel nor consider the authorities to be necessarily honest. The proposed mechanism also manages the bandwidth efficiently, and improves the performance of the system.

Coercion Resistant MIX for Electronic Auction

Coercion in sealed-bid auction refers to the problem of bid-rigging, where the adversary (coercer) dictates the bidder (coerced bidder) to bid some low value and also feasible to determine whether the victim has complied with the demands. Therefore uncoerciveness is an essential property to achieve fair and competitive sealed-bid auction. Receipt-free mechanisms are developed to confine the property of uncoerciveness. The prior receipt-free schemes assume an impractical assumption of the availability of an untappable channel between bidders and the auction authorities. Our previous work proposed a sender-side deniable encryption scheme to relax the assumption of the untappable channel where the receiver side is not colluded. However, we examined that neither the untappable channel nor the deniable encryption can provide receipt-freeness in presence of colluded authorities unless the privacy of the bidders are not preserved. MIX (MIX-cascade) is a well known technique for anonymous communication. This paper presents a MIX scheme compatible with deniable encryption to facilitate the receipt-freeness mechanisms to be practical without the assumption of untappable channel and also in the presence of colluded authorities. The proposed MIX may replace the untappable channel without changing the existing receipt-free mechanisms.

An integrated routing and offset-time adaptation scheme for OBS network

Optical burst switching (OBS) is considered as one of the most potential technology for implementation of transparent optical Internet in near future. In this paper we propose an integrated scheme for loss reduction and efficient resource utilization in OBS. We develop a framework for computation of estimated space-time loss surface in space-time plane for a burst over the network and utilise it to determine the most appropriate route and corresponding offset-time for the burst. The integrated routing and offset-time adaptation scheme proposed here, can simultaneously offer significantly lower burst loss rate and higher network-wide resource utilisation.

A Lossless MOD-ENCODER Towards a Secure Communication

The Internet traffic is increasing day by day. Also, secure data communication is the need of the hour. But the standard compression techniques which are in use, are independent and do not consider the security issues. Hence, we present a general encoding technique for secure data communication over a language

A Novel Key Exchange Protocol Provably Secure Against Man-in-the-Middle Attack

L

Deniable Encryption in Replacement of Untappable Channel to Prevent Coercion

with a finite alphabet set

Sender-Side Public Key Deniable Encryption Scheme

\sum

UNCOERCIBILITY IN E -VOTING AND E - AUCTIONING MECHANISMS USING DENIABLE ENCRYPTION

. The encoded message is a bi-tuple of which, the first is a vector of quotients denoted as