Learn More
INTRODUCTION Recent investigations have revealed that control of hyperglycaemia with insulin improves outcomes. The cornerstone of hyperglycaemia in critically ill patients is insulin resistance and it remains refractory to intensive insulin protocols. We designed this study to evaluate the efficacy and safety of a new intensive insulin therapy (IIT)(More)
We investigate the problem of algebraic manipulation detection (AMD) over a communication channel that partially leaks information to an adversary. We assume the adversary is computationally unbounded and there is no shared key or correlated randomness between the sender and the receiver. We introduce leakage-resilient (LR)-AMD codes to detect algebraic(More)
This paper describes the attack on SOSEMANUK, one of the stream ciphers proposed at eSTREAM (the ECRYPT Stream Cipher Project) in 2005. The cipher features the variable secret key length from 128-bit up to 256-bit and 128-bit initial vector. The basic operation of the cipher is performed in a unit of 32 bits i.e. " word " , and each word generates(More)
We study the problem of unconditionally secure Secret Key Establishment (SKE) when Alice and Bob are connected by two noisy channels that are eavesdropped by Eve. We consider the case that Alice and Bob do not have any sources of initial randomness at their disposal. We start by discussing special cases of interest where SKE is impossible and then provide a(More)
We consider the problem of secret key establishment (SKE) in the presence of a passive adversary, Eve, when Alice and Bob are connected by a pair of independent discrete memoryless broadcast channels in opposite directions. We refer to this setup as 2DMBC. We define the secret-key capacity in this setup and provide a lower bound on the capacity by proposing(More)
INTRODUCTION To analyze the push-out bond strength of Angelus WMTA (Angelus Dental Products), a nano-modification of WMTA (Kamal Asgar Research Center) and Bioaggregate (Innovative Bioceramix). METHODS Sixty 2-mm-thick root sections were prepared from 60 single-rooted human teeth. The dentin disks were randomly divided into three groups (n = 20) and(More)
Common Randomness Generation (CRG) and Secret Key Establishment (SKE) are fundamental primitives that are used in information-theoretic coding and cryptography. We study these two problems over the two-way channel model of communication, introduced by Shannon. In this model, the common randomness (CK) capacity is defined as the maximum number of random bits(More)
Distance (upper)-bounding (DUB) allows a verifier to know whether a proving party is located within a certain distance bound. DUB protocols have many applications in secure authentication and location based services. We consider the dual problem of distance lower bounding (DLB), where the prover proves it is outside a distance bound to the verifier. We(More)