Adrenocortical oncocytic neoplasm presenting with Cushing's syndrome: a case report

<p>Abstract</p> <p>Introduction</p> <p>Oncocytic neoplasms occur in several organs and are most commonly found in the thyroid, kidneys and salivary glands. Oncocytic neoplasms of the adrenal cortex are extremely rare and are usually non-functioning.</p> <p>Case presentation</p> <p>We report the case of an adrenocortical oncocytic neoplasm with uncertain malignant potential in a 31-year-old man with Cushing's syndrome. The patient had been operated on following diagnosis of a 7 cm adrenal mass. Following surgery, the Cushing's syndrome resolved. The patient is still alive with no metastases one year after the surgery.</p> <p>Conclusion</p> <p>Adrenocortical oncocytic neoplasms must be considered in the differential diagnosis of both functioning and non-functioning adrenal masses.</p

On forward secrecy in one-round key exchange

Most one-round key exchange protocols provide only weak forward secrecy at best. Furthermore, one-round protocols with strong forward secrecy often break badly when faced with an adversary who can obtain ephemeral keys. We provide a characterisation of how strong forward secrecy can be achieved in one-round key exchange. Moreover, we show that protocols exist which provide strong forward secrecy and remain secure with weak forward secrecy even when the adversary is allowed to obtain ephemeral keys. We provide a compiler to achieve this for any existing secure protocol with weak forward secrecy

Length-weight relationships of freshwater fishes in the Biga Peninsula (northwestern Anatolia, Turkey)

WOS: 000308878000037This study provides lengthweight relationship information for 13 fish taxa from Biga Peninsula, in northwestern Anatolia, Turkey, collected from 16 streams between 2000 and 2001.Ege University Scientific Research Projects CommissionEge University [2000/SUF/006]We thank the Ege University Scientific Research Projects Commission for their support with the project (Project No: 2000/SUF/006) and Prof. Dr. Suleyman Balik, project leader. We are grateful to Ahmet Sandikci and Mustafa Kazancioglu, who helped with measurements of the fishes

Stronger difficulty notions for client puzzles and denial-of-service resistant protocols

Client puzzles are meant to act as a defense against denial of service (DoS) attacks by requiring a client to solve some moderately hard problem before being granted access to a resource. However, recent client puzzle difficulty definitions (Stebila and Ustaoglu, 2009; Chen et al., 2009) do not ensure that solving n puzzles is n times harder than solving one puzzle. Motivated by examples of puzzles where this is the case, we present stronger definitions of difficulty for client puzzles that are meaningful in the context of adversaries with more computational power than required to solve a single puzzle. A protocol using strong client puzzles may still not be secure against DoS attacks if the puzzles are not used in a secure manner. We describe a security model for analyzing the DoS resistance of any protocol in the context of client puzzles and give a generic technique for combining any protocol with a strong client puzzle to obtain a DoS-resistant protocol

Towards denial-of-service-resilient key agreement protocols

Denial of services is an important practical consideration for key agreement protocols in any hostile environment such as the Internet. There are well-known models that consider the security of key agreement protocols, but denial of service resistance is not considered as part of these models. Many protocols have been argued to be denial of service-resistant, but in most cases the arguments are informal and it is not immediately clear how two denial of service resistance definitions relate to each other. In this work we propose a formal definition of denial of service resistance, a model for secure authenticated key agreement, and show how security and denial of service resistance can be considered in a common framework. Our model accommodates a variety of techniques for achieving denial of service resistance, and we describe one such technique by exhibiting a denial of service-resistant secure authenticated key agreement protocol

Heartburn Sensation in Non-Erosive Reflux Disease: Pattern of Superficial Sensory Nerves Expressing TRPV1 and Epithelial Cells Expressing ASIC3 Receptors.

The underlying causes of heartburn, characteristic symptom of gastro-esophageal reflux disease(GERD), remain incompletely understood. Superficial afferent innervation of the esophageal mucosa in nonerosive reflux disease(NERD) may drive nociceptive reflux perception, but its acid-sensing role has not yet been established. Transient receptor potential vanilloid subfamily member-1(TRPV1), transient receptor potential Melastatin 8(TRPM8), and acid sensing ion channel 3(ASIC3) are regulators of sensory nerve activity and could be important reflux-sensing receptors within the esophageal mucosa. We characterised TRPV1, TRPM8, and ASIC3 expression in esophageal mucosa of GERD patients. We studied 10 NERD, 10 erosive reflux disease(ERD), 7 functional heartburn(FH), and 8 Barrett's esophagus(BE) patients. Biopsies obtained from the distal esophageal mucosa were co-stained with TRPV1, TRPM8, or ASIC3, and CGRP, CD45, or E-cadherin. RNA expression of TRPV1, TRPM8, and ASIC3 was assessed using qPCR. NERD patients had significantly increased expression of TRPV1 on superficial sensory nerves compared to ERD (p=0.028) or BE (p=0.017). Deep intrapapillary nerve endings did not express TRPV1 in all phenotypes studied. ASIC3 was exclusively expressed on epithelial cells most significantly in NERD and ERD patients (p=<0.0001). TRPM8 was expressed on submucosal CD45+ leukocytes. Superficial localisation of TRPV1-immunoreactive nerves in NERD, and increased ASIC3 co-expression on epithelial cells in NERD and ERD suggests a mechanism for heartburn sensation. Esophageal epithelial cells may play a sensory role in acid reflux perception and act interdependently with TRPV1-expressing mucosal nerves to augment hypersensitivity in NERD patients, raising the enticing possibility of topical antagonists for these ion channels as a therapeutic option

Beyond eCK: Perfect Forward Secrecy under Actor Compromise and Ephemeral-Key Reveal ⋆

Abstract. We show that it is possible to achieve perfect forward secrecy in two-message or one-round key exchange (KE) protocols that satisfy even stronger security properties than provided by the extended Canetti-Krawczyk (eCK) security model. In particular, we consider perfect forward secrecy in the presence of adversaries that can reveal ephemeral secret keys and the long-term secret keys of the actor of a session (similar to Key Compromise Impersonation). We propose two new game-based security models for KE protocols. First, we formalize a slightly stronger variant of the eCK security model that we call eCK w. Second, we integrate perfect forward secrecy into eCK w, which gives rise to the even stronger eCK-PFS model. We propose a securitystrengthening transformation (i. e., a compiler) between our new models. Given a two-message Diffie-Hellman type protocol secure in eCK w, our transformation yields a two-message protocol that is secure in eCK-PFS. As an example, we show how our transformation can be applied to the NAXOS protocol

A New Security Model for Authenticated Key Agreement

International audienceThe Canetti–Krawczyk (CK) and extended Canetti–Krawczyk (eCK) security mo-dels, are widely used to provide security arguments for key agreement protocols. We discuss security shades in the (e)CK models, and some practical attacks unconsi-dered in (e)CK–security arguments. We propose a strong security model which en-compasses the eCK one. We also propose a new protocol, called Strengthened MQV (SMQV), which in addition to provide the same efficiency as the (H)MQV protocols, is particularly suited for distributed implementations wherein a tamper–proof device is used to store long–lived keys, while session keys are used on an untrusted host machine. The SMQV protocol meets our security definition under the Gap Diffie– Hellman assumption and the Random Oracle model