Hercules am Scheidewege : Ob preus'sch? Ob deutsch? des is die Frage ; Ick weeß nich wie mir is

Satirisches Blatt, in Berliner Mundart

Geschichte des Sch'thijasteines

von J. Horovicz

Raschi (Rabbi Sch'lomo ben Isak), geb. 1040 zu Troyes, gest. 13. Juli 1105 zu Troyes : ein Lebensbild

von S. Rothschild

Bill of disbursments [for the] sch[oone]r Lydia : manuscript, 1790

List of ship's expenses between Feb. 7 and May 25; dated at Aux Cayes, (Haiti) May 27, 1790; includes money paid to an interpreter at Tobago, workers for ship maintenance, and various harbor officials; and notation of purchases for goods such as sugar, coffee, rice, tar, food, and rum.

Geologische Beschreibung des Kantons St. Gallen und seiner umgebungen Enthalten auf Blatt IX des eidg. Atlas mit Benutzung des Nachlasses von A. Escher v. d. Linth bearb. von Reallehrer Gutzwiller, prof. Kaufmann, dr. Cas. Mösch.

Each vol. has also special t.p.

Těsnopisecké zprávy o schůzích ...

None published for years 1939-44.

Tisky k těsnopiseckým zprávám o schůzích Národního shromáždění československého.

None published for the years 1939-44.

Poselství presidenta T.G. Masaryka : přednesené ve výroční schůzi Národního shromáždění dne 28. října 1919

Mode of access: Internet.

Rozbor staročeské literatury čjtaný we schůzkách Králowské české společnosti nauk, Sekcj filologické, r. 1840 a 1841.

"Wyňato z pogednánj Kr. české společnosti nauk, řady V, djlu 2."

Těsnopisecká zpráva o I. schůzi Národního shroḿždění československého v Praze dne 14. listopadu 1918.

Mode of access: Internet.

Practical client puzzles in the standard model

Client puzzles are cryptographic problems that are neither easy nor hard to solve. Most puzzles are based on either number theoretic or hash inversions problems. Hash-based puzzles are very efficient but so far have been shown secure only in the random oracle model; number theoretic puzzles, while secure in the standard model, tend to be inefficient. In this paper, we solve the problem of constucting cryptographic puzzles that are secure int he standard model and are very efficient. We present an efficient number theoretic puzzle that satisfies the puzzle security definition of Chen et al. (ASIACRYPT 2009). To prove the security of our puzzle, we introduce a new variant of the interval discrete logarithm assumption which may be of independent interest, and show this new problem to be hard under reasonable assumptions. Our experimental results show that, for 512-bit modulus, the solution verification time of our proposed puzzle can be up to 50x and 89x faster than the Karame-Capkum puzzle and the Rivest et al.'s time-lock puzzle respectively. In particular, the solution verification tiem of our puzzle is only 1.4x slower than that of Chen et al.'s efficient hash based puzzle.