Aktenmässiger Bericht über den geheimen deutschen Bund und das Turnwesen : nebst einleitenden Bemerkungen über die frühern geheimen Verbindungen /

Has also series t.p.

Thian ti hwui. The Hung-league, or Heaven-earth-league, a secret society with the Chinese in China and India,

Part of plates are photostat replacements of originals.

Offizieller Bericht über die Verhandlungen zur Gründung eines deutschen Parlaments

Welsch (Projektbearbeiter): Bericht über die Tätigkeit des Vorparlaments in Frankfurt am Main (31. März bis 3. April 1848). Das Vorparlament war eine unmittelbar aus der revolutionären Bewegung hervorgegangene Versammlung von 556 Mitgliedern, die ohne direktes Volksmandat zustandekam und auch sehr ungleichmäßig zusammengesetzt war. Über die zahlenmäßig schwache Linke siegte die Richtung (unter Heinrich von Gagern), welche die Wahl eines Nationalparlamentes in Übereinstimmung mit den Einzelregierungen anstrebte. Als Übergangsorgan schuf das Vorparlament den sogenannten Fünfzigerausschuß, der bis zum Zusammentritt der Nationalversammlung am 18. Mai 1848 tagte. - Die vorliegende Broschüre enthält neben den Protokollen der Verhandlungen die Namensverzeichnisse der Mitglieder des Vorparlaments sowie des Fünfziger-Ausschusses

Einzug der Mitglieder des Vorparlaments in die Paulskirche

gez. v. J.Ventadour ; gedr. v. Ed. Gust. May

Deutsche Bundes-Acte.

Mode of access: Internet.

Correspondance diplomatique de m. de Bismarck (1851-1859)

Translation of Preussen im bundestag 1851-1859, Leipzig, 1882.

Die neue Generation.

Microfiche.

Deutschlands constitutionen, enthaltend: die beiden hauptgrundverträge des Deutschen bundes und die seit dem jahre 1814 in einzelnen bundestaaten eingeführten verfassungsurkunden und gesetze über landständische verfassung.

Mode of access: Internet.

Corpus juris Confoederationis Germanicae, oder Vollständige Sammlung der Quellen des deutschen Bundesrechts, vom Lüneviller Frieden bis zu den neuesten Bundesgesetzen, nach den Original-documenten und mit besonderer Genehmigung der hohen Bundesversammlung,

Cover serves as title-page.

Roster of the 1st Crescent City Regiment : Col. W.T. Vaudry commanding, to April 25th, 1877.

The regiment was previously known as the Crescent City White League; as such, it was a secret society opposed to the Reconstruction government of Louisiana.

Secret instructions of the Jesuits: with an appendix, containing a short historical account of the Society of the Jesuits, their maxims, the Jesuits' oath, etc. etc.

First published under title, Monita privata Societatis Jesu, Notobrigae, 1612 (i.e. Cracow, 1614) cf. Wetzer und Welte's Kirchenlexikon. 2 aufl. 1886-1901. v. 8, col. 1776.

Intrusion detection system for encrypted networks using secret-sharing schemes

Secret-sharing schemes describe methods to securely share a secret among a group of participants. A properly constructed secret-sharing scheme guarantees that the share belonging to one participant does not reveal anything about the shares of others or even the secret itself. Besides the obvious feature which is to distribute a secret, secret-sharing schemes have also been used in secure multi-party computations and redundant residue number systems for error correction codes. In this paper, we propose that the secret-sharing scheme be used as a primitive in a Network-based Intrusion Detection System (NIDS) to detect attacks in encrypted networks. Encrypted networks such as Virtual Private Networks (VPNs) fully encrypt network traffic which can include both malicious and non-malicious traffic. Traditional NIDS cannot monitor encrypted traffic. Our work uses a combination of Shamir's secret-sharing scheme and randomised network proxies to enable a traditional NIDS to function normally in a VPN environment. In this paper, we introduce a novel protocol that utilises a secret-sharing scheme to detect attacks in encrypted networks.

Detecting attacks in encrypted networks using secret-sharing schemes

Secret-sharing schemes describe methods to securely share a secret among a group of participants. A properly constructed secret-sharing scheme guarantees that the share belonging to one participant does not reveal anything about the shares of others or even the secret itself. Besides being used to distribute a secret, secret-sharing schemes have also been used in secure multi-party computations and redundant residue number systems for error correction codes. In this paper, we propose that the secret-sharing scheme be used as a primitive in a Network-based Intrusion Detection System (NIDS) to detect attacks in encrypted Networks. Encrypted networks such as Virtual Private Networks (VPNs) fully encrypt network traffic which can include both malicious and non-malicious traffic. Traditional NIDS cannot monitor such encrypted traffic. We therefore describe how our work uses a combination of Shamir's secret-sharing scheme and randomised network proxies to enable a traditional NIDS to function normally in a VPN environment.

Decomposition construction for secret sharing schemes with graph access structures in polynomial time

The purpose of this paper is to describe a new decomposition construction for perfect secret sharing schemes with graph access structures. The previous decomposition construction proposed by Stinson is a recursive method that uses small secret sharing schemes as building blocks in the construction of larger schemes. When the Stinson method is applied to the graph access structures, the number of such “small” schemes is typically exponential in the number of the participants, resulting in an exponential algorithm. Our method has the same flavor as the Stinson decomposition construction; however, the linear programming problem involved in the construction is formulated in such a way that the number of “small” schemes is polynomial in the size of the participants, which in turn gives rise to a polynomial time construction. We also show that if we apply the Stinson construction to the “small” schemes arising from our new construction, both have the same information rate.

Dual compressible hybrid quantum secret sharing schemes based on extended unitary operations

A crucial issue with hybrid quantum secret sharing schemes is the amount of data that is allocated to the participants. The smaller the amount of allocated data, the better the performance of a scheme. Moreover, quantum data is very hard and expensive to deal with, therefore, it is desirable to use as little quantum data as possible. To achieve this goal, we first construct extended unitary operations by the tensor product of n, n ≥ 2, basic unitary operations, and then by using those extended operations, we design two quantum secret sharing schemes. The resulting dual compressible hybrid quantum secret sharing schemes, in which classical data play a complementary role to quantum data, range from threshold to access structure. Compared with the existing hybrid quantum secret sharing schemes, our proposed schemes not only reduce the number of quantum participants, but also the number of particles and the size of classical shares. To be exact, the number of particles that are used to carry quantum data is reduced to 1 while the size of classical secret shares also is also reduced to l−2 m−1 based on ((m+1, n′)) threshold and to l−2 r2 (where r2 is the number of maximal unqualified sets) based on adversary structure. Consequently, our proposed schemes can greatly reduce the cost and difficulty of generating and storing EPR pairs and lower the risk of transmitting encoded particles.