Per d. Gennaro Celentani, già colonnello del reggimento cavalleria regina : nella Corte suprema di giustizia, a relazione del degnissimo signor presidente consultore Marrano.

Mode of access: Internet.

Indirizzo della deputazione israelitica di Roma a nostro signore Papa Pio IX., nell'udienza sovrana accordatale il giorno 10 gennaro 1848

Aus: La Speranza ; N. 10

Dell'argenteo imbusto al primo patrono S. Gennaro da re Carlo Secondo di Angiò decretato : con una disquisizione intorno al Libro delle spese della casa dello stesso re, dove s'indagano gli anni ai quali va assegnato se ne classificato le notizie più interessanti, e si fa accurata rassegna dei pesi e delle misure state in uso nel reame di Napoli /

Last leaf blank.

Aneddoti sulla basilica ostiense di S. Paolo riuniti nel 1823, dopo l'incendio, e recitati nell'Accademia Archeologica il dì 27. gennaro 1825.

Mode of access: Internet.

Elogio funebre alla gloriosa memoria di Ferdinando I, re del regno delle due Sicilie, ne'funerali a proprie spese celebrati nel di 16 gennaro dell'anno 1825 ... /

Mode of access: Internet.

Ne'funerali solenni per sua S.R.M. Ferdinando I, re del regno delle due Sicilie, celebrati nella cappella del Tesoro di S. Gennaro dalla Real Deputazione della medesima a'24 gennajo 1825 : orazione /

Mode of access: Internet.

Novelle del Tevere : discorso, particolarmente in difesa di S. Gregorio Magno, recitato in Academia archeologica il dì 7. gennaro 1819 t/

On t.p., publication date appears before publisher name.

Notizie sulle cripte mortuarie dette catacombe di S. Gennaro de'Poveri.

[Gift of John Harvey Treat, July 15, 1904].

Notizie intorno la colonna sbarcata il giorno 4 di gennaro del corrente anno 1828 : per servire alla riedificazione della basilica di S. Paolo sulla via Ostiense : redatte /

University of Illinois bookplate: "From the library of Conte Antonio Cavagna Sangiuliani di Gualdana Lazelada di Bereguardo, purchased 1921".

How to extract and expand randomness : a summary and explanation of existing results

We examine the use of randomness extraction and expansion in key agreement (KA) pro- tocols to generate uniformly random keys in the standard model. Although existing works provide the basic theorems necessary, they lack details or examples of appropriate cryptographic primitives and/or parameter sizes. This has lead to the large amount of min-entropy needed in the (non-uniform) shared secret being overlooked in proposals and efficiency comparisons of KA protocols. We therefore summa- rize existing work in the area and examine the security levels achieved with the use of various extractors and expanders for particular parameter sizes. The tables presented herein show that the shared secret needs a min-entropy of at least 292 bits (and even more with more realistic assumptions) to achieve an overall security level of 80 bits using the extractors and expanders we consider. The tables may be used to �nd the min-entropy required for various security levels and assumptions. We also �nd that when using the short exponent theorems of Gennaro et al., the short exponents may need to be much longer than they suggested.

Network

Network has emerged from a contempory worldwide phenomenon, culturally manifested as a consequence of globalization and the knowledge economy. It is in this context that the internet revolution has prompted a radical re-ordering of social and institutional relations and the associated structures, processes and places which support them. Within the duality of virtual space and the augmentation of traditional notions of physical place, the organizational structures pose new challenges for the design professions. Technological developments increasingly permit communication anytime and anywhere, and provide the opportunity for both synchronous and asynchronous collaboration. The resultant ecology formed through the network enterprise has resulted in an often convolted and complex world wherein designers are forced to consider the relevance and meaning of this new context. The role of technology and that of space are thus interwined in the relation between the network and the individual workplace. This paper explores a way to inform the interior desgn process for contemporary workplace environments. It reports on both theoretical and practical outcomes through an Australia-wide case study of three collaborating, yet independent business entities. It further suggests the link between workplace design and successful business innovation being realized between partnering organizations in Great Britain. Evidence presented indicates that, for architects and interior designers, the scope of the problem has widened, the depth of knowledge required to provide solutions has increased, and the rules of engagement are required to change. The ontological and epistemological positions adopted in the study enabled the spatial dimensions to be examined from both within and beyond the confines of a traditional design only viewpoint. Importantly it highlights the significance of a trans-disiplinary collaboration in dealing with the multiple layers and complexity of the contemporary social and business world, from both a research and practice perspective.

On the provable security of an efficient RSA-based pseudorandom generator

Pseudorandom Generators (PRGs) based on the RSA inversion (one-wayness) problem have been extensively studied in the literature over the last 25 years. These generators have the attractive feature of provable pseudorandomness security assuming the hardness of the RSA inversion problem. However, despite extensive study, the most efficient provably secure RSA-based generators output asymptotically only at most O(logn) bits per multiply modulo an RSA modulus of bitlength n, and hence are too slow to be used in many practical applications. To bring theory closer to practice, we present a simple modification to the proof of security by Fischlin and Schnorr of an RSA-based PRG, which shows that one can obtain an RSA-based PRG which outputs Ω(n) bits per multiply and has provable pseudorandomness security assuming the hardness of a well-studied variant of the RSA inversion problem, where a constant fraction of the plaintext bits are given. Our result gives a positive answer to an open question posed by Gennaro (J. of Cryptology, 2005) regarding finding a PRG beating the rate O(logn) bits per multiply at the cost of a reasonable assumption on RSA inversion.