CT colonography’s role in the COVID-19 pandemic: a safe(r), socially distanced total colon examination

© 2020, Springer Science+Business Media, LLC, part of Springer Nature. Purpose: To describe the favorable procedural profile of CT colonography (CTC) during the COVID-19 pandemic. Conclusion: Postponement of cancer screening due to COVID-19 has resulted in a backlog of individuals needing to undergo structural examination of the colon. The experience during the initial COVID-19 surge with urgent evaluation of the colon for transplant patients prior to transplant suggests that CTC can be done in a lower risk manner as compared to other structural examinations. The procedural profile of CTC is advantageous during this pandemic as maintaining social distancing and preserving healthcare supplies including PPE are of paramount importance. CTC is an important option to utilize in the screening armamentarium to allow effective screening of average risk asymptomatic individuals in the COVID-19 era

Non-malleable codes for space-bounded tampering

Non-malleable codes—introduced by Dziembowski, Pietrzak and Wichs at ICS 2010—are key-less coding schemes in which mauling attempts to an encoding of a given message, w.r.t. some class of tampering adversaries, result in a decoded value that is either identical or unrelated to the original message. Such codes are very useful for protecting arbitrary cryptographic primitives against tampering attacks against the memory. Clearly, non-malleability is hopeless if the class of tampering adversaries includes the decoding and encoding algorithm. To circumvent this obstacle, the majority of past research focused on designing non-malleable codes for various tampering classes, albeit assuming that the adversary is unable to decode. Nonetheless, in many concrete settings, this assumption is not realistic

CT colonography polyp matching: differences between experienced readers

The purpose of this study was to investigate if experienced readers differ when matching polyps shown by both CT colonography (CTC) and optical colonoscopy (OC) and to explore the reasons for discrepancy. Twenty-eight CTC cases with corresponding OC were presented to eight experienced CTC readers. Cases represented a broad spectrum of findings, not completely fulfilling typical matching criteria. In 21 cases there was a single polyp on CTC and OC; in seven there were multiple polyps. Agreement between readers for matching was analyzed. For the 21 single-polyp cases, the number of correct matches per reader varied from 13 to 19. Almost complete agreement between readers was observed in 15 cases (71%), but substantial discrepancy was found for the remaining six (29%) probably due to large perceived differences in polyp size between CT and OC. Readers were able to match between 27 (71%) and 35 (92%) of the 38 CTC detected polyps in the seven cases with multiple polyps. Experienced CTC readers agree to a considerable extent when matching polyps between CTC and subsequent OC, but non-negligible disagreement exist

CT colonography reporting and data system: A consensus proposal

We have proposed a practical reporting scheme that includes recommendations for the follow-up of colonic polyps that are based on currently available published assessments of the clinical importance and expected growth potential of these lesions. © RSNA, 2005

CT colonography with minimal bowel preparation: evaluation of tagging quality, patient acceptance and diagnostic accuracy in two iodine-based preparation schemes

PURPOSE: The aim of this study was to compare a 1-day with a 2-day iodine bowel preparation for CT colonography in a positive faecal occult blood test (FOBT) screening population. MATERIALS AND METHODS: One hundred consecutive patients underwent CT colonography and colonoscopy with segmental unblinding. The first 50 patients (group 1) ingested 7 50 ml iodinated contrast starting 2 days before CT colonography. The latter 50 patients (group 2) ingested 4 50 ml iodinated contrast starting 1 day before CT colonography. Per colonic segment measurements of residual stool attenuation and homogeneity were performed, and a subjective evaluation of tagging quality (grade 1-5) was done. Independently, two reviewers performed polyp and carcinoma detection. RESULTS: The tagging density was 638 and 618 HU (p = 0.458) and homogeneity 91 and 86 HU for groups 1 and 2, respectively (p = 0.145). The tagging quality was graded 5 (excellent) in 90% of all segments in group 1 and 91% in group 2 (p = 0.749). Mean per-polyp sensitivity for lesions >or=10 mm was 86% in group 1 and 97% in group 2 (p = 0.355). Patient burden from diarrhoea significantly decreased for patients in group 2. CONCLUSIONS: One-day preparation with meglumine ioxithalamate results in an improved patient acceptability compared with 2-day preparation and has a comparable, excellent image quality and good diagnostic performanc

Four-Round Concurrent Non-Malleable Commitments from One-Way Functions

How many rounds and which assumptions are required for concurrent non-malleable commitments? The above question has puzzled researchers for several years. Pass in [TCC 2013] showed a lower bound of 3 rounds for the case of black-box reductions to falsifiable hardness assumptions with respect to polynomial-time adversaries. On the other side, Goyal [STOC 2011], Lin and Pass [STOC 2011] and Goyal et al. [FOCS 2012] showed that one-way functions (OWFs) are sufficient with a constant number of rounds. More recently Ciampi et al. [CRYPTO 2016] showed a 3-round construction based on subexponentially strong one-way permutations. In this work we show as main result the first 4-round concurrent non-malleable commitment scheme assuming the existence of any one-way function. Our approach builds on a new security notion for argument systems against man-in-the-middle attacks: Simulation-Witness-Independence. We show how to construct a 4-round one-many simulation-witnesses-independent argument system from one-way functions. We then combine this new tool in parallel with a weak form of non-malleable commitments constructed by Goyal et al. in [FOCS 2014] obtaining the main result of our work

Non-Malleable Codes with Split-State Refresh

Non-Malleable Codes for the split state model allow to encode a mes- sage into two parts such that arbitrary independent tampering on the parts either destroys completely the content or maintains the message untouched. If the code is also leakage resilient it allows limited independent leakage from the two parts. We propose a model where the two parts can be refreshed independently. We give an abstract framework for building codes for this model, instantiate the construc- tion under the external Diffie-Hellman assumption and give applications of such split-state refreshing. An advantage of our new model is that it allows arbitrarily many tamper attacks and arbitrarily large leakage over the life-time of the systems as long as occasionally each part of the code is refreshed. Our model also tolerates that the refreshing occasionally is leaky or tampered with

Upper and Lower Bounds for Continuous Non-Malleable Codes

Recently, Faust et al. (TCC\u2714) introduced the notion of continuous non-malleable codes (CNMC), which provides stronger security guarantees than standard non-malleable codes, by allowing an adversary to tamper with the codeword in continuous way instead of one-time tampering. They also showed that CNMC with information theoretic security cannot be constructed in 2-split-state tampering model, and presented a construction of the same in CRS (common reference string) model using collision-resistant hash functions and non-interactive zero-knowledge proofs. In this work, we ask if it is possible to construct CNMC from weaker assumptions. We answer this question by presenting lower as well as upper bounds. Specifically, we show that it is impossible to construct 2-split-state CNMC, with no CRS, for one-bit messages from any falsifiable assumption, thus establishing the lower bound. We additionally provide an upper bound by constructing 2-split-state CNMC for one-bit messages, assuming only the existence of a family of injective one way functions. We also present a construction of 4-split-state CNMC for multi-bit messages in CRS model from the same assumptions. Additionally, we present definitions of the following new primitives: (1) One-to-one commitments, and (2) Continuous Non-Malleable Randomness Encoders, which may be of independent interest

Albendazole versus Praziquantel in the Treatment of Neurocysticercosis: A Meta-analysis of Comparative Trials

Neurocysticercosis is a parasitic disease caused by the pork tapeworm, Taenia solium, when the larval form of the parasite lodges in the central nervous system. This disease is most commonly found among members of agricultural societies with poor sanitary conditions and economies based on breeding livestock (especially pigs) with low hygiene standards. It is a disease with long history in humans, and the usual therapeutic intervention was surgery until the development of antiparasitic cysticidal agents, the most common being praziquantel and albendazole. T. solium infection can take many different forms in humans, but we concentrated on parenchymal neurocysticercosis with viable cysts. A consensus statement by a panel of experts on the subject supports the use of antiparasitic treatment, but does not indicate either albendazole or praziquantel as the drug of choice for this type of neurocysticercosis, because data from single relevant clinical trials are not conclusive. We conducted a meta-analysis to further evaluate the comparative effectiveness and safety of albendazole and praziquantel for this particular type of neurocysticercosis. The outcomes of our meta-analysis suggest that albendazole is more effective than praziquantel in controlling seizures in affected patients and in leading to the total disappearance of cysts and subsequently cure of patients with neurocysticercosis