Password typos resilience in honey encryption

Hoyul Choi, Hyunjae Nam, Junbeom Hur

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    16 Citations (Scopus)

    Abstract

    Honey encryption (HE) is a novel password-based encryption scheme which is secure against brute-force attack even if users' passwords have min-entropy. However, because decryption under a wrong key produces fake but valid-looking messages to everyone, typos in password may confuse even legitimate users in HE. This has been one of the most challenging problems in HE. In this paper, we propose two types of protocols that enable legitimate users to detect the typos in a password. We compare and analyze the performance and security of each scheme. The analysis results show that the proposed schemes can effectively solve the typos problem in HE while providing message recovery security.

    Original languageEnglish
    Title of host publication31st International Conference on Information Networking, ICOIN 2017
    PublisherIEEE Computer Society
    Pages593-598
    Number of pages6
    ISBN (Electronic)9781509051243
    DOIs
    Publication statusPublished - 2017 Apr 13
    Event31st International Conference on Information Networking, ICOIN 2017 - Da Nang, Viet Nam
    Duration: 2017 Jan 112017 Jan 13

    Publication series

    NameInternational Conference on Information Networking
    ISSN (Print)1976-7684

    Other

    Other31st International Conference on Information Networking, ICOIN 2017
    Country/TerritoryViet Nam
    CityDa Nang
    Period17/1/1117/1/13

    Bibliographical note

    Publisher Copyright:
    © 2017 IEEE.

    Keywords

    • brute-force resilience
    • honey encryption
    • password typo
    • password-based encryption

    ASJC Scopus subject areas

    • Computer Networks and Communications
    • Information Systems

    Fingerprint

    Dive into the research topics of 'Password typos resilience in honey encryption'. Together they form a unique fingerprint.

    Cite this