A double auction scheme based on secret sharing and safe comparing protocol | Zendy

Bin Zhang | Zendy; Qiuliang Xu | Zendy; Han Jiang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A double auction scheme based on secret sharing and safe comparing protocol

Author(s) -

Bin Zhang,

Qiuliang Xu,

Han Jiang

Publication year - 2012

Publication title -

international journal of wireless and microwave technologies

Language(s) - English

Resource type - Journals

eISSN - 2076-9539

pISSN - 2076-1449

DOI - 10.5815/ijwmt.2012.01.09

Subject(s) - homomorphic encryption , computer science , scheme (mathematics) , secret sharing , commitment scheme , secure multi party computation , protocol (science) , computer security , hash function , double auction , encryption , computation , zero knowledge proof , computer network , cryptography , algorithm , mathematics , common value auction , medicine , mathematical analysis , statistics , alternative medicine , pathology

At present most practical electrical auction schemes that based on secret sharing, group signature and hash chain assume the existence of a trusted thid party, while the schemes that based on commitment, zero knowledge or homomorphic encryption without the TTP model face the problem of high cost of communication and computation. The double auction scheme proposed by Bogetoft is based on secure multiparty computation without a TTP and get very high efficiency. In this article, we improve the above scheme. Based on secret sharing and constant round safe comparing protocol, we reduce the requirement of honest majority in the original scheme. We improve the security of the scheme while maintain the high efficiency

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research