On Probabilistic Applicative Bisimulation and Call-by-Value λ\lambda-Calculi (Long Version)

Probabilistic applicative bisimulation is a recently introduced coinductive methodology for program equivalence in a probabilistic, higher-order, setting. In this paper, the technique is applied to a typed, call-by-value, lambda-calculus. Surprisingly, the obtained relation coincides with context equivalence, contrary to what happens when call-by-name evaluation is considered. Even more surprisingly, full-abstraction only holds in a symmetric setting.Comment: 30 page

Spatial and spatio-temporal patterns in a cell-haptotaxis model

We investigate a cell-haptotaxis model for the generation of spatial and spatio-temporal patterns in one dimension. We analyse the steady state problem for specific boundary conditions and show the existence of spatially hetero-geneous steady states. A linear analysis shows that stability is lost through a Hopf bifurcation. We carry out a nonlinear multi-time scale perturbation procedure to study the evolution of the resulting spatio-temporal patterns. We also analyse the model in a parameter domain wherein it exhibits a singular dispersion relation

Incidence of human brucellosis in the Kilimanjaro Region of Tanzania in the periods 2007-2008 and 2012-2014

Background: Brucellosis causes substantial morbidity among humans and their livestock. There are few robust estimates of the incidence of brucellosis in sub-Saharan Africa. Using cases identified through sentinel hospital surveillance and health care utilization data, we estimated the incidence of brucellosis in Moshi Urban and Moshi Rural Districts, Kilimanjaro Region, Tanzania, for the periods 2007–2008 and 2012–2014. Methods: Cases were identified among febrile patients at two sentinel hospitals and were defined as having either a 4-fold increase in Brucella microscopic agglutination test titres between acute and convalescent serum or a blood culture positive for Brucella spp. Findings from a health care utilization survey were used to estimate multipliers to account for cases not seen at sentinel hospitals. Results: Of 585 patients enrolled in the period 2007–2008, 13 (2.2%) had brucellosis. Among 1095 patients enrolled in the period 2012–2014, 32 (2.9%) had brucellosis. We estimated an incidence (range based on sensitivity analysis) of brucellosis of 35 (range 32–93) cases per 100 000 persons annually in the period 2007–2008 and 33 (range 30–89) cases per 100 000 persons annually in the period 2012–2014. Conclusions: We found a moderate incidence of brucellosis in northern Tanzania, suggesting that the disease is endemic and an important human health problem in this area

Efficient noninteractive certification of RSA moduli and beyond

In many applications, it is important to verify that an RSA public key (N; e) speci es a permutation over the entire space ZN, in order to prevent attacks due to adversarially-generated public keys. We design and implement a simple and e cient noninteractive zero-knowledge protocol (in the random oracle model) for this task. Applications concerned about adversarial key generation can just append our proof to the RSA public key without any other modi cations to existing code or cryptographic libraries. Users need only perform a one-time veri cation of the proof to ensure that raising to the power e is a permutation of the integers modulo N. For typical parameter settings, the proof consists of nine integers modulo N; generating the proof and verifying it both require about nine modular exponentiations. We extend our results beyond RSA keys and also provide e cient noninteractive zero- knowledge proofs for other properties of N, which can be used to certify that N is suitable for the Paillier cryptosystem, is a product of two primes, or is a Blum integer. As compared to the recent work of Auerbach and Poettering (PKC 2018), who provide two-message protocols for similar languages, our protocols are more e cient and do not require interaction, which enables a broader class of applications.https://eprint.iacr.org/2018/057First author draf

Risk factors for human acute leptospirosis in northern Tanzania

Introduction: Leptospirosis is a major cause of febrile illness in Africa but little is known about risk factors for human infection. We conducted a cross-sectional study to investigate risk factors for acute leptospirosis and Leptospira seropositivity among patients with fever attending referral hospitals in northern Tanzania. Methods: We enrolled patients with fever from two referral hospitals in Moshi, Tanzania, 2012–2014, and performed Leptospira microscopic agglutination testing on acute and convalescent serum. Cases of acute leptospirosis were participants with a four-fold rise in antibody titers, or a single reciprocal titer ≥800. Seropositive participants required a single titer ≥100, and controls had titers <100 in both acute and convalescent samples. We administered a questionnaire to assess risk behaviors over the preceding 30 days. We created cumulative scales of exposure to livestock urine, rodents, and surface water, and calculated odds ratios (OR) for individual behaviors and for cumulative exposure variables. Results: We identified 24 acute cases, 252 seropositive participants, and 592 controls. Rice farming (OR 14.6), cleaning cattle waste (OR 4.3), feeding cattle (OR 3.9), farm work (OR 3.3), and an increasing cattle urine exposure score (OR 1.2 per point) were associated with acute leptospirosis. Conclusions: In our population, exposure to cattle and rice farming were risk factors for acute leptospirosis. Although further data is needed, these results suggest that cattle may be an important source of human leptospirosis. Further investigation is needed to explore the potential for control of livestock Leptospira infection to reduce human disease

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

Predictable arguments of knowledge

We initiate a formal investigation on the power of predictability for argument of knowledge systems for NP. Specifically, we consider private-coin argument systems where the answer of the prover can be predicted, given the private randomness of the verifier; we call such protocols Predictable Arguments of Knowledge (PAoK). Our study encompasses a full characterization of PAoK, showing that such arguments can be made extremely laconic, with the prover sending a single bit, and assumed to have only one round (i.e., two messages) of communication without loss of generality. We additionally explore PAoK satisfying additional properties (including zero-knowledge and the possibility of re-using the same challenge across multiple executions with the prover), present several constructions of PAoK relying on different cryptographic tools, and discuss applications to cryptography

DRE-ip : A Verifiable E-Voting Scheme without Tallying Authorities

Nearly all verifiable e-voting schemes require trustworthy authorities to perform the tallying operations. An exception is the DRE-i system which removes this requirement by pre-computing all encrypted ballots before the election using random factors that will later cancel out and allow the public to verify the tally after the election. While the removal of tallying authorities significantly simplifies election management, the pre-computation of ballots necessitates secure ballot storage, as leakage of precomputed ballots endangers voter privacy. In this paper, we address this problem and propose DRE-ip (DRE-i with enhanced privacy). Adopting a different design strategy, DRE-ip is able to encrypt ballots in real time in such a way that the election tally can be publicly verified without decrypting the cast ballots. As a result, DRE-ip achieves end-to-end verifiability without tallying authorities, similar to DRE-i, but with a significantly stronger guarantee on voter privacy. In the event that the voting machine is fully compromised, the assurance on tallying integrity remains intact and the information leakage is limited to the minimum: only the partial tally at the time of compromise is leaked

Diagnostic criteria for cancer cachexia: Reduced food intake and inflammation predict weight loss and survival in an international, multi-cohort analysis

Abstract Background Cancer‐associated weight loss (WL) associates with increased mortality. International consensus suggests that WL is driven by a variable combination of reduced food intake and/or altered metabolism, the latter often represented by the inflammatory biomarker C‐reactive protein (CRP). We aggregated data from Canadian and European research studies to evaluate the associations of reduced food intake and CRP with cancer‐associated WL (primary endpoint) and overall survival (OS, secondary endpoint). Methods The data set included a total of 12,253 patients at risk for cancer‐associated WL. Patient‐reported WL history (% in 6 months) and food intake (normal, moderately, or severely reduced) were measured in all patients; CRP (mg/L) and OS were measured in N = 4960 and N = 9952 patients, respectively. All measures were from a baseline assessment. Clinical variables potentially associated with WL and overall survival (OS) including age, sex, cancer diagnosis, disease stage, and performance status were evaluated using multinomial logistic regression MLR and Cox proportional hazards models, respectively. Results Patients had a mean weight change of −7.3% (±7.1), which was categorized as: ±2.4% (stable weight; 30.4%), 2.5–5.9% (19.7%), 6.0–10.0% (23.2%), 11.0–14.9% (12.0%), ≥15.0% (14.6%). Normal food intake, moderately, and severely reduced food intake occurred in 37.9%, 42.8%, and 19.4%, respectively. In MLR, severe WL (≥15%) (vs. stable weight) was more likely (P  100 mg/L: OR 2.30 (95% CI 1.62–3.26)]. Diagnosis, stage, and performance status, but not age or sex, were significantly associated with WL. Median OS was 9.9 months (95% CI 9.5–10.3), with median follow‐up of 39.7 months (95% CI 38.8–40.6). Moderately and severely reduced food intake and CRP independently predicted OS (P < 0.0001). Conclusions Modelling WL as the dependent variable is an approach that can help to identify clinical features and biomarkers associated with WL. Here, we identify criterion values for food intake impairment and CRP that may improve the diagnosis and classification of cancer‐associated cachexia

Cognitive Information Processing

Contains reports on seven research projects.National Science Foundation (Grant SED76-81985)Graphic Arts Research Foundation (Grant)Providence Gravure, Inc. (Grant)Associated Press (Grant)National Institutes of Health (Grant 1 RO1 GM22547-01)National Institutes of Health (Grant 1 PO1 AG00354-01)Health Sciences Fund (Grant 76-11