A method for generating a universal data storage, comprising: receiving from a first data provider, by a receiving device of a processing server, a data signal superimposed with a plurality of data values; generating, by a hashing module of the processing server, a key for each of the plurality of data values, wherein the respective key is generated via application of a collision-resistant hashing algorithm to the associated data value; executing, by a querying module of the processing server, a first query on a database of the processing server to store each of the plurality of data values and the associated generated key as a plurality of key-value pairs in the database; receiving from a second data provider, by the receiving device of the processing server, a data signal superimposed with a plurality of additional key-value pairs, wherein each value of the plurality of additional key-value pairs is not included in the plurality of data values; and executing, by the querying module of the processing server, a second query on the database of the processing server to store each of the plurality of additional key-value pairs in the database, wherein each key included in the plurality of additional key-value pairs is generated via application of the collision-resistant hashing algorithm to the associated value; receiving, by the receiving device of the processing server, a data signal superimposed with a rehash request, wherein the rehash request indicates a different collision-resistant hashing algorithm; generating, by the hashing module of the processing server, a new key for each of the plurality of data values and each value included in the plurality of additional key-value pairs; and executing, by the querying module of the processing server, a third query on the database of the processing server to replace the key in each of the plurality of key-value pairs and plurality of additional key-value pairs with the respective generated new key. receiving from a first data provider, by a receiving device of a processing server, a data signal superimposed with a plurality of data values; generating, by a hashing module of the processing server, a key for each of the plurality of data values, wherein the respective key is generated via application of a collision-resistant hashing algorithm to the associated data value; executing, by a querying module of the processing server, a first query on a database of the processing server to store each of the plurality of data values and the associated generated key as a plurality of key-value pairs in the database; receiving from a second data provider, by the receiving device of the processing server, a data signal superimposed with a plurality of additional key-value pairs, wherein each value of the plurality of additional key-value pairs is not included in the plurality of data values; and executing, by the querying module of the processing server, a second query on the database of the processing server to store each of the plurality of additional key-value pairs in the database, wherein each key included in the plurality of additional key-value pairs is generated via application of the collision-resistant hashing algorithm to the associated value; receiving, by the receiving device of the processing server, a data signal superimposed with a rehash request, wherein the rehash request indicates a different collision-resistant hashing algorithm; generating, by the hashing module of the processing server, a new key for each of the plurality of data values and each value included in the plurality of additional key-value pairs; and executing, by the querying module of the processing server, a third query on the database of the processing server to replace the key in each of the plurality of key-value pairs and plurality of additional key-value pairs with the respective generated new key.