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

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Recently, &#x03B5;-almost dual universal2 hash functions have been proposed as a new and wider class of hash functions. Using this class of hash functions, several efficient hash functions were proposed. This paper evaluates the security performance when we apply this kind of hash functions. We evaluate the security in several kinds of setting based on the L1 distinguishability criterion and the modified mutual information criterion. The obtained evaluation is based on smoothing of Re&#x0301;nyi entropy of order 2 and/or min entropy. We clarify the difference between these two methods.

ieee transactions on information theory

Security Analysis of <inline-formula> <tex-math notation="LaTeX">$\varepsilon $ </tex-math></inline-formula>-Almost Dual Universal2 Hash Functions: Smoothing of Min Entropy Versus Smoothing of R&#x00E9;nyi Entropy of Order 2

Security Analysis of $\varepsilon $ -Almost Dual Universal2 Hash Functions: Smoothing of Min Entropy Versus Smoothing of Rényi Entropy of Order 2

Security Analysis of $\varepsilon $ -Almost Dual Universal₂ Hash Functions: Smoothing of Min Entropy Versus Smoothing of Rényi Entropy of Order 2