IDEAS home Printed from https://ideas.repec.org/a/igg/jdst00/v4y2013i1p1-15.html
   My bibliography  Save this article

Principles of Soft Verification

Author

Listed:
  • Natasa Zivic

    (Department Electrical Engineering and Computer Science, Institute for Digital Communications Systems, University of Siegen, Siegen, Germany)

Abstract

This paper considers messages protected with the Message Authentication Code (MAC) for the sake of authenticity. The standard forward error correcting channel code is assumed, which reduces the error rate, but no repeat mechanism exists to correct the remaining errors. The uncorrected errors cause the rejection of messages with a wrong MAC, as a successful MAC verification (“hard” verification) demands errorless message and errorless MAC. This paper introduces the extension of “hard” verification of MACs, whose result is “true” or “false”, to “soft” verification, that outputs additionally a trust level as verification result. This allows the acceptance of corrected messages and their MACs, even if a few bits of the MAC are different from the expected value. The costs are a loss of trust, as trust is defined for the successful standard or “hard” verification, i.e. for errorless message and its MAC. Therefore “Trust Output” is accompanied with the output of the verification process. A definition of “Trust Level” will be given, together with an algorithm of “soft” verification, which provides such Trust Output. This algorithm is based on a Soft Output channel decoder, which provides a reliability value for each bit, which is used as soft input for the proposed algorithm, “Soft Input Trust Output”. Simulation results show an essential improvement of the acceptance rate of MACs - at the cost of a reduced trust level. The reduction can be calculated and the maximum permitted reduction of the trust level can be preset.

Suggested Citation

  • Natasa Zivic, 2013. "Principles of Soft Verification," International Journal of Distributed Systems and Technologies (IJDST), IGI Global, vol. 4(1), pages 1-15, January.
  • Handle: RePEc:igg:jdst00:v:4:y:2013:i:1:p:1-15
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdst.2013010101
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jdst00:v:4:y:2013:i:1:p:1-15. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.