Sebastian Berndt

Learn More
While the theoretical aspects concerning the computation of tree width – one of the most important graph parameters – are well understood, it is not clear how it can be computed practically. We present the open source Java library Jdrasil that implements several different state of the art algorithms for this task. By experimentally comparing these(More)
Residuality plays an essential role for learning finite automata. While residual deterministic and nondeterministic automata have been understood quite well, fundamental questions concerning alternating automata (AFA) remain open. Recently, Angluin, Eisenstat, and Fisman [3] have initiated a systematic study of residual AFAs and proposed an algorithm called(More)
The motion of silver ions in (AgI)x-(Ag2O-B2O3)1-x glasses with AgI concentrations of x=0.5 and 0.7 was studied using 109Ag-NMR. The NMR spectra were analyzed in terms of a superposition of two different contributions. These are associated with Ag ions, which hop on vastly different time scales. The existence of dynamic heterogeneity, i.e. the existence of(More)
The goal of an algorithm substitution attack (ASA), also called a subversion attack (SA), is to replace an honest implementation of a cryptographic tool by a subverted one which allows to leak private information while generating output indistinguishable from the honest output. Bellare, Paterson, and Rogaway provided at CRYPTO '14 a formal security model to(More)
We present the first complexity-theoretic secure steganographic protocol which, for any communication channel, is provably secure, reliable, and has nearly optimal bandwidth. Our system is unconditionally secure, i.e. our proof does not rely on any unproven complexity-theoretic assumption, like e.g. the existence of one-way functions. This disproves the(More)
  • 1