Verifying distributed erasure-coded data
- 12 August 2007
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 139-146
- https://doi.org/10.1145/1281100.1281122
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision ResistanceLecture Notes in Computer Science, 2004
- Incremental Cryptography: The Case of Hashing and SigningPublished by Springer Science and Business Media LLC ,2001
- LFSR-based Hashing and AuthenticationPublished by Springer Science and Business Media LLC ,2001
- Distributed Provers with Applications to Undeniable SignaturesPublished by Springer Science and Business Media LLC ,2001
- Software Performance of Universal Hash FunctionsLecture Notes in Computer Science, 1999
- Distributed Pseudo-random Functions and KDCsLecture Notes in Computer Science, 1999
- Publicly Verifiable Secret SharingLecture Notes in Computer Science, 1996
- Efficient dispersal of information for security, load balancing, and fault toleranceJournal of the ACM, 1989
- On Irreducible Polynomials in Galois FieldsThe American Mathematical Monthly, 1963
- Polynomial Codes Over Certain Finite FieldsJournal of the Society for Industrial and Applied Mathematics, 1960