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 Plus annual

Presents the access of premium content as premium feature

Premium Content

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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Identification and authentication are two basic functionalities oftraditional random access protocols. In ALOHA-based random access, the packetsusually include a field with a unique user address. However, when the number ofusers is massive and relatively small packets are transmitted, the overhead ofincluding such field becomes restrictive. In unsourced random access (U-RA),the packets do not include any address field for the user, which maximizes thenumber of useful bits that are transmitted. However, by definition an U-RAprotocol does not provide user identification. This paper presents a schemethat builds upon an underlying U-RA protocol and solves the problem of useridentification and authentication. In our scheme, the users generate a messageauthentication code (MAC) that provides these functionalities without violatingthe main principle of unsourced random access: the selection of codewords froma common codebook is i.i.d. among all users.

How to Identify and Authenticate Users in Massive Unsourced Random Access