2011
DOI: 10.1007/s00145-010-9096-4
|View full text |Cite
|
Sign up to set email alerts
|

Multi-Verifier Signatures

Abstract: Abstract. Multi-verifier signatures generalize public-key signatures to a secret-key setting. Just like public-key signatures, these signatures are both transferable and secure under arbitrary (unbounded) adaptive chosen-message attacks. In contrast to public-key signature schemes, however, we exhibit practical constructions of multi-verifier signature schemes that are provably secure and are based only on pseudorandom functions in the plain model without any random oracles.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2012
2012
2017
2017

Publication Types

Select...
2
1
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 27 publications
(66 reference statements)
0
3
0
Order By: Relevance
“…To best of our knowledge this procedure is new. The closest work that we could find are the multi-verifier signatures proposed by Roeder et al [11]. In their work, linear systems of equations are used as well upon message authentication codes but the security properties and goals of their construction are different.…”
Section: Motivation and Related Workmentioning
confidence: 99%
“…To best of our knowledge this procedure is new. The closest work that we could find are the multi-verifier signatures proposed by Roeder et al [11]. In their work, linear systems of equations are used as well upon message authentication codes but the security properties and goals of their construction are different.…”
Section: Motivation and Related Workmentioning
confidence: 99%
“…The schemes [10,11] were proved to be secure in standard model. Roeder et al [12] proposed practical constructions of multi-verifier signature schemes that are provably secure and are based only on pseudorandom functions in the plain model. Zhang et al [13] proposed a strong multi-designated verifiers signature, which is secure against rogue key attack.…”
Section: Related Workmentioning
confidence: 99%
“…But in many settings it might be hard to agree on a trusted party or such a party might not exist. 1 An alternative method for obtaining a trusted set-up is to assemble all participating parties in a "trusted isolated chamber" where no communication with the outside world is possible. The parties by themselves then run a secure computation protocol to provide the appropriate setup.…”
Section: Minimizing Trusted Set-upmentioning
confidence: 99%