From Sealed-Bid Electronic Auction to Electronic Cheque

Yeow, Kin-Woon; Heng, Swee-Huay; Tan, Syh-Yuan

doi:10.1007/978-981-10-4154-9_43

Cited by 2 publications

(10 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Quaglia and Smyth [14] revised the proposed scheme of McCarthy et al [13] by providing strong theoretical foundation where the scheme satisfied correctness, injectivity, completeness, verifiability and bid secrecy. Yeow et al [15] presented a generic transformation framework from e-auction to e-cheque. Their proposed transformation framework satisfied existential unforgeability under chosen account attack (EUF-CAA), payer anonymity under chosen account attack (PA-CAA), and indistinguishability under chosen cheque attack (IND-CCeA).…”

Section: Related Workmentioning

confidence: 99%

“…While Quaglia and Smyth [14] proposed a generic transformation framework from e-voting to e-auction with asymptotic complexity of OðnÞ, Yeow et al [15] presented a generic transformation framework from e-auction to e-cheque with asymptotic complexity of OðnÞ. Therefore, using current transformation frameworks to obtain e-cheque from e-voting scheme required first transforming the e-voting to an e-auction and then only transforming the e-…”

Section: Related Workmentioning

confidence: 99%

“…In this paper, we first review the scheme definitions of e-voting and e-cheque, followed by their security models respectively. While a rigorous security model for e-cheque schemes has been established [15], it is not the case for e-voting schemes. Therefore, we define some important security properties for e-voting, namely, confidentiality, anonymity, and unforgeability that are required to perform the transformation before presenting the generic transformation from e-voting to e-cheque.…”

Section: Our Contributionmentioning

confidence: 99%

“…Quaglia and Smyth [14] From e-voting to e-auction OðnÞ Yeow et al [15] From e-auction to e-cheque OðnÞ…”

Section: Scheme Transformation Framework Complexitymentioning

confidence: 99%

“…Confidentiality. According to Yeow et al [15], confidentiality in the e-cheque scheme means the invalid and unused e-cheques are anonymous to any party. The following game is the indistinguishability under chosen cheque attack (IND-CCEA) security notion for an e-cheque scheme.…”

Section: Security Requirements Of E-chequementioning

confidence: 99%

See 4 more Smart Citations

Transformation from e-voting to e-cheque

Kho,

Heng,

Tan

et al. 2024

PLoS ONE

Self Cite

View full text Add to dashboard Cite

Although e-voting scheme and e-cheque scheme are two different applications, they have similarities in the scheme definitions and security properties. This inspires us to establish a relationship between the two schemes by formalising a generic transformation from e-voting to e-cheque scheme. Firstly, we define the scheme definitions and security models for both e-voting scheme and e-cheque scheme. Subsequently, we demonstrate a generic transformation framework from e-voting to e-cheque with asymptotic complexity of O ( n ) and design a formal proof to show that a secure e-voting scheme can be transformed into a secure e-cheque scheme. As a proof of concept, we apply our newly proposed transformation technique to the e-voting scheme proposed by Li et al. and obtain a concrete e-cheque scheme.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Our Contributionmentioning

confidence: 99%

“…Quaglia and Smyth [14] From e-voting to e-auction OðnÞ Yeow et al [15] From e-auction to e-cheque OðnÞ…”

Section: Scheme Transformation Framework Complexitymentioning

confidence: 99%

Section: Security Requirements Of E-chequementioning

confidence: 99%

See 3 more Smart Citations

Transformation from e-voting to e-cheque

Kho,

Heng,

Tan

et al. 2024

PLoS ONE

Self Cite

View full text Add to dashboard Cite

show abstract

A Privacy-preserving Distributed Multi-attribute Reverse Auction Scheme with Public verification using Threshold Paillier cryptosystem

Wang¹,

Shi²,

Su³

2017

ReBICTE

View full text Add to dashboard Cite

With the rapid updating of Internet technology, electronic auction network environment is more complex,so the electronic auction security requirements are getting higher and higher. In addition, thestudy of multi-attribute auction research on security is still very lacking. In this paper, a secure multiattributereverse auction scheme is proposed. It uses the paillier threshold homomorphic cryptosystemand multiple servers to prevent conspiracy attack between buyer and auction servers. Moreover,the techniques of oblivious transfer and anonymization are also used to achieve the bidder privacyand anonymity. Finally, the scheme achieves the public verification of auction process and auctionresults and the security analysis is given.

show abstract

From Sealed-Bid Electronic Auction to Electronic Cheque

Cited by 2 publications

References 22 publications

Transformation from e-voting to e-cheque

Transformation from e-voting to e-cheque

A Privacy-preserving Distributed Multi-attribute Reverse Auction Scheme with Public verification using Threshold Paillier cryptosystem

Contact Info

Product

Resources

About