Random numbers are a fundamental resource in science and engineering with important
applications in simulation and cryptography. The inherent randomness at the core of …

This book is rooted in the thesis that complexity theory is extremely rich in conceptual
content, and that this contents should be explicitly communicated in expositions and courses …

We formalize a new cryptographic primitive that we call Message-Locked Encryption (MLE),
where the key under which encryption and decryption are performed is itself derived from …

This chapter introduces the reader to the basic concept of a physically unclonable function
or PUF. Many research results on this topic were published over recent years in a variety of …

In 1977 Dalenius articulated a desideratum for statistical databases: nothing about an
individual should be learnable from the database that cannot be learned without access to …

This beginning graduate textbook describes both recent achievements and classical results
of computational complexity theory. Requiring essentially no background apart from …

In this work we provide efficient distributed protocols for generating shares of random noise,
secure against malicious participants. The purpose of the noise generation is to create a …

Csiszár and Körner's book is widely regarded as a classic in the field of information theory,
providing deep insights and expert treatment of the key theoretical issues. It includes in …

We provide formal definitions and efficient secure techniques for turning biometric
information into keys usable for any cryptographic application, and reliably and securely …

But, perhaps, we should start with a few words about graphs in general. They are, of course,
one of the prime objects of study in Discrete Mathematics. However, graphs are among the …