2009
DOI: 10.1007/978-3-642-10230-1_2
|View full text |Cite
|
Sign up to set email alerts
|

Unconditionally Secure Blind Signatures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2011
2011
2016
2016

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(6 citation statements)
references
References 16 publications
0
6
0
Order By: Relevance
“…In the typical VEA setup of current literature [7,10,12], the arbiter is assumed to be a glorified verifier, with the same type of keying information as an arbitrary verifier. The arbiter is assumed to follow the rules of the dispute resolution method honestly and is otherwise treated as a normal verifier in the context of the security model, i.e., he is allowed to be dishonest otherwise.…”
Section: Some Examples Of Dispute Resolution Processesmentioning
confidence: 99%
See 4 more Smart Citations
“…In the typical VEA setup of current literature [7,10,12], the arbiter is assumed to be a glorified verifier, with the same type of keying information as an arbitrary verifier. The arbiter is assumed to follow the rules of the dispute resolution method honestly and is otherwise treated as a normal verifier in the context of the security model, i.e., he is allowed to be dishonest otherwise.…”
Section: Some Examples Of Dispute Resolution Processesmentioning
confidence: 99%
“…The Hara et al [7] model for unconditionally secure blind signatures is essentially the same as the Shikata et al model with an added blindness condition. Hara et al separate the unforgeability definition of [12] into a weaker notion of unforgeability and an additional non-repudiation requirement.…”
Section: Comparison With Existing Modelsmentioning
confidence: 99%
See 3 more Smart Citations