Searcharxiv⌕ Search

arXiv subjects

Sándor Imre

Publications and source records attributed to Sándor Imre.

3 recordsLinked to original sources

An Efficient and Robust Social Network De-anonymization Attack

Releasing connection data from social networking services can pose a significant threat to user privacy. In our work, we consider structural social network de-anonymization attacks, which are used when a malicious party uses connections in a public or other identified network to re-identify users in an anonymized social network release that he obtained previously. In this paper we design and evaluate a novel social de-anonymization attack. In particular, we argue that the similarity function used to re-identify nodes is a key component of such attacks, and we design a novel measure tailored for social networks. We incorporate this measure in an attack called Bumblebee. We evaluate Bumblebee in depth, and show that it significantly outperforms the state-of-the-art, for example it has higher re-identification rates with high precision, robustness against noise, and also has better error control.

cs.CR↗

Quantum Computation Based Probability Density Function Estimation

Signal processing techniques will lean on blind methods in the near future, where no redundant, resource allocating information will be transmitted through the channel. To achieve a proper decision, however, it is essential to know at least the probability density function (pdf), which to estimate is classically a time consumption and/or less accurate hard task, that may make decisions to fail. This paper describes the design of a quantum assisted pdf estimation method also by an example, which promises to achieve the exact pdf by proper setting of parameters in a very fast way.

quant-ph↗

Maximum Likelihood Based Quantum Set Separation

In this paper we introduce a method, which is used for set separation based on quantum computation. In case of no a-priori knowledge about the source signal distribution, it is a challenging task to find an optimal decision rule which could be implemented in the separating algorithm. We lean on the Maximum Likelihood approach and build a bridge between this method and quantum counting. The proposed method is also able to distinguish between disjunct sets and intersection sets.

quant-ph↗