Demonstrating data possession and uncheatable data transfer

Décio Luiz Gazzoni Filho; Paulo Sérgio Licciardi Messeder Barreto

Paper 2006/150

Demonstrating data possession and uncheatable data transfer

Décio Luiz Gazzoni Filho and Paulo Sérgio Licciardi Messeder Barreto

Abstract

We observe that a certain RSA-based secure hash function is homomorphic. We describe a protocol based on this hash function which prevents `cheating' in a data transfer transaction, while placing little burden on the trusted third party that oversees the protocol. We also describe a cryptographic protocol based on similar principles, through which a prover can demonstrate possession of an arbitrary set of data known to the verifier. The verifier isn't required to have this data at hand during the protocol execution, but rather only a small hash of it. The protocol is also provably as secure as integer factoring.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Published elsewhere. Submitted to SCN'2006
Keywords: hash functions RSA peer-to-peer networks
Contact author(s): decio @ decpp net
History: 2006-04-22: received
Short URL: https://ia.cr/2006/150
License: CC BY

BibTeX

@misc{cryptoeprint:2006/150,
      author = {Décio Luiz Gazzoni Filho and Paulo Sérgio Licciardi Messeder Barreto},
      title = {Demonstrating data possession and uncheatable data transfer},
      howpublished = {Cryptology {ePrint} Archive, Paper 2006/150},
      year = {2006},
      url = {https://eprint.iacr.org/2006/150}
}