How to Sign Given Any Trapdoor Permutation
| dc.contributor.author | Bellare, Mihir | en_US |
| dc.contributor.author | Micali, Silvio | en_US |
| dc.date.accessioned | 2023-03-29T14:34:05Z | |
| dc.date.available | 2023-03-29T14:34:05Z | |
| dc.date.issued | 1990-06 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149163 | |
| dc.description.abstract | We present a digital signature scheme which is based on the existence of any trapdoor permutation. Our scheme is secure in the strongest possible natural sense: namely, it is secure against existential forgery under adaptive chosen message attack. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-432 | |
| dc.title | How to Sign Given Any Trapdoor Permutation | en_US |
| dc.identifier.oclc | 21958927 |
