Efficient and secure comparison for on-line auctions

Ivan Damgard, M. Geisler, M. Kroigaard

    Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

    151 Citaten (Scopus)
    4 Downloads (Pure)


    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.
    Originele taal-2Engels
    TitelProceedings of the 12th Australasian Conference on Information Security and Privacy (ACISP 2007), 2-4 July 2007, Townsville, Australia
    RedacteurenJ. Pieprzyk, H. Ghodosi, E. Dawson
    Plaats van productieBerlin
    ISBN van geprinte versie978-3-540-73457-4
    StatusGepubliceerd - 2007

    Publicatie series

    NaamLecture Notes in Computer Science
    ISSN van geprinte versie0302-9743


    Duik in de onderzoeksthema's van 'Efficient and secure comparison for on-line auctions'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit