A New Secure Protocol for Multi-attribute Multi-round E-reverse Auction Using Online Trusted Third Party

Srinath, T. R.; Kella, Samrat; Jenamani, Mamata

doi:10.1109/eait.2011.83

Cited by 9 publications

(23 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The comparisons of the computation time of these protocols are shown in Figures , , and . Because did not provide strong privacy and public verifiability, the computation time of is much less than and the proposal. Because the proposal adopts hash function in place of public key, the computation time of proposal is much less than in the opening phase and the winner determination phase.…”

Section: Methodsmentioning

confidence: 99%

“…'s protocol. In addition, public verifiability cannot be provided . Later, Srinath et al .adopts Paillier cryptosystem and range protocol from Parkes et al .…”

Section: Introductionmentioning

confidence: 99%

“…Because a bid need to be opened and computed according to score function, the bid privacy is weak in Srinath et al's protocol. In addition, public verifiability cannot be provided [21]. Later, Srinath et aladopts Paillier cryptosystem and range protocol from Parkes et al's protocol to achieve bid privacy and public verifiability.…”

Section: Introductionmentioning

confidence: 99%

“…/ only valuates independent attribute; it cannot handle interdependent relation among attributes. Srinath et al and Parkes et al [21][22][23] adopt Homomorphic properties of Paillier cryptosystem, transfer secure computation problem into numerical comparison under 3740 W. SHI the protection of Homomorphic encryption finally, and solve secure computation for qualitativeindependent-attribute-based bid structure. So, the problem is how to solve secure computation for qualitative-interdependent-attribute-based bid structure?…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A provable secure sealed‐bid multi‐attribute auction scheme under semi‐honest model

Shi

2013

Int J Communication

View full text Add to dashboard Cite

SUMMARYSecure electronic auction protocol attracts increasing attention in the field of information security research. A variety of secure electronic auction protocols have achieved a lot. However, those studies mainly focus on price‐based auction model. There are few literatures involving security issues of multi‐attribute e‐auction. In recent years, the existing literatures mainly focus on the winner determination problem of multi‐attribute auction, but research of multi‐attribute e‐auction just begin from the perspective of information security. The proposal intends to start with the multi‐attribute e‐auction protocol, explores the different results in the multi‐attribute auction model because of different bid structures, focuses on qualitative attribute‐based winner determination auction model, proposes a new qualitative attribute‐based sealed‐bid multi‐attribute auction scheme under semi‐honest model for the first time. According to the security analysis and computation comparison, it provides strong bid privacy, public verifiability, and reasonable computational cost. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

Section: Methodsmentioning

confidence: 99%

“…'s protocol. In addition, public verifiability cannot be provided . Later, Srinath et al .adopts Paillier cryptosystem and range protocol from Parkes et al .…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A provable secure sealed‐bid multi‐attribute auction scheme under semi‐honest model

Shi

2013

Int J Communication

View full text Add to dashboard Cite

show abstract

“…The bid privacy is weak in the protocol of Srinath et al . In addition, public verifiability cannot be provided . Later, Srinath et al .…”

Section: Introductionmentioning

confidence: 99%

A sealed‐bid multi‐attribute auction protocol with strong bid privacy and bidder privacy

Shi

2013

Security Comm Networks

View full text Add to dashboard Cite

In this paper, a sealed‐bid multi‐attribute auction protocol that mainly focuses on security issues (i.e., bid privacy, bidder anonymity, and fairness problem) is presented. In recent years, existing literatures mainly focus on the multi‐attribute winner determination problem and other issues, but research of multi‐attribute e‐auction just begin from the perspective of information security. The new proposal is motivated by the conflict between bidder anonymity and denial‐of‐service attack from an insider. It utilizes private set intersection method to solve the privacy problem of winner determination of sealed‐bid multi‐attribute auction. The proposed sealed‐bid auction scheme preserves the strong privacy of the bids and provides verifiable correctness. According to the security analysis, it satisfies the security requirements of an e‐auction. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

A Secure Reverse Multi-Attribute First-Price E-Auction Mechanism Using Multiple Auctioneer Servers (Work in Progress)

Jun

Wang

et al. 2016

Provable Security

View full text Add to dashboard Cite

A New Secure Protocol for Multi-attribute Multi-round E-reverse Auction Using Online Trusted Third Party

Cited by 9 publications

References 10 publications

A provable secure sealed‐bid multi‐attribute auction scheme under semi‐honest model

A provable secure sealed‐bid multi‐attribute auction scheme under semi‐honest model

A sealed‐bid multi‐attribute auction protocol with strong bid privacy and bidder privacy

A Secure Reverse Multi-Attribute First-Price E-Auction Mechanism Using Multiple Auctioneer Servers (Work in Progress)

Contact Info

Product

Resources

About