Cryptology ePrint Archive: Report 2006/150

Demonstrating data possession and uncheatable data transfer

D\'ecio Luiz Gazzoni Filho and Paulo S\'ergio 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.

Category / Keywords: cryptographic protocols / hash functions, RSA, peer-to-peer networks

Publication Info: Submitted to SCN'2006

Date: received 16 Apr 2006

Contact author: decio at decpp net

Available format(s): PDF | BibTeX Citation

Version: 20060422:183126 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]