A node for anonymizing network data for analysis by an analyst node, the node comprising: processing circuitry configured to: partition network data into R non-overlapping partitions; generate anonymized data based at least in part on a first cryptographic key (k 0) and the partitioned network data; calculate a coordination vector (V 0) based at least in part on a random vector, wherein the coordination vector i) has a dimension of R and ii) each entry of the coordination vector denotes the number of iterations a second cryptographic key (k) is used for the corresponding partition; generate initialized data (L 0) based on the anonymized data, the second cryptographic key and the coordination vector, the second cryptographic key being independent from the first cryptographic key, wherein the generating of the initialized data includes applying at least one cryptographically based anonymization function to each one of the plurality of non-overlapping partitions according to the coordination vector; transmit, to the analyst node, the initialized data, the random vector, a security policy, the second cryptographic key and instructions to analyze n iterations of the initialized data and the security policy using the random vector and the second cryptographic key; receive, from the analyst node, results of the analysis of the n iterations of the initialized data and the security policy using the random vector and the second cryptographic key; and the analysis of an m-th iteration of the n iterations corresponding to an analysis of the initialized data with prefix preservation, the analysis of the remaining iterations of the n iterations failing to be prefixed preserved, where n and m are integers and n is greater than m. partition network data into R non-overlapping partitions; generate anonymized data based at least in part on a first cryptographic key (k 0) and the partitioned network data; calculate a coordination vector (V 0) based at least in part on a random vector, wherein the coordination vector i) has a dimension of R and ii) each entry of the coordination vector denotes the number of iterations a second cryptographic key (k) is used for the corresponding partition; generate initialized data (L 0) based on the anonymized data, the second cryptographic key and the coordination vector, the second cryptographic key being independent from the first cryptographic key, wherein the generating of the initialized data includes applying at least one cryptographically based anonymization function to each one of the plurality of non-overlapping partitions according to the coordination vector; transmit, to the analyst node, the initialized data, the random vector, a security policy, the second cryptographic key and instructions to analyze n iterations of the initialized data and the security policy using the random vector and the second cryptographic key; receive, from the analyst node, results of the analysis of the n iterations of the initialized data and the security policy using the random vector and the second cryptographic key; and the analysis of an m-th iteration of the n iterations corresponding to an analysis of the initialized data with prefix preservation, the analysis of the remaining iterations of the n iterations failing to be prefixed preserved, where n and m are integers and n is greater than m.