Set in Stone: Building America's New Generation of Arts Facilities, 1994-2008

In 2007, just before the domestic economy experienced a major trauma, the Cultural Policy Center at the Harris School and NORC at the University of Chicago launched a national study of cultural building in the United States. It was motivated by multiple requests from leading consultants in the cultural sector who found themselves involved in a steadily growing number of major building projects -- museums, performing arts centers (PACs), and theaters -- and from foundation officers who were frequently asked to help fund these infrastructure projects. With the generous support of the Andrew W. Mellon Foundation, the Kresge Foundation, and the John D. and Catherine T. MacArthur Foundation, we were able to conduct systematic scientific research on cultural building in the United States between 1994 and 2008 and come to a number of conclusions that have important implications for the cultural sector

CpG-ODN-induced sustained expression of BTLA mediating selective inhibition of human B cells.

BTLA (B- and T-lymphocyte attenuator) is a prominent co-receptor that is structurally and functionally related to CTLA-4 and PD-1. In T cells, BTLA inhibits TCR-mediated activation. In B cells, roles and functions of BTLA are still poorly understood and have never been studied in the context of B cells activated by CpG via TLR9. In this study, we evaluated the expression of BTLA depending on activation and differentiation of human B cell subsets in peripheral blood and lymph nodes. Stimulation with CpG upregulated BTLA, but not its ligand: herpes virus entry mediator (HVEM), on B cells in vitro and sustained its expression in vivo in melanoma patients after vaccination. Upon ligation with HVEM, BTLA inhibited CpG-mediated B cell functions (proliferation, cytokine production, and upregulation of co-stimulatory molecules), which was reversed by blocking BTLA/HVEM interactions. Interestingly, chemokine secretion (IL-8 and MIP1β) was not affected by BTLA/HVEM ligation, suggesting that BTLA-mediated inhibition is selective for some but not all B cell functions. We conclude that BTLA is an important immune checkpoint for B cells, as similarly known for T cells

Временные рубежи крупных изверженных провинций России: предварительный обзор

This is an initial step toward a full-scale review paper and map of Large Igneous Provinces (LIPs) for Russia

Non-malleable encryption: simpler, shorter, stronger

In a seminal paper, Dolev et al. [15] introduced the notion of non-malleable encryption (NM-CPA). This notion is very intriguing since it suffices for many applications of chosen-ciphertext secure encryption (IND-CCA), and, yet, can be generically built from semantically secure (IND-CPA) encryption, as was shown in the seminal works by Pass et al. [29] and by Choi et al. [9], the latter of which provided a black-box construction. In this paper we investigate three questions related to NM-CPA security: 1. Can the rate of the construction by Choi et al. of NM-CPA from IND-CPA be improved? 2. Is it possible to achieve multi-bit NM-CPA security more efficiently from a single-bit NM-CPA scheme than from IND-CPA? 3. Is there a notion stronger than NM-CPA that has natural applications and can be achieved from IND-CPA security? We answer all three questions in the positive. First, we improve the rate in the scheme of Choi et al. by a factor O(λ), where λ is the security parameter. Still, encrypting a message of size O(λ) would require ciphertext and keys of size O(λ2) times that of the IND-CPA scheme, even in our improved scheme. Therefore, we show a more efficient domain extension technique for building a λ-bit NM-CPA scheme from a single-bit NM-CPA scheme with keys and ciphertext of size O(λ) times that of the NM-CPA one-bit scheme. To achieve our goal, we define and construct a novel type of continuous non-malleable code (NMC), called secret-state NMC, as we show that standard continuous NMCs are not enough for the natural “encode-then-encrypt-bit-by-bit” approach to work. Finally, we introduce a new security notion for public-key encryption that we dub non-malleability under (chosen-ciphertext) self-destruct attacks (NM-SDA). After showing that NM-SDA is a strict strengthening of NM-CPA and allows for more applications, we nevertheless show that both of our results—(faster) construction from IND-CPA and domain extension from one-bit scheme—also hold for our stronger NM-SDA security. In particular, the notions of IND-CPA, NM-CPA, and NM-SDA security are all equivalent, lying (plausibly, strictly?) below IND-CCA securit

On Pseudorandom Encodings

We initiate a study of pseudorandom encodings: efficiently computable and decodable encoding functions that map messages from a given distribution to a random-looking distribution. For instance, every distribution that can be perfectly and efficiently compressed admits such a pseudorandom encoding. Pseudorandom encodings are motivated by a variety of cryptographic applications, including password-authenticated key exchange, “honey encryption” and steganography. The main question we ask is whether every efficiently samplable distribution admits a pseudorandom encoding. Under different cryptographic assumptions, we obtain positive and negative answers for different flavors of pseudorandom encodings, and relate this question to problems in other areas of cryptography. In particular, by establishing a twoway relation between pseudorandom encoding schemes and efficient invertible sampling algorithms, we reveal a connection between adaptively secure multiparty computation for randomized functionalities and questions in the domain of steganography