Quantum Bloom Filter and Its Applications

Abstract

A quantum Bloom filter is a spatially more efficient data structure, which is used to represent a set of elements by using (log) qubits. In this paper, we define and design a quantum Bloom filter and its corresponding algorithms. Due to the reversibility of quantum operators, it can not only add a new element to a quantum Bloom filter but also delete an existing element from the quantum Bloom filter. Furthermore, we employ the quantum Bloom filter to solve two private issues, i.e., Oblivious Setmember Decision and Multiparty Private Set Intersection Cardinality. The results show that the quantum Bloom filter has inherent advantages in privacy-preserving applications concerning set operations.

A Feasible Quantum Sealed-Bid Auction Scheme Without an Auctioneer

“…However, with the development of quantum computing [10,11], classical cryptography will face enormous challenges, because wellknown cryptographic algorithms (e.g., RSA) are vulnerable to attacks from quantum computers or fast quantum algorithms [12]. On the other hand, in order to solve these challenges, there appears quantum cryptography [13]. Its security only depends on the fundamental laws of quantum mechanics so that it can guarantee unconditional security in theory.…”