About

Zentavault is a new type of private data storage aimed at revolutionizing the cloud storage service space. Zentavault will start in 2021 Q4.

What is Zentavault

Zentavault is a new type of private data storage aimed at revolutionizing the cloud storage service space. Cloud servers and modern data storage services rely on centralized storage systems. These act as a sort of mega hard drives and are known to contain flaws in their security and privacy protocols. Your data can potentially be logged and accessed by either service providers or unwelcome third parties.

Zentavault is a service that acts as an encryption delivery tool, which can securely distribute data on the Interplanetary File System by using the Zentagateway. This state of the art encryption and file sorting service utilizes the Zentachain ecosystem. Zentavault doesn't have a central storage facility or a backup database.

You have full ownership of your data accessible only by the use of your personal private encryption key. Once your data is encrypted and stored it can stay in place indefinitely on IPFS until the need to access it arises. It requires no monthly service fees. Instead, there is a small transaction fee to upload or download your data.

InterPlanetary File System (IPFS)

The modern internet, though it is one of the breakthrough technologies of our age, has shown to have limitations since its inception in the 1990s. As technological advances progress, more and more tech is shown to be in need of either upgrading or even complete conceptual reimagining. Such is the case with the HTTP protocol.

In recent times we have seen an increased demand for solutions that would address the issues of privacy, security, and speed, the areas in which the HTTP protocol hasn’t shown to be “up to the task”, so to speak. Fortunately, IPFS has been put forward as an idea that provides solutions to these problems.

How does it work?

We can look at it in the terms of a BitTorrent swarm but with the ability to store and track file versions over time. Unlike the HTTP which works by mapping the resources via location-based IP addresses, IPFS uses a content-addressed system. This decentralized system stores files across peers and enables access to them via a cryptographic hash on a file that is used as the address. This means that the user becomes the client and the host at the same time.

It is made possible by the Merkle DAG (Directed Acyclic Graphs) data architecture and ensures immutability and content versioning on IPFS. Because of their similar structures, IPFS is a perfect fit for blockchain integration. It goes a bit further than that, though, solving blockchain’s nagging issue of data storage and together with blockchain creates a solution for storing, encrypting, and sharing large data and files. Although still in its infancy, IPFS has all the tools to become the successor to HTTP and usher in a new era of the World Wide Web.

IPFS Identities

Nodes are identified by a Node-Id, the cryptographic hash3 of a public-key, created with S/ Kademlia’s static crypto puzzle. Nodes store their public and private keys (encrypted with a passphrase). Users are free to initiate a "new" node ID during each launch but lose some acquired network advantages, it is recommended that the nodes remain the same.

IPFS Network

IPFS nodes communicate regularly with hundreds of other nodes in the network, across the wide internet. The IPFS network stack features:

  • Transport: IPFS can use any transport protocol, and is best suited for WebRTC Data Channels (for browser connectivity) or uTP(LEDBAT).

  • Reliability: IPFS can provide reliability if underlying networks do not provide it, using uTP (LEDBAT) or SCTP.

  • Connectivity: IPFS also uses ICE NAT traversal techniques.

  • Integrity: optionally checks the integrity of messages using a hash checksum.

  • Authenticity: optionally checks the authenticity of messages using HMAC with the sender’s public key.

IPFS Routing

For routing, IPFS uses Distributed Sloppy Hash Tables based on S/Kademlia and Coral. Its purpose is to:

  1. Announce data being added to the nodes

  2. Locate data requested by specific nodes

Data equal lesser than 1KB in size is stored directly on the DHT. For data larger than 1KB, DHT stores references, which are the Node-Ids of peers who can serve the block.