A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
An Efficient Existentially Unforgeable Signature Scheme and its Applications
[chapter]
Advances in Cryptology — CRYPTO '94
Preserved Fulltext
We present a practical existentially unforgeable signature scheme and point out applications where its application is desirable. A signature scheme is existentially unforgeable if, given any polynomial (in the security parameter) number of pairs where S ( m ) denotes the signature on the message m, it is computationally infeasible to generate a pair ( m k + l , S(mkt1)) for any message mk+l $ ! { m l , , . . mk}. We have developed a signature scheme that requires at most 6 times the amount of
doi:10.1007/3-540-48658-5_23
dblp:conf/crypto/DworkN94
fatcat:nfrbkcl2ezf5zdwecefm64mnua