Open AccessEfficient proof of bid validity with untrusted verifier in homomorphic e‐auction
Author(s) -
Peng Kun
Publication year - 2013
Publication title -
iet information security
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.308
H-Index - 34
eISSN - 1751-8717
pISSN - 1751-8709
DOI - 10.1049/iet-ifs.2012.0076
Subject(s) - homomorphic encryption , computer science , bottleneck , hash function , oblivious transfer , zero knowledge proof , theoretical computer science , cryptography , public key cryptography , double auction , computer security , encryption , mathematics , common value auction , statistics , embedded system
Bid validity proof and verification is an efficiency bottleneck and privacy drawback in homomorphic e‐auction. The existing bid validity proof technique is inefficient and only achieves honest‐verifier zero knowledge (ZK). In this study, an efficient proof and verification technique is proposed to guarantee bid validity in homomorphic e‐auction. The new proof technique is mainly based on hash function operations and only needs a very small number of costly public key cryptographic operations. Moreover, it can handle untrusted verifiers and achieve perfect ZK. As a result, efficiency and privacy of homomorphic e‐auction applications are significantly improved. To the best of authors’ knowledge, it proof technique is the first to handle untrusted verifiers in e‐auction applications.