This paper introduces a high-security post-quantum stateless hash-based signature scheme
that signs hundreds of messages per second on a modern 4-core 3.5 GHz Intel CPU …

Abstract At PKC 2010 Smart and Vercauteren presented a variant of Gentry's fully
homomorphic public key encryption scheme and mentioned that the scheme could support …

We focus on some specific problems in distribution testing, taking goodness-of-fit as a
running example. In particular, we do not aim to provide a comprehensive summary of all the …

Hash tables are a fundamental data structure for effectively storing and accessing sparse
data, with widespread usage in domains ranging from computer graphics to machine …

DNS is one of the fundamental and ancient protocols on the Internet that supports many
network applications and services. Unfortunately, DNS was designed without security in …

Side-channel attacks and in particular differential power analysis (DPA) attacks pose a
serious threat to cryptographic implementations. One approach to counteract such attacks …

We study the role of interactivity in distributed statistical inference under information
constraints, eg, communication constraints and local differential privacy. We focus on the …

Cyclic Redundancy Check (CRC) is a computationally inexpensive function readily
available in many high-speed networking devices, and thus it is used extensively as a hash …

In this paper, we describe and analyze the security of the AES-GCM-SIV mode of operation,
as defined in the CFRG specification\cite {CFRG}. This mode differs from the original GCM …

Hashing is a fundamental operation in database management, playing a key role in the
implementation of numerous core database data structures and algorithms. Traditional hash …