"... I want an Ocean between us!" : Letters from Samuel Kahn, devoted father of one of the thousand children brought from Germany to the United States in 1934.

The manuscript contains letters written by Samuel Kahn to his daughter in the USA between 1934 and 1937.

Letters from N.H. Gould of Newport, Rhode Island

Digital image

Letters to Reverend Peixotto announcing election of Naphtali Phillips as Parnas

Digital image

Letters to Aaron Levy from Isaac M. Gomez

Digital image

Letters from Moise and Jacob Seixas to K. K. S. I. regarding reduction in seat costs because they are refugees

Digital image

Letters and receipts from Sir Moses Montefiore

Digital image

Letters from Curacao to K. K. S. I.

Digital image

Copies of letters regarding various ketubot

Digital image

Letters regarding election of trustees

Digital image

Manuscript Items relating to the Civil War, including letters

Digital image

Various letters to Jacques Judah Lyons

Digital image

Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks

We present a distributed algorithm that finds a maximal edge packing in O(Δ + log* W) synchronous communication rounds in a weighted graph, independent of the number of nodes in the network; here Δ is the maximum degree of the graph and W is the maximum weight. As a direct application, we have a distributed 2-approximation algorithm for minimum-weight vertex cover, with the same running time. We also show how to find an f-approximation of minimum-weight set cover in O(f2k2 + fk log* W) rounds; here k is the maximum size of a subset in the set cover instance, f is the maximum frequency of an element, and W is the maximum weight of a subset. The algorithms are deterministic, and they can be applied in anonymous networks.

“And now to the rest of the trash…” Representations of begging Roma and an ideal society in two Nordic newspapers

Since begging East European Roma became a common view in the streets of larger Nordic cities, vivid discussions about their presence and activities have been carried out in the mass media. This thesis examines the public debates in Finland and Norway through a discursive analysis and comparison of press content from the two countries. The aim of the study is firstly to identify the prominent discourses which construct certain images of the beggars, as well as the elements and internal logics that these discourses are constructed around. But in addition to scrutinizing representations of the Roma, also an opposite perspective is applied. In accordance with the theoretical concept of ‘othering’, debates about ‘them’ are assumed to simultaneously reveal something significant about ‘us’. The second research question is thus what kind of images of the ideal Finnish and Norwegian societies are reflected in the data, and which societal values are salient in these images. The analysis comprises 79 texts printed in the main Finnish and Norwegian quality newspapers; Helsingin Sanomat and Aftenposten. The data consists of news articles, editorials, columns and letters to the editor from a three-month period in the summer of 2010. The analysis was carried out within the theoretical and methodological framework of critical discourse analysis as outlined by Norman Fairclough. A customized nine-step coding scheme was developed in order to reach the most central dimensions of the texts. Seven main discourses were identified; the Deprivation-solidarity, Human rights, Order, Crime, Space and majority reactions, Authority control, and Authority critique discourse. These were grouped into two competing normative stances on what an ideal society looks like; the exclusionary and the inclusionary stance. While the exclusionary stance places the begging Roma within a frame of crime, illegitimate use of public space and threat to the social order, the other advocates an attitude of solidarity and humanitarian values. The analysis points to a dominance of the former, although it is challenged by the latter. The Roma are “individualized” by quoting and/or presenting them by name in a fair part of the Finnish news articles. In Norway, the opposite is true; there the beggars are dominantly presented as anonymous and passive. Overall, the begging Roma are subjected to a double bind as they are faced with simultaneous expectations of activity and passivity. Theories relating to moral panics and ‘the good enemy’ provide for a deepened understanding of the intensity of the debates. Keywords: East European Roma, begging, media, newspapers, Helsingin Sanomat, Aftenposten, critical discourse analysis, Norman Fairclough, othering, ideal society, moral panics, good enemy, double bind, Finland, Norway

Anonymous Authentication with Shared Secrets

Anonymity and authenticity are both important yet often conflicting security goals in a wide range of applications. On the one hand for many applications (say for access control) it is crucial to be able to verify the identity of a given legitimate party (a.k.a. entity authentication). Alternatively an application might require that no one but a party can communicate on its behalf (a.k.a. message authentication). Yet, on the other hand privacy concerns also dictate that anonymity of a legitimate party should be preserved; that is no information concerning the identity of parties should be leaked to an outside entity eavesdropping on the communication. This conflict becomes even more acute when considering anonymity with respect to an active entity that may attempt to impersonate other parties in the system. In this work we resolve this conflict in two steps. First we formalize what it means for a system to provide both authenticity and anonymity even in the presence of an active man-in-the-middle adversary for various specific applications such as message and entity authentication using the constructive cryptography framework of Mau11, MR11]. Our approach inherits the composability statement of constructive cryptography and can therefore be directly used in any higher-level context. Next we demonstrate several simple protocols for realizing these systems, at times relying on a new type of (probabilistic) Message Authentication Code (MAC) called key indistinguishable (KI) MACs. Similar to the key hiding encryption schemes of BBDP01] they guarantee that tags leak no discernible information about the keys used to generate them.