arXiv subjects

J. Rothe

Publications and source records attributed to J. Rothe.

57 records · Page 4Linked to original sources

arXiv2017

Performance of a CRESST-II Detector Module with True $4π$-veto

Scintillating, cryogenic bolometers are widely used in the field of rare event searches. Their main advantages are an excellent energy resolution and particle identification on an event-by-event basis. The sensitivity of experiments applying this detector technique can be limited by the performance of the light channel and the presence of external backgrounds in the region of interest. In the framework of the CRESST-II experiment, we developed and successfully tested a novel detector design addressing both challenges. Using a large scale ($\approx$\unit[60]{cm$^2$}), beaker-shaped silicon light absorber, the signal height recorded in the light channel is improved by a factor 2.5 compared to conventional CRESTT-II detector modules. In combination with a large carrier crystal, a true $4π$ veto system is established which allows to tag external background sources.

astro-ph.IM↗

arXiv2010

The Shield that Never Was: Societies with Single-Peaked Preferences are More Open to Manipulation and Control

Much work has been devoted, during the past twenty years, to using complexity to protect elections from manipulation and control. Many results have been obtained showing NP-hardness shields, and recently there has been much focus on whether such worst-case hardness protections can be bypassed by frequently correct heuristics or by approximations. This paper takes a very different approach: We argue that when electorates follow the canonical political science model of societal preferences the complexity shield never existed in the first place. In particular, we show that for electorates having single-peaked preferences, many existing NP-hardness results on manipulation and control evaporate.

cs.GT↗

arXiv1999

One-Way Functions in Worst-Case Cryptography: Algebraic and Security Properties

We survey recent developments in the study of (worst-case) one-way functions having strong algebraic and security properties. According to [RS93], this line of research was initiated in 1984 by Rivest and Sherman who designed two-party secret-key agreement protocols that use strongly noninvertible, total, associative one-way functions as their key building blocks. If commutativity is added as an ingredient, these protocols can be used by more than two parties, as noted by Rabi and Sherman [RS93] who also developed digital signature protocols that are based on such enhanced one-way functions. Until recently, it was an open question whether one-way functions having the algebraic and security properties that these protocols require could be created from any given one-way function. Recently, Hemaspaandra and Rothe [HR99] resolved this open issue in the affirmative, by showing that one-way functions exist if and only if strong, total, commutative, associative one-way functions exist. We discuss this result, and the work of Rabi, Rivest, and Sherman, and recent work of Homan [Hom99] that makes progress on related issues.

cs.CC↗