[Resource Topic] 2006/150: Demonstrating data possession and uncheatable data transfer

Welcome to the resource topic for 2006/150

Demonstrating data possession and uncheatable data transfer

Authors: Décio Luiz Gazzoni Filho, Paulo Sérgio Licciardi Messeder Barreto


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.

ePrint: https://eprint.iacr.org/2006/150

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .