Order-preserving encryption using approximate integer common divisors

James Dyer*, Martin Dyer, Jie Xu

*Corresponding author for this work

    Research output: Chapter in Book/Conference proceedingConference contributionpeer-review

    Abstract

    We present a new, but simple, randomised order-preserving encryption (OPE) scheme based on the general approximate common divisor problem (GACDP). This appears to be the first OPE scheme to be based on a computational hardness primitive, rather than a security game. This scheme requires only O(1) arithmetic operations for encryption and decryption. We show that the scheme has optimal information leakage under the assumption of uniformly distributed plaintexts, and we indicate that this property extends to some non-uniform distributions. We report on an extensive evaluation of our algorithms. The results clearly demonstrate highly favourable execution times in comparison with existing OPE schemes.

    Original languageEnglish
    Title of host publicationData Privacy Management, Cryptocurrencies and Blockchain Technology - ESORICS 2017 International Workshops, DPM 2017 and CBT 2017, Proceedings
    PublisherSpringer Nature
    Pages257-274
    Number of pages18
    Volume10436 LNCS
    ISBN (Print)9783319678153
    DOIs
    Publication statusPublished - 13 Sept 2017
    Event12th International Workshop on Data Privacy Management, DPM 2017 held in conjunction with 22nd European Symposium on Research in Computer Security, ESORICS 2017 and 1st International Workshop on Cryptocurrencies and Blockchain Technology, CBT 2017 - Oslo, Norway
    Duration: 14 Sept 201715 Sept 2017

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume10436 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Conference

    Conference12th International Workshop on Data Privacy Management, DPM 2017 held in conjunction with 22nd European Symposium on Research in Computer Security, ESORICS 2017 and 1st International Workshop on Cryptocurrencies and Blockchain Technology, CBT 2017
    Country/TerritoryNorway
    CityOslo
    Period14/09/1715/09/17

    Keywords

    • Cloud computing
    • Data analytics
    • Order-preserving encryption
    • Symmetric cryptography

    Fingerprint

    Dive into the research topics of 'Order-preserving encryption using approximate integer common divisors'. Together they form a unique fingerprint.

    Cite this