Skip to main content
placeholder image

Database authentication revisited

Journal Article


Abstract


  • Database authentication via cryptographic checksums represents an important approach to achieving an affordable safeguard of the integrity of data in publicly accessible database systems against illegal manipulations. This paper revisits the issue of database integrity and offers a new method of safeguarding the authenticity of data in database systems. The method is based on the recent development of pseudo-random function families and sibling intractable function families, rather than on the traditional use of cryptosystems. The database authentication scheme can be applied to records or fields. The advantage of the scheme lies in the fact that each record can be associated with one checksum, while each data element in the record can be verified using the checksum independently of the other data elements in the record. The security of the scheme depends on the difficulty of predicting the outputs of pseudo-random functions and on inverting the sibling intractable function family. The same approach can also be applied to the generation of encipherment keys for databases. © 1994.

Publication Date


  • 1994

Citation


  • Hardjono, T., Zheng, Y., & Seberry, J. (1994). Database authentication revisited. Computers and Security, 13(7), 573-580. doi:10.1016/0167-4048(94)90008-6

Scopus Eid


  • 2-s2.0-0028756331

Web Of Science Accession Number


Start Page


  • 573

End Page


  • 580

Volume


  • 13

Issue


  • 7

Abstract


  • Database authentication via cryptographic checksums represents an important approach to achieving an affordable safeguard of the integrity of data in publicly accessible database systems against illegal manipulations. This paper revisits the issue of database integrity and offers a new method of safeguarding the authenticity of data in database systems. The method is based on the recent development of pseudo-random function families and sibling intractable function families, rather than on the traditional use of cryptosystems. The database authentication scheme can be applied to records or fields. The advantage of the scheme lies in the fact that each record can be associated with one checksum, while each data element in the record can be verified using the checksum independently of the other data elements in the record. The security of the scheme depends on the difficulty of predicting the outputs of pseudo-random functions and on inverting the sibling intractable function family. The same approach can also be applied to the generation of encipherment keys for databases. © 1994.

Publication Date


  • 1994

Citation


  • Hardjono, T., Zheng, Y., & Seberry, J. (1994). Database authentication revisited. Computers and Security, 13(7), 573-580. doi:10.1016/0167-4048(94)90008-6

Scopus Eid


  • 2-s2.0-0028756331

Web Of Science Accession Number


Start Page


  • 573

End Page


  • 580

Volume


  • 13

Issue


  • 7