Project review

1. ACS College of Engineering
Apporoved by AICTE New Delhi,Affiliated to VTU ,Belagavi
(A unit of RajaRajeswari Group Of Institutions)
GET CODE:E186 COMED-K:E003 PGCET:T918
Project Title
TAMPER PROOF FILE REPLICATION FOR DATA
AVAILABILITY OF IPFS USERS
RAQEEBA E NOOR:(1AH22CS139)
SONU.V: (1AH22CS162)
SOUJANYA .K.S:(1AH22CS163)
RAMYA.G.K:(1AH23CS414)
Team
Under the Guidance of
Dr. A .KRISHNA KUMAR
Professor Dept. of CSE,ACSCE

2. Abstract
 Data availability plays a vital role in maintaining uninterrupted access to critical files.
Traditional cloud storage systems depend on centralized servers, which are prone to failures,
cyberattacks, or access restrictions—often leading to data loss.
 Blockchain-based file replication overcomes these limitations by storing multiple copies of data
across a decentralized network of nodes, ensuring accessibility even if some nodes go offline.
 This technology enhances security, transparency, and data integrity through its tamper proof
architecture.
 Decentralized storage platforms such as IPFS, File coin, and Arweave enable efficient file
distribution, minimizing risks of data loss and censorship.
 Such an approach is especially beneficial for industries like healthcare and finance, offering
secure, reliable, and censorship-resistant data storage without dependence on a single service
provider.

3. Literature survey

4. SL.NO TITLE OF THE
PROJECT
AUTHOR &
YEAR
OBJECTIVE ADVANTAGE DISADVANTAGE
2.
3.
Secure & Traceable
Companies File
Management System
Using Blockchain And
IPFS
Block Chain-based
File Replication For
Data Availability
Of IPFS Consumers
Cahyo
Arissabarona,
Sritrusta
Sukaridhoto,
Idris Winamo
2024
Priyanka
Uttarapally,
Paladi
Bhavani,Vysh
nava Divya,
Chatla Sriteja
With The Advancement Of
Cloud- Based File
Management Platforms,
Sharing And Storing Files
In The Company’s Can Be
Easily Achieved Through A
Variety Of File Sharing
Platform, How Ever This
Platform Are Lack Of
Security And Activity
Records For The Users
In the Interplanetary
File System (IPFS),
consumers can help
each other protect
data against
hardware failures and
improve data
availability through
replication
Security &
Immutability,
Traceability &
Transparency, Data
Integrity,
Decentralized
Storage, Cost-
effective Vs Full
Blockchain Storage,
Cross-organization
Collaboration
security &
Immutability,
Traceability &
Transparency, Data
Integrity,
Decentralized
Storage, Cost-
effective Vs Full
Blockchain Storage,
Cross-organization
Collaboration,
Regulatory
Compliance.
Storage Persistence
Issue, Scalability &
Performance, Complex
Implementation, Legal &
Privacy Concerns, Cost
Of Blockchain
Transactions, User
Adoption,
Partial Centralization
Risk.
Storage Persistence
Issue, Scalability &
Performance, Complex
Implementation, Legal &
Privacy Concerns, Cost
Of Blockchain
Transactions, User
Adoption,
Partial Centralization
Risk

5. SL.NO TITLE
OF THE
PROJEC
T
AUTHOR
& YEAR
OBJECTIVE ADVANTAGE DISADVANTAGE
4. Blockchai
n Data
Replicatio
n
Roberto De
Prisco,
Sergiy
Shevchenko
and
Pompeo
Faruolo2
The prominent
property of a
blockchain is that of
being immutable.
Moreover, a
blockchain has strong
resilience against
failures. There are
many approaches to
the implementation of
a blockchain, but the
most common one is
that of a fully
decentralized
distributed ledger.
security &
Immutability,
Traceability &
Transparency,
Data Integrity,
Decentralized
Storage, Cost-
effective Vs Full
Blockchain
Storage, Cross-
organization
Collaboration,
Regulatory
Compliance.
Storage Persistence
Issue, Scalability &
Performance,
Complex
Implementation,
Legal & Privacy
Concerns, Cost Of
Blockchain
Transactions, User
Adoption,
Partial Centralization
Risk

6. Problem Statement
 Traditional cloud storage systems depend on centralized servers, making
data vulnerable to failures ,hacking, and restrictions.
 If a central server crashes or is attacked, users may lose access to
important files. Additionally, centralized storage can be costly, lacks
transparency, and may be subject to censorship or data manipulation.
 There is a growing need for a more secure, decentralized, and efficient
storage system to ensure continuous data availability. Blockchain-based file
replication
 Blockchain-based file replication ensures that data remains accessible by
storing multiple copies across a decentralized network of computers
 instead of relying on a single server. This prevents data loss, hacking, and
censorship, making storage more secure and reliable.

7. OBJECTIVE OF THE PROJECT
• Ensure Data Integrity & Authenticity – Prevent unauthorized modifications to
replicated files by recording cryptographic file hashes on the blockchain.
• Achieve Secure File Replication – Enable multiple verified replicas of files
across distributed nodes, ensuring availability and fault tolerance.
• Provide Traceability & Auditability – Maintain an immutable ledger of all file
upload, update, and access operations for accountability.
• Eliminate Single Point of Failure – Use decentralized architecture to
enhance reliability compared to centralized storage servers.
• Enable Access Control – Implement permissioned access to replicated files,
ensuring only authorized users can retrieve or modify them.

8.  EXISTING SYSTEM:
• Previous replication methods in peer-to-peer (P2P) networks can also be
employed to enhance data availability in the IPFS network.
• These replication methods can be categorized into two classes denoted by
Cluster and Replication Contract.
• Cluster divides the replication system into clusters, with each cluster responsible
for local data storage and maintenance, optimizing storage usage.
• In Replication Contract, such as peers seek replication partners within the system
to establish replication contracts, enabling reciprocal data replication.
 DISADVANTAGES:
• previous replication methods exhibit limitations.
• However, Cluster lacks flexibility and cannot adapt to uneven distribution of peer
availability or storage capacity, or dynamism of P2P systems promptly.
• Replication Contract is susceptible to the influence of peers’ selfishness, leading
to a scenario where data availability is boosted for highly available peers while
diminished for less available peers. This can discourage the participation of less
available peers, prohibiting the P2P system from reaching a critical mass

9. PROPOSED SYSTEM
 To achieve overall data availability optimization while guaranteeing flexibility,
this paper introduces a blockchain-based file replication mechanism.
 The file replication algorithm in our proposed mechanism is inspired by the
innovative game-theoretic design of Arweave .
 Unlike previous methods, our proposed mechanism employs the Arweave-
inspired file replication algorithm that autonomously replicates files from other
peers according to a predefined rule: prioritizing less available files. Limiting the
selfishness of peers through a system-wide rule, data availability is equally
optimized for all peers.
 Moreover, since file replication for each peer is independent, peers can readily
adapt to changes within the system based on the information on the
blockchain, imbuing our proposed mechanism with remarkabl e flexibility.
 In addition, our file replication mechanism includes a smart contract for
dishonest peer judgment and exclusion, promoting honest cooperation among
peers

10. SYSTEM ARCHITECTURE DIAGRAM
Block Chain
--------
>-------
--------
>------
Smart contracts
IPFS
Replication system
Upload
update
delete
Promote
honest
cooperation
Query
information

11. MODULES IN THE PROJECT
File Upload Module
Smart Contract Module
File Replication Module
Verification & Audit Module
User Authentication Module

12. ARWEAVE-INSPIRED FILE REPLICATION
 Our file replication algorithm is inspired by the game theoretic design of
Arweave for permanent storage.
 Arweave is a stable, mature, and widely adopted protocol for
economically sustainable information permanence.
 Arweave achieves this ambitious goal through the ingenious combination
of blockweave and Succinct Proofs of Random Access (SPoRA)
 In a similar vein, our algorithm automatically prioritizes the replication of
“rare” files, i.e., less available files. Thus, our algorithm shields the replication
system from the selfishness of individual peers, leading to overall data
availability optimization.
 We define the availability of file f , A(f), as the probability of the event in
which at least one of its replicators (including its owner) is available. A(f)
can be calculated based on the availabilities of its replicators {r1,r2,...,rj}.

13. • A(f) = 1 − j i=1 (1 − A(ri))
where A(ri) is the availability of ri,
When a peer has less replicas than its shared storage capacity,
it periodically replicates the file with the lowest A(f). File availability
is increased by being replicated.
Specifically, each peer keeps a list containing at most s files for
replicas. This list is refreshed by the T-Man [15] gossiping protocol.
In an iteration of T-Man, each peer updates its list by gossiping
with the owner of a randomly selected file from its list.
In this process, to form the updated list, each peer selects s
least available files that are not its replicas from both lists and the
other party’s files. While the list is empty, the peer should select
files from their neighbours to fill the list.
After updating the list, each peer orders the files in its list in
ascending order of A(f), then replicates the file with the lowest
A(f), and joins the pool of replicators for the file.

14. Future Implementation
 Prototype Implementation
 Integrate the proposed mechanism into the IPFS network
 Evaluate practical performance and real-world applicability
 Privacy & Confidentiality
 Strengthen data confidentiality and privacy preservation
 Address increasing security demands for information systems
 Blockchain Integration
 Employ blockchain technology to build a privacy-preserving framework
 Ensure robust data security and trustworthy replication

15. THANK YOU