How can we authenticate broadcast messages? This chapter begins to answer our central
question. We introduce TESLA, short for Timed Efficient Stream Loss-tolerant Authentication …

Multicasting is an efficient communication mechanism for group-oriented applications such
as videoconferencing, broadcasting stock quotes, interactive group games, and video on …

In this paper, we consider a new class of unconditionally secure authentication codes, called
linear authentication codes (or linear A-codes). We show that a linear A-code can be …

Cover-free families have been investigated by many researchers, and several variations of
these set systems have been used in diverse applications. In this paper, we introduce a …

Aggregate signature schemes allow for the creation of a short aggregate of multiple
signatures. This feature leads to significant reductions of bandwidth and storage space in …

We study secure multiparty computation (MPC) in the dishonest majority setting providing
security with identifiable abort, where if the protocol aborts, the honest parties can agree …

We consider RSA-type schemes with modulus N= prq for r≥ 2. We present two new attacks
for small secret exponent d. Both approaches are applications of Coppersmith's method for …

Message integrity from one sender to one receiver is typically achieved by having the two
parties share a secret key to compute a Message Authentication Code (MAC). We consider …

A potentially serious problem with current digital signature schemes is that their underlying
hard problems from number theory may be solved by an innovative technique or a new …

This paper focuses on notions for the security of digital signature schemes whose resistance
against forgery is not dependent on unproven computational assumptions. We establish …