This paper concerns sensor network key distribution schemes (KDS) based on symmetric-key techniques. We analyze the problem of active attacks against such schemes. By active attacks we mean those attacks, where the adversary can maliciously disturb the communication between the sensors. We observe that the active adversary that captured even a small number of sensors, can anyway get a full cont...

In 2012, Piao et al. proposed a polynomial-based key management for secure intra-group and inter-group communication. In this notes, we point out that there are some security weaknesses of Piao et al.’s intra-group key distribution scheme. One main problem is that their scheme cannot prevent a group member to obtain other members’ secret keys shared with the controller. In addition, their schem...

The paper investigates which of Shannon’s measures (entropy, conditional entropy, mutual information) is the right one for the task of quantifying information flow in a programming language. We examine earlier relevant contributions from Denning, McLean and Gray and we propose and motivate a specific quantitative definition of information flow. We prove results relating equivalence relations, i...

This paper illustrates the use of ciphertext-policy attributebased encryption (CP-ABE), a recently proposed primitive, in the setting of group key management. Specifically, we use the CP-ABE scheme of Bethencourt, Sahai and Waters to implement flat table group key management. Unlike past implementations of flat table, our proposal is resistant to collusion attacks. We also provide efficient mec...

We introduce the νSPI-calculus that strengthens the notion of “perfect symmetric cryptography” of the spi-calculus by taking time into account. This involves defining an operational semantics, defining a control flow analysis (CFA) in the form of a flow logic, and proving semantic correctness. Our first result is that secrecy in the sense of DolevYao can be expressed in terms of the CFA. Our se...

In 2014, Yeh et al. proposed a robust smart card secured authentication scheme on SIP using elliptic curve cryptography to conquer many forms of attacks in previous protocols. Yeh et al. claimed that their proposed protocol is more efficient than Diffie-Hellman’s concept authentication protocols for SIP and performs secured mutual authentication, which can be implemented on different real netwo...

We propose a non-cryptographic algorithm for secure and reliable distributed storage without placing much trust on the file servers. In particular, the algorithm makes novel use of binary error control codes to protect store, and repair files. It features low computation overhead while achieving a joint defense in reliability, confidentiality, and integrity, which are collectively quantified us...

The problem of establishing a mutually held secret cryptographic key using a radio channel is addressed. The performance of a particular key distribution system is evaluated for a practical mobile radio communications system. The performance measure taken is probabilistic, and different from the Shannonmeasure of perfect secrecy. In particular, it is shown that by using a channel decoder, the p...

We present a framework for modeling adversaries in security protocol analysis, ranging from a Dolev-Yao style adversary to more powerful adversaries who can reveal different parts of principals’ states during protocol execution. Our adversary models unify and generalize many existing security notions from both the computational and symbolic settings. We extend an existing symbolic protocol-veri...

This paper presents an anonymous authentication scheme for roaming service in global mobility networks, in which the foreign agent cannot obtain the identity information of the mobile user who is sending the roaming request. In addition, the home agent does not have to maintain any verification table for authenticating the mobile user. We give formal analyses to show that our proposed scheme sa...