Le Secret des secrets, attribué à Aristote.

Acquis le 29 juin 1827 de M. Pontier, libraire d'Aix-en-Provence, pour le prix de 25 francs; cf. B.n.F., département des Manuscrits, Archives Modernes 492ter, registre des acquisitions du département des Manuscrits 1821-1830, f. 196 "Ms. in 4° sur velin, maroquin rouge, intitulé Secreta secretorum Aristotelis ad Alexandrum"; — note du XVIe s. "Hunc librum ex Avinione olim attulit nobilis et eruditus vir Guilelmus de Pleurre Priceii ad Albam dum in humanis ageret dominus, quem longo postea tempore possedit, et in pretio habuit ejus filius nobilis atque eruditus nec minus honestus ac praepotens vir Colinus de Pleurre qui anno Domini 1504 mensis martii die tertia medio sublatus, Ludovica Mole ejus conjux cordata atque honesta foemina hunc mihi Nicolao Prunel dono dedit, quam Deus longaevam faveat; Colino vero pro dicto locum pacis misericorditer tribuat. Nicolaus Prunel, abbas coenobii S. Lupi" (75)

La guerre : récit épisodique d'un siège au XVIe siècle / par Carlo Du Monge,... ; illustrations de V. Poirson. suivi de : Le secret du fer / par J. Protche de Viville,.... Les Lansquenets / par Ernest d'Hervilly,...

Comprend : Les Lansquenets ; Le secret du fer

On codes, matroids, and secure multiparty computation from linear secret-sharing schemes

Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special class of secret sharing schemes, namely, multiplicative linear secret sharing schemes (LSSSs), are studied. Such schemes are known to enable multiparty computation protocols secure against general (nonthreshold) adversaries.Two open problems related to the complexity of multiplicative LSSSs are considered in this paper. The first one deals with strongly multiplicative LSSSs. As opposed to the case of multiplicative LSSSs, it is not known whether there is an efficient method to transform an LSSS into a strongly multiplicative LSSS for the same access structure with a polynomial increase of the complexity. A property of strongly multiplicative LSSSs that could be useful in solving this problem is proved. Namely, using a suitable generalization of the well-known Berlekamp–Welch decoder, it is shown that all strongly multiplicative LSSSs enable efficient reconstruction of a shared secret in the presence of malicious faults. The second one is to characterize the access structures of ideal multiplicative LSSSs. Specifically, the considered open problem is to determine whether all self-dual vector space access structures are in this situation. By the aforementioned connection, this in fact constitutes an open problem about matroid theory, since it can be restated in terms of representability of identically self-dual matroids by self-dual codes. A new concept is introduced, the flat-partition, that provides a useful classification of identically self-dual matroids. Uniform identically self-dual matroids, which are known to be representable by self-dual codes, form one of the classes. It is proved that this property also holds for the family of matroids that, in a natural way, is the next class in the above classification: the identically self-dual bipartite matroids.

Secret information acquisition in Cournot markets

Two-stage game models of information acquisition in stochastic oligopoliesrequire the unrealistic assumption that firms observe the precision ofinformation chosen by their competitors before determining quantities. Thispaper analyzes secret information acquisition as a one-stage game. Relativeto the two-stage game firms are shown to acquire less information. Policyimplications based on the two-stage game yield, therefore, too high taxes ortoo low subsidies for research activities. For the case of heterogeneousduopoly it is shown that comparative statics results partly depend on theobservability assumption.