Efficient and secure comparison for on-line auctions

Ivan Damgard, M. Geisler, M. Kroigaard

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    88 Citations (Scopus)
    4 Downloads (Pure)

    Abstract

    We propose a protocol for secure comparison of integers based on homomorphic encryption. We also propose a homomorphic encryption scheme that can be used in our protocol and makes it more efficient than previous solutions. Our protocol is well-suited for application in on-line auctions, both with respect to functionality and performance. It minimizes the amount of information bidders need to send, and for comparison of 16 bit numbers with security based on 1024 bit RSA (executed by two parties), our implementation takes 0.28 seconds including all computation and communication. Using precomputation, one can save a factor of roughly 10.
    Original languageEnglish
    Title of host publicationProceedings of the 12th Australasian Conference on Information Security and Privacy (ACISP 2007), 2-4 July 2007, Townsville, Australia
    EditorsJ. Pieprzyk, H. Ghodosi, E. Dawson
    Place of PublicationBerlin
    PublisherSpringer
    Pages416-430
    ISBN (Print)978-3-540-73457-4
    DOIs
    Publication statusPublished - 2007

    Publication series

    NameLecture Notes in Computer Science
    Volume4586
    ISSN (Print)0302-9743

    Fingerprint Dive into the research topics of 'Efficient and secure comparison for on-line auctions'. Together they form a unique fingerprint.

  • Cite this

    Damgard, I., Geisler, M., & Kroigaard, M. (2007). Efficient and secure comparison for on-line auctions. In J. Pieprzyk, H. Ghodosi, & E. Dawson (Eds.), Proceedings of the 12th Australasian Conference on Information Security and Privacy (ACISP 2007), 2-4 July 2007, Townsville, Australia (pp. 416-430). (Lecture Notes in Computer Science; Vol. 4586). Springer. https://doi.org/10.1007/978-3-540-73458-1_30