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

The designated verifier signature (DVS), introduced by Jakobsson <italic>et al.</italic>, has the property that only the designated verifier can verify the generated signature. In order to prevent an eavesdropper to get the signature on-line before the designated verifier receives it, they also proposed strong designated verifier signature (SDVS). In this paper, according to an efficient SDVS proposed by Saeednia <italic>et al.</italic>, we present a post-quantum SDVS in the random oracle model based on lattice assumption. The unforgeability is based on the hardness of the average-case hard problem <inline-formula> <tex-math notation="LaTeX">$\mathcal {R}-$ </tex-math></inline-formula>SIS<inline-formula> <tex-math notation="LaTeX">$_{q,n,m,\beta }$ </tex-math></inline-formula>, which is at least as hard as worst-case SVP<inline-formula> <tex-math notation="LaTeX">$_{\gamma }$ </tex-math></inline-formula> over ideal lattices. In addition, compared with existing lattice-based SDVS schemes, our scheme cuts by more than 50 percent repetitions and the size of signature is shorter with 256 bits security.

ieee access

An Efficient Strong Designated Verifier Signature Based on &lt;inline-formula&gt; &lt;tex-math notation="LaTeX"&gt;$\mathcal{R}-$ &lt;/tex-math&gt; &lt;/inline-formula&gt;SIS Assumption