Learn More
—In this paper, we propose a fast search algorithm for a large fuzzy database that stores iris codes or data with a similar binary structure. The fuzzy nature of iris codes and their high dimensionality render many modern search algorithms, mainly relying on sorting and hashing, inadequate. The algorithm that is used in all current public deployments of(More)
Collusion between partners in Contract Bridge is an oft-used example in cryptography papers and an interesting topic for the development of covert channels. In this paper, a different type of collusion is discussed , where the parties colluding are not part of one team, but instead are multiple independent players, acting together in order to achieve a(More)
Existing low-latency anonymity networks are vulnerable to traffic analysis, so location diversity of nodes is essential to defend against attacks. Previous work has shown that simply ensuring geographical diversity of nodes does not resist, and in some cases exacerbates, the risk of traffic analysis by ISPs. Ensuring high autonomous-system (AS) diversity(More)
The Dining Cryptographers problem studies how to securely compute the boolean-OR function while preserving the privacy of each input bit. Since its first introduction by Chaum in 1988, it has attracted a number of solutions over the past twenty years. In this paper, we propose a new solution: Anonymous Veto Network (or AV-net). Our protocol is provably(More)
Peatlands are large terrestrial stores of carbon, and sustained CO2 sinks, but over the last century large areas have been drained for agriculture and forestry, potentially converting them into net carbon sources. More recently, some peatlands have been re-wetted by blocking drainage ditches, with the aims of enhancing biodiversity, mitigating flooding, and(More)