A new protocol for double auction based on homomorphic encryption

Wataru Ohkishima, Shigeki Goto

    Research output: Contribution to journalArticle

    Abstract

    The auction is a popular way of trading. Despite of the popularity of the auction, only a small number of papers have addressed the protocol which realize the double auction. In this paper, we propose a new method of double auction which improves the algorithm of the existing double auction protocol. Our new method is based on the idea of number comparison which is realized by homomorphic encryption. The new method solves the problem of the privacy of losing bids found in the existing algorithm. The buyers and the sellers can embed a random number in their bidding information by the use of the homomorphic encryption. The players in an auction cannot get anyone else's bidding information. The new method is more efficient than the existing ones. Our new method satisfies the criteria for the auction protocol.

    Original languageEnglish
    Pages (from-to)2361-2370
    Number of pages10
    JournalIEICE Transactions on Information and Systems
    VolumeE86-D
    Issue number11
    Publication statusPublished - 2003 Nov

    Fingerprint

    Cryptography

    Keywords

    • Double auction
    • Homomorphic encryption
    • Number comparison
    • Privacy of losing bids
    • Secret sharing scheme

    ASJC Scopus subject areas

    • Information Systems
    • Computer Graphics and Computer-Aided Design
    • Software

    Cite this

    A new protocol for double auction based on homomorphic encryption. / Ohkishima, Wataru; Goto, Shigeki.

    In: IEICE Transactions on Information and Systems, Vol. E86-D, No. 11, 11.2003, p. 2361-2370.

    Research output: Contribution to journalArticle

    Ohkishima, Wataru ; Goto, Shigeki. / A new protocol for double auction based on homomorphic encryption. In: IEICE Transactions on Information and Systems. 2003 ; Vol. E86-D, No. 11. pp. 2361-2370.
    @article{0eb9dc63f1b24176b81cf1b4fa2e6a1c,
    title = "A new protocol for double auction based on homomorphic encryption",
    abstract = "The auction is a popular way of trading. Despite of the popularity of the auction, only a small number of papers have addressed the protocol which realize the double auction. In this paper, we propose a new method of double auction which improves the algorithm of the existing double auction protocol. Our new method is based on the idea of number comparison which is realized by homomorphic encryption. The new method solves the problem of the privacy of losing bids found in the existing algorithm. The buyers and the sellers can embed a random number in their bidding information by the use of the homomorphic encryption. The players in an auction cannot get anyone else's bidding information. The new method is more efficient than the existing ones. Our new method satisfies the criteria for the auction protocol.",
    keywords = "Double auction, Homomorphic encryption, Number comparison, Privacy of losing bids, Secret sharing scheme",
    author = "Wataru Ohkishima and Shigeki Goto",
    year = "2003",
    month = "11",
    language = "English",
    volume = "E86-D",
    pages = "2361--2370",
    journal = "IEICE Transactions on Information and Systems",
    issn = "0916-8532",
    publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
    number = "11",

    }

    TY - JOUR

    T1 - A new protocol for double auction based on homomorphic encryption

    AU - Ohkishima, Wataru

    AU - Goto, Shigeki

    PY - 2003/11

    Y1 - 2003/11

    N2 - The auction is a popular way of trading. Despite of the popularity of the auction, only a small number of papers have addressed the protocol which realize the double auction. In this paper, we propose a new method of double auction which improves the algorithm of the existing double auction protocol. Our new method is based on the idea of number comparison which is realized by homomorphic encryption. The new method solves the problem of the privacy of losing bids found in the existing algorithm. The buyers and the sellers can embed a random number in their bidding information by the use of the homomorphic encryption. The players in an auction cannot get anyone else's bidding information. The new method is more efficient than the existing ones. Our new method satisfies the criteria for the auction protocol.

    AB - The auction is a popular way of trading. Despite of the popularity of the auction, only a small number of papers have addressed the protocol which realize the double auction. In this paper, we propose a new method of double auction which improves the algorithm of the existing double auction protocol. Our new method is based on the idea of number comparison which is realized by homomorphic encryption. The new method solves the problem of the privacy of losing bids found in the existing algorithm. The buyers and the sellers can embed a random number in their bidding information by the use of the homomorphic encryption. The players in an auction cannot get anyone else's bidding information. The new method is more efficient than the existing ones. Our new method satisfies the criteria for the auction protocol.

    KW - Double auction

    KW - Homomorphic encryption

    KW - Number comparison

    KW - Privacy of losing bids

    KW - Secret sharing scheme

    UR - http://www.scopus.com/inward/record.url?scp=0344309189&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0344309189&partnerID=8YFLogxK

    M3 - Article

    VL - E86-D

    SP - 2361

    EP - 2370

    JO - IEICE Transactions on Information and Systems

    JF - IEICE Transactions on Information and Systems

    SN - 0916-8532

    IS - 11

    ER -