Demonstrating data possession and uncheatable data transfer

@article{Filho2006DemonstratingDP,
  title={Demonstrating data possession and uncheatable data transfer},
  author={D{\'e}cio Luiz Gazzoni Filho and Paulo S. L. M. Barreto},
  journal={IACR Cryptology ePrint Archive},
  year={2006},
  volume={2006},
  pages={150}
}
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… CONTINUE READING
Highly Influential
This paper has highly influenced 16 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 244 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 139 extracted citations

Dynamic and Public Auditing with Fair Arbitration for Cloud Data

IEEE Transactions on Cloud Computing • 2018
View 4 Excerpts
Highly Influenced

A position-aware Merkle tree for dynamic cloud data integrity verification

Soft Comput. • 2017
View 3 Excerpts
Highly Influenced

Enabling public auditing for shared data in cloud storage supporting identity privacy and traceability

Journal of Systems and Software • 2016
View 4 Excerpts
Highly Influenced

On the Public Key-Based Auditing Methods

2015 5th International Conference on IT Convergence and Security (ICITCS) • 2015
View 5 Excerpts
Highly Influenced

Remote Integrity Check with Dishonest Storage Server

IACR Cryptology ePrint Archive • 2008
View 3 Excerpts
Highly Influenced

244 Citations

02040'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 244 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

On-the-fly verification of rateless erasure codes for efficient content distribution

IEEE Symposium on Security and Privacy, 2004. Proceedings. 2004 • 2004
View 6 Excerpts
Highly Influenced

, and Volker Stemann . Practical loss - resilient codes

Michael Mitzenmacher Michael G. Luby, M. Amin Shokrollahi, Daniel A. Spielman
1997

Lenstra , and Ron Steinfeld . VSH , an efficient and provable collision resistant hash function

Scott Contini, K Arjen
-1

Similar Papers

Loading similar papers…