English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

In this paper, we propose an HB-like protocol for privacy-preservingauthentication of RFID tags, whereby a tag can remain anonymous and untraceableto an adversary during the authentication process. Previous proposals of suchprotocols were based on PRF computations. Our protocol can instead be used onlow-cost tags that may be incapable of computing standard PRFs. Moreover, sincethe underlying computations in HB protocols are very efficient, our protocolalso reduces reader load compared to PRF-based protocols.  We suggest a tree-based approach that replaces the PRF-based authenticationfrom prior work with a procedure such as HB+ or HB#. We optimize the tree-traversal stage through usage of a "light version" of the underlying protocoland shared random challenges across all levels of the tree. This providessignificant reduction of the communication resources, resulting in aprivacy-preserving protocol almost as efficient as the underlying HB+ or HB#

Using HB Family of Protocols for Privacy-Preserving Authentication of RFID Tags in a Population