Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees
- 1 January 1997
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 480-494
- https://doi.org/10.1007/3-540-69053-0_33
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- An Efficient Existentially Unforgeable Signature Scheme and its ApplicationsPublished by Springer Science and Business Media LLC ,2001
- N Using RSA with Low Exponent in a Public Key NetworkPublished by Springer Science and Business Media LLC ,2000
- New Generation of Secure and Practical RSA-Based SignaturesLecture Notes in Computer Science, 1996
- Fast accumulated hashingLecture Notes in Computer Science, 1996
- Digital Signature SchemesLecture Notes in Computer Science, 1996
- One-Way Accumulators: A Decentralized Alternative to Digital SignaturesLecture Notes in Computer Science, 1994
- Random oracles are practicalPublished by Association for Computing Machinery (ACM) ,1993
- How to Make Efficient Fail-stop SignaturesLecture Notes in Computer Science, 1993
- New Constructions of Fail-Stop Signatures and Lower BoundsLecture Notes in Computer Science, 1993
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978