High efficiency In Vivo genome engineering with a simplified 15-RVD GoldyTALEN design

published_or_final_versio

Cryptanalysis of an image encryption scheme

2006-2007 > Academic research: refereed > Publication in refereed journalVersion of RecordPublishe

Finitary Deduction Systems

Cryptographic protocols are the cornerstone of security in distributed systems. The formal analysis of their properties is accordingly one of the focus points of the security community, and is usually split among two groups. In the first group, one focuses on trace-based security properties such as confidentiality and authentication, and provides decision procedures for the existence of attacks for an on-line attackers. In the second group, one focuses on equivalence properties such as privacy and guessing attacks, and provides decision procedures for the existence of attacks for an offline attacker. In all cases the attacker is modeled by a deduction system in which his possible actions are expressed. We present in this paper a notion of finitary deduction systems that aims at relating both approaches. We prove that for such deduction systems, deciding equivalence properties for on-line attackers can be reduced to deciding reachability properties in the same setting.Comment: 30 pages. Work begun while in the CASSIS Project, INRIA Nancy Grand Es

Permutation polynomials and systems of permutation polynomials in several variables over finite rings

This paper will present the historical development of theorems regarding permutation polynomials in several variables over finite fields. Single variable permutation polynomials will be discussed since they are so important to the discussions which will follow. Theorems involving permutation polynomials and systems of permutation polynomials will also be considered. It will be shown that many of the interesting results obtained for finite fields can be generalized to finite rings

Mouse genetics: Catalogue and scissors

Phenotypic analysis of gene-specific knockout (KO) mice has revolutionized our understanding of in vivo gene functions. As the use of mouse embryonic stem (ES) cells is inevitable for conventional gene targeting, the generation of knockout mice remains a very time-consuming and expensive process. To accelerate the large-scale production and phenotype analyses of KO mice, international efforts have organized global consortia such as the International Knockout Mouse Consortium (IKMC) and International Mouse Phenotype Consortium (IMPC), and they are persistently expanding the KO mouse catalogue that is publicly available for the researches studying specific genes of interests in vivo. However, new technologies, adopting zinc-finger nucleases (ZFNs) or Transcription Activator-like Effector (TALE) Nucleases (TALENs) to edit the mouse genome, are now emerging as valuable and effective shortcuts alternative for the conventional gene targeting using ES cells. Here, we introduce the recent achievement of IKMC, and evaluate the significance of ZFN/TALEN technology in mouse genetics. [BMB Reports 2012; 45(12): 686-692]

A large-scale in vivo analysis reveals that TALENs are significantly more mutagenic than ZFNs generated using context-dependent assembly

Zinc-finger nucleases (ZFNs) and TAL effector nucleases (TALENs) have been shown to induce targeted mutations, but they have not been extensively tested in any animal model. Here, we describe a large-scale comparison of ZFN and TALEN mutagenicity in zebrafish. Using deep sequencing, we found that TALENs are significantly more likely to be mutagenic and induce an average of 10-fold more mutations than ZFNs. We observed a strong correlation between somatic and germ-line mutagenicity, and identified germ line mutations using ZFNs whose somatic mutations rates are well below the commonly used threshold of 1%. Guidelines that have previously been proposed to predict optimal ZFN and TALEN target sites did not predict mutagenicity in vivo. However, we observed a significant negative correlation between TALEN mutagenicity and the number of CpG repeats in TALEN target sites, suggesting that target site methylation may explain the poor mutagenicity of some TALENs in vivo. The higher mutation rates and ability to target essentially any sequence make TALENs the superior technology for targeted mutagenesis in zebrafish, and likely other animal models

CARIBE: Cascaded IBE for Maximum Flexibility and User-side Control

Mass surveillance and a lack of end-user encryption, coupled with a growing demand for key escrow under legal oversight and certificate authority security concerns, raise the question of the appropriateness of continued general dependency on PKI. Under this context, we examine Identity-Based Encryption (IBE) as an alternative to public-key encryption. Cascade encryption, or sequential multiple encryption, is the concept of layering encryption such that the ciphertext from one encryption step is the plaintext of the next. We describe CARIBE, a cascaded IBE scheme, for which we also provide a cascaded CCA security experiment, IND-ID-C.CCA, and prove its security in the computational model. CARIBE combines the ease-of-use of IBE with key escrow, limited to the case when the entire set of participating PKGs collaborate. Furthermore, we describe a particular CARIBE scheme, CARIBE-S, where the receiver is a self-PKG – one of the several PKGs included in the cascade. CARIBE-S inherits IND-ID-C.CCA from CARIBE, and avoids key escrow entirely. In essence, CARIBE-S offers the maximum flexibility of the IBE paradigm and gives the users complete control without the key escrow problem