International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Demonstrating data possession and uncheatable data transfer

Authors:
D\'ecio Luiz Gazzoni Filho
Paulo S\'ergio Licciardi Messeder Barreto
Download:
URL: http://eprint.iacr.org/2006/150
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2006-21643,
  title={Demonstrating data possession and uncheatable data transfer},
  booktitle={IACR Eprint archive},
  keywords={cryptographic protocols / hash functions, RSA, peer-to-peer networks},
  url={http://eprint.iacr.org/2006/150},
  note={Submitted to SCN'2006 decio@decpp.net 13254 received 16 Apr 2006},
  author={D\'ecio Luiz Gazzoni Filho and Paulo S\'ergio Licciardi Messeder Barreto},
  year=2006
}