477 research outputs found

    Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic

    Get PDF
    The problem of computing an explicit isogeny between two given elliptic curves over F_q, originally motivated by point counting, has recently awaken new interest in the cryptology community thanks to the works of Teske and Rostovstev & Stolbunov. While the large characteristic case is well understood, only suboptimal algorithms are known in small characteristic; they are due to Couveignes, Lercier, Lercier & Joux and Lercier & Sirvent. In this paper we discuss the differences between them and run some comparative experiments. We also present the first complete implementation of Couveignes' second algorithm and present improvements that make it the algorithm having the best asymptotic complexity in the degree of the isogeny.Comment: 21 pages, 6 figures, 1 table. Submitted to J. Number Theor

    L-selectin mediated leukocyte tethering in shear flow is controlled by multiple contacts and cytoskeletal anchorage facilitating fast rebinding events

    Full text link
    L-selectin mediated tethers result in leukocyte rolling only above a threshold in shear. Here we present biophysical modeling based on recently published data from flow chamber experiments (Dwir et al., J. Cell Biol. 163: 649-659, 2003) which supports the interpretation that L-selectin mediated tethers below the shear threshold correspond to single L-selectin carbohydrate bonds dissociating on the time scale of milliseconds, whereas L-selectin mediated tethers above the shear threshold are stabilized by multiple bonds and fast rebinding of broken bonds, resulting in tether lifetimes on the timescale of 10110^{-1} seconds. Our calculations for cluster dissociation suggest that the single molecule rebinding rate is of the order of 10410^4 Hz. A similar estimate results if increased tether dissociation for tail-truncated L-selectin mutants above the shear threshold is modeled as diffusive escape of single receptors from the rebinding region due to increased mobility. Using computer simulations, we show that our model yields first order dissociation kinetics and exponential dependence of tether dissociation rates on shear stress. Our results suggest that multiple contacts, cytoskeletal anchorage of L-selectin and local rebinding of ligand play important roles in L-selectin tether stabilization and progression of tethers into persistent rolling on endothelial surfaces.Comment: 9 pages, Revtex, 4 Postscript figures include

    Effects of receptor clustering on ligand dissociation: Theory and simulations

    Get PDF
    Receptor-ligand binding is a critical first step in signal transduction and the duration of the interaction can impact signal generation. In mammalian cells, clustering of receptors may be facilitated by heterogeneous zones of lipids, known as lipid rafts. In vitro experiments show that disruption of rafts significantly alters the dissociation of fibroblast growth factor-2 (FGF-2) from heparan sulfate proteoglycans, co-receptors for FGF-2. In this paper, we develop a continuum stochastic formalism in order to (i) study how rebinding affects the dissociation of ligands from a planar substrate, and (ii) address the question of how receptor clustering influences ligand rebinding. We find that clusters reduce the effective dissociation rate dramatically when the clusters are dense and the overall surface density of receptors is low. The effect is much less pronounced in the case of high receptor density and shows non-monotonic behavior with time. These predictions are verified via lattice Monte Carlo simulations. Comparison with experimental results suggests that the theory does not capture the complete biological system. We speculate that additional co-operative mechanisms might be present in order to increase ligand retention, and present one possible ``internal diffusion'' model.Comment: Expanded text and added figures, revised version to appear in Biophys.

    Verifiable Elections That Scale for Free

    Get PDF
    In order to guarantee a fair and transparent voting process, electronic voting schemes must be verifiable. Most of the time, however, it is important that elections also be anonymous. The notion of a verifiable shuffle describes how to satisfy both properties at the same time: ballots are submitted to a public bulletin board in encrypted form, verifiably shuffled by several mix servers (thus guaranteeing anonymity), and then verifiably decrypted by an appropriate threshold decryption mechanism. To guarantee transparency, the intermediate shuffles and decryption results, together with proofs of their correctness, are posted on the bulletin board throughout this process. In this paper, we present a verifiable shuffle and threshold decryption scheme in which, for security parameter k, L voters, M mix servers, and N decryption servers, the proof that the end tally corresponds to the original encrypted ballots is only O(k(L + M + N)) bits long. Previous verifiable shuffle constructions had proofs of size O(kLM + kLN), which, for elections with thousands of voters, mix servers, and decryption servers, meant that verifying an election on an ordinary computer in a reasonable amount of time was out of the question. The linchpin of each construction is a controlled-malleable proof (cm-NIZK), which allows each server, in turn, to take a current set of ciphertexts and a proof that the computation done by other servers has proceeded correctly so far. After shuffling or partially decrypting these ciphertexts, the server can also update the proof of correctness, obtaining as a result a cumulative proof that the computation is correct so far. In order to verify the end result, it is therefore sufficient to verify just the proof produced by the last server

    Financial incentives to promote active travel: an evidence review and economic framework

    Get PDF
    ContextFinancial incentives, including taxes and subsidies, can be used to encourage behavior change. They are common in transport policy for tackling externalities associated with use of motor vehicles, and in public health for influencing alcohol consumption and smoking behaviors. Financial incentives also offer policymakers a compromise between “nudging,” which may be insufficient for changing habitual behavior, and regulations that restrict individual choice.Evidence acquisitionThe literature review identified studies published between January 1997 and January 2012 of financial incentives relating to any mode of travel in which the impact on active travel, physical activity, or obesity levels was reported. It encompassed macroenvironmental schemes, such as gasoline taxes, and microenvironmental schemes, such as employer-subsidized bicycles. Five relevant reviews and 20 primary studies (of which nine were not included in the reviews) were identified.Evidence synthesisThe results show that more-robust evidence is required if policymakers are to maximize the health impact of fiscal policy relating to transport schemes of this kind.ConclusionsDrawing on a literature review and insights from the SLOTH (sleep, leisure, occupation, transportation, and home-based activities) time-budget model, this paper argues that financial incentives may have a larger role in promoting walking and cycling than is acknowledged generally

    Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions

    Get PDF
    This paper presents efficient structure-preserving signature schemes based on assumptions as simple as Decision-Linear. We first give two general frameworks for constructing fully secure signature schemes from weaker building blocks such as variations of one-time signatures and random-message secure signatures. They can be seen as refinements of the Even-Goldreich-Micali framework, and preserve many desirable properties of the underlying schemes such as constant signature size and structure preservation. We then instantiate them based on simple (i.e., not q-type) assumptions over symmetric and asymmetric bilinear groups. The resulting schemes are structure-preserving and yield constant-size signatures consisting o

    The Exceptionally Large Chloroplast Genome of the Green Alga Floydiella terrestris Illuminates the Evolutionary History of the Chlorophyceae

    Get PDF
    The Chlorophyceae, an advanced class of chlorophyte green algae, comprises five lineages that form two major clades (Chlamydomonadales + Sphaeropleales and Oedogoniales + Chaetopeltidales + Chaetophorales). The four complete chloroplast DNA (cpDNA) sequences currently available for chlorophyceans uncovered an extraordinarily fluid genome architecture as well as many structural features distinguishing this group from other green algae. We report here the 521,168-bp cpDNA sequence from a member of the Chaetopeltidales (Floydiella terrestris), the sole chlorophycean lineage not previously sampled for chloroplast genome analysis. This genome, which contains 97 conserved genes and 26 introns (19 group I and 7 group II introns), is the largest chloroplast genome ever sequenced. Intergenic regions account for 77.8% of the genome size and are populated by short repeats. Numerous genomic features are shared with the cpDNA of the chaetophoralean Stigeoclonium helveticum, notably the absence of a large inverted repeat and the presence of unique gene clusters and trans-spliced group II introns. Although only one of the Floydiella group I introns encodes a homing endonuclease gene, our finding of five free-standing reading frames having similarity with such genes suggests that chloroplast group I introns endowed with mobility were once more abundant in the Floydiella lineage. Parsimony analysis of structural genomic features and phylogenetic analysis of chloroplast sequence data unambiguously resolved the Oedogoniales as sister to the Chaetopeltidales and Chaetophorales. An evolutionary scenario of the molecular events that shaped the chloroplast genome in the Chlorophyceae is presented

    Role of Portal Vein Embolization in Hepatocellular Carcinoma Management and Its Effect on Recurrence: A Case-control Study

    Get PDF
    Background Liver regeneration that occurs after portal vein embolization (PVE) may have adverse effects on the microscopic tumor foci in the residual liver mass in patients with hepatocellular carcinoma (HCC). Methods Fifty-four HCC patients with inadequate functional residual liver volume were offered PVE during a seven-year period. Among them, 34 (63%) patients underwent curative resection. They were compared with a matched control group (n = 102) who underwent surgery without PVE. Postoperative complications, pattern of recurrence, and survival were compared between groups. Results In the PVE group, a pre-embolization functional residual liver volume of 23% (12-33.5%) improved to 34% (20-54%) (p = 0.005) at the time of surgery. When the two groups were compared, minor (PVE, 24%; control, 29%; p = 0.651) and major (PVE, 18%; control, 15%; p = 0.784) complications were similar. After a follow-up period of 35 months (standard deviation 25 months), extrahepatic recurrences were detected in 10 PVE patients (29%) and 41 control patients (40%) (p = 0.310). Intrahepatic recurrences were seen in 10 (29%) and 47 (46%) cases (p = 0.109) in the PVE and control groups, respectively. In the PVE group, 41% (n = 14) of the recurrences were detected before one year, compared with 42% (n = 43) in the control group (p = 1). Disease-free survival rates at 1, 3, and 5 years were 57, 29, and 26% in the control group and 60, 42, and 42% in the PVE group (log-rank, p = 0.335). On multivariate analysis, PVE was not a factor affecting survival (p = 0.821). Conclusions Portal vein embolization increases the resectability of initially unresectable HCC due to inadequate functional residual liver volume, and it has no deleterious oncological effect after major resection of HCC. © The Author(s) 2012.published_or_final_versionSpringer Open Choice, 28 May 201

    Liver Volumetry Plug and Play: Do It Yourself with ImageJ

    Get PDF
    AB - BACKGROUND: A small remnant liver volume is an important risk factor for posthepatectomy liver failure and can be predicted accurately by computed tomography (CT) volumetry using radiologic image analysis software. Unfortunately, this software is expensive and usually requires support by a radiologist. ImageJ is a freely downloadable image analysis software package developed by the National Institute of Health (NIH) and brings liver volumetry to the surgeon's desktop. We aimed to assess the accuracy of ImageJ for hepatic CT volumetry. METHODS: ImageJ was downloaded from http://www.rsb.info.nih.gov/ij/ . Preoperative CT scans of 15 patients who underwent liver resection for colorectal cancer liver metastases were retrospectively analyzed. Scans were opened in ImageJ; and the liver, all metastases, and the intended parenchymal transection line were manually outlined on each slice. The area of each selected region, metastasis, resection specimen, and remnant liver was multiplied by the slice thickness to calculate volume. Volumes of virtual liver resection specimens measured with ImageJ were compared with specimen weights and calculated volumes obtained during pathology examination after resection. RESULTS: There was an excellent correlation between the volumes calculated with ImageJ and the actual measured weights of the resection specimens (r(2) = 0.98, p < 0.0001). The weight/volume ratio amounted to 0.88 +/- 0.04 (standard error) and was in agreement with our earlier findings using CT-linked radiologic software. CONCLUSION: ImageJ can be used for accurate hepatic CT volumetry on a personal computer. This application brings CT volumetry to the surgeon's desktop at no expense and is particularly useful in cases of tertiary referred patients, who already have a proper CT scan on CD-ROM from the referring institution. Most likely the discrepancy between volume and weight results from exsanguination of the liver after resectio
    corecore