2017
DOI: 10.1007/s11277-017-4658-5
|View full text |Cite
|
Sign up to set email alerts
|

Designated Verifier Proxy Re-signature for Deniable and Anonymous Wireless Communications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0

Year Published

2018
2018
2025
2025

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(16 citation statements)
references
References 21 publications
0
16
0
Order By: Relevance
“…However, now scholars are embracing it in wireless system promptly. In 2017, Wei, Yang, and Mu presented the idea of a proxy re‐signature plan for wireless networks where the proxy can be reformed into the appointed affirmer whenever required [16]. This idea was beneficial for anonymous authentication.…”
Section: Related Workmentioning
confidence: 99%
“…However, now scholars are embracing it in wireless system promptly. In 2017, Wei, Yang, and Mu presented the idea of a proxy re‐signature plan for wireless networks where the proxy can be reformed into the appointed affirmer whenever required [16]. This idea was beneficial for anonymous authentication.…”
Section: Related Workmentioning
confidence: 99%
“…The concept of SDVS was first introduced by Jakobsson et al [7], and formalized by Saeednia et al [21]. Since then, some efficient SDVS schemes were proposed [22][23][24][25][26][27], but the security of those schemes is based on the ideal random oracle. To deal with this problem, Hung et al [17] designed a SDVS scheme in the standard model.…”
Section: Related Workmentioning
confidence: 99%
“…The researchers also proposed some variants of DVS such as universal DVS [50,51] and multi-verifier DVS [52,53]. Until now, the only DVPRS scheme was that proposed by Wei et al [14], but its security was dependent on ideal random oracles.…”
Section: Related Workmentioning
confidence: 99%
“…Definition 5. If the signature created by the signer and the signature simulated by the designated verifier are computationally indistinguishable, then we say that an SDVPRS scheme is non-transferable [14].…”
Section: Definitionmentioning
confidence: 99%
See 1 more Smart Citation