Universal Hashing for Information-Theoretic Security

The information-theoretic approach to security entails harnessing the correlated randomness available in nature to establish security. It uses tools from information theory and coding and yields provable security, even against an adversary with unbounded computational power. However, the feasibility of this approach in practice depends on the development of efficiently implementable schemes. In this paper, we review a special class of practical schemes for information-theoretic security that are based on 2-universal hash families. Specific cases of secret key agreement and wiretap coding are considered, and general themes are identified. The scheme presented for wiretap coding is modular and can be implemented easily by including an extra preprocessing layer over the existing transmission codes.

基于Weil对的成对密钥协商协议

为了实现网络安全，一个重要的方法是网络用户传送加密和可鉴定的消息．此时，用来加密和鉴定的密钥应该由网络中的用户协商得到．提出了3个基于Weil对的成对密钥协商协议．在协议中，所有用户共享一个秘密信息，通过较少的步骤，同时实现密钥协商和用户认证．提出的协议满足如下的安全特性：部分密钥泄漏的安全性、完备的前向安全性、个人密钥泄漏的安全性、无不明的密钥共享和无法控制密钥等．

基于口令认证的密钥交换协议的安全性分析

在串空间理论模型引入了描述DH问题的方法以及分析猜测攻击的攻击者能力,对基于口令认证的密钥交换协议的安全性进行了形式化分析.提出一个对DH-EKE协议的简化,并证明了该协议的安全性:口令的秘密性,认证性,以及会话密钥的秘密性.根据分析给出基于口令认证的密钥交换协议抵抗猜测攻击的基本条件.将分析方法应用到基于口令的三方密钥交换协议上,给出单纯基于口令进行密钥交换协议的安全性需要满足的一个必要条件.

基于零知识集的群组密钥分配方案

零知识集是一种新的具有零知识性质的集合.这种集合的构造使得证明者对于任意元素都可以给出一个证明,证明该元素属于这个集合或者不属于这个集合,同时不泄漏额外的信息.本文基于Pedersen承诺设计一种新的群组密钥分配方案,利用零知识集的性质实现密钥分配.协议不仅保证了组成员可以安全动态的获得组密钥,而且保证了组成员除了获取组密钥,不会得到群组中其它成员的相关信息.与先前工作相比,本文提出的方案提供了更高的安全特性,适合应用于一些较特殊的网络应用,如网络秘密会议.

通用可组合的组密钥交换协议

该文提出了一个通用可组合框架下的组密钥交换理想函数,并在防篡改硬件令牌的基础上,利用部分隔离状态下证据不可区分知识证明,设计了一个组密钥交换协议,安全地实现了这个理想函数.和采用CRS模型的协议相比,降低了把整个信任集中于一处带来的风险.提出的组密钥交换协议经过证明具有AKE安全,并且能够抵抗适应性敌手攻击和恶意参与者攻击.

WLAN Security Processor

A novel wireless local area network (WLAN) security processor is described in this paper. It is designed to offload security encapsulation processing from the host microprocessor in an IEEE 802.11i compliant medium access control layer to a programmable hardware accelerator. The unique design, which comprises dedicated cryptographic instructions and hardware coprocessors, is capable of performing wired equivalent privacy, temporal key integrity protocol, counter mode with cipher block chaining message authentication code protocol, and wireless robust authentication protocol. Existing solutions to wireless security have been implemented on hardware devices and target specific WLAN protocols whereas the programmable security processor proposed in this paper provides support for all WLAN protocols and thus, can offer backwards compatibility as well as future upgrade ability as standards evolve. It provides this additional functionality while still achieving equivalent throughput rates to existing architectures. © 2006 IEEE.

Sécurité polynomiale en cryptographie

Dans ce mémoire, nous proposons des protocoles cryptographiques d'échange de clef, de mise en gage, et de transfert équivoque. Un premier protocole de transfert équivoque, primitive cryptographique universelle pour le calcul multi-parties, s'inspire du protocole d'échange de clef par puzzle de Merkle, et améliore les résultats existants. Puis, nous montrons qu'il est possible de construire ces mêmes primitives cryptographiques sans l'hypothèse des fonctions à sens unique, mais avec le problème 3SUM. Ce problème simple ---dans une liste de n entiers, en trouver trois dont la somme a une certaine valeur--- a une borne inférieure conjecturée de Omega(n^2).

A New Cryptographic Scheme for Securing Dynamic Conferences in Data Networks

Dynamic conferencing refers to a scenario wherein any subset of users in a universe of users form a conference for sharing confidential information among themselves. The key distribution (KD) problem in dynamic conferencing is to compute a shared secret key for such a dynamically formed conference. In literature, the KD schemes for dynamic conferencing either are computationally unscalable or require communication among users, which is undesirable. The extended symmetric polynomial based dynamic conferencing scheme (ESPDCS) is one such KD scheme which has a high computational complexity that is universe size dependent. In this paper we present an enhancement to the ESPDCS scheme to develop a KD scheme called universe-independent SPDCS (UI-SPDCS) such that its complexity is independent of the universe size. However, the UI-SPDCS scheme does not scale with the conference size. We propose a relatively scalable KD scheme termed as DH-SPDCS that uses the UI-SPDCS scheme and the tree-based group Diffie- Hellman (TGDH) key exchange protocol. The proposed DH-SPDCS scheme provides a configurable trade-off between computation and communication complexity of the scheme.

The Performance of Elliptic Curve Based Group Diffie-Hellman Protocols for Secure Group Communication over Ad Hoc Networks

The security of the two party Diffie-Hellman key exchange protocol is currently based on the discrete logarithm problem (DLP). However, it can also be built upon the elliptic curve discrete logarithm problem (ECDLP). Most proposed secure group communication schemes employ the DLP-based Diffie-Hellman protocol. This paper proposes the ECDLP-based Diffie-Hellman protocols for secure group communication and evaluates their performance on wireless ad hoc networks. The proposed schemes are compared at the same security level with DLP-based group protocols under different channel conditions. Our experiments and analysis show that the Tree-based Group Elliptic Curve Diffie-Hellman (TGECDH) protocol is the best in overall performance for secure group communication among the four schemes discussed in the paper. Low communication overhead, relatively low computation load and short packets are the main reasons for the good performance of the TGECDH protocol.

Coordination and Control of Autonomous Mobile Robots Swarms by using Particle Swarm Optimization Algorithm and Consensus Theory

This thesis presents some different techniques designed to drive a swarm of robots in an a-priori unknown environment in order to move the group from a starting area to a final one avoiding obstacles. The presented techniques are based on two different theories used alone or in combination: Swarm Intelligence (SI) and Graph Theory. Both theories are based on the study of interactions between different entities (also called agents or units) in Multi- Agent Systems (MAS). The first one belongs to the Artificial Intelligence context and the second one to the Distributed Systems context. These theories, each one from its own point of view, exploit the emergent behaviour that comes from the interactive work of the entities, in order to achieve a common goal. The features of flexibility and adaptability of the swarm have been exploited with the aim to overcome and to minimize difficulties and problems that can affect one or more units of the group, having minimal impact to the whole group and to the common main target. Another aim of this work is to show the importance of the information shared between the units of the group, such as the communication topology, because it helps to maintain the environmental information, detected by each single agent, updated among the swarm. Swarm Intelligence has been applied to the presented technique, through the Particle Swarm Optimization algorithm (PSO), taking advantage of its features as a navigation system. The Graph Theory has been applied by exploiting Consensus and the application of the agreement protocol with the aim to maintain the units in a desired and controlled formation. This approach has been followed in order to conserve the power of PSO and to control part of its random behaviour with a distributed control algorithm like Consensus.

Reducing the time period of steady state does not affect the accuracy of energy expenditure measurements by indirect calorimetry

Achievement of steady state during indirect calorimetry measurements of resting energy expenditure (REE) is necessary to reduce error and ensure accuracy in the measurement. Steady state is often defined as 5 consecutive min (5-min SS) during which oxygen consumption and carbon dioxide production vary by +/-10%. These criteria, however, are stringent and often difficult to satisfy. This study aimed to assess whether reducing the time period for steady state (4-min SS or 3-min SS) produced measurements of REE that were significantly different from 5-min SS. REE was measured with the use of open-circuit indirect calorimetry in 39 subjects, of whom only 21 (54%) met the 5-min SS criteria. In these 21 subjects, median biases in REE between 5-min SS and 4-min SS and between 5-min SS and 3-min SS were 0.1 and 0.01%, respectively. For individuals, 4-min SS measured REE within a clinically acceptable range of +/-2% of 5-min SS, whereas 3-min SS measured REE within a range of -2-3% of 5-min SS. Harris-Benedict prediction equations estimated REE for individuals within +/-20-30% of 5-min SS. Reducing the time period of steady state to 4 min produced measurements of REE for individuals that were within clinically acceptable, predetermined limits. The limits of agreement for 3-min SS fell outside the predefined limits of +/-2%; however, both 4-min SS and 3-min SS criteria greatly increased the proportion of subjects who satisfied steady state within smaller limits than would be achieved if relying on prediction equations.

Quantum cryptography without switching

We propose a new coherent state quantum key distribution protocol that eliminates the need to randomly switch between measurement bases. This protocol provides significantly higher secret key rates with increased bandwidths than previous schemes that only make single quadrature measurements. It also offers the further advantage of simplicity compared to all previous protocols which, to date, have relied on switching.

A Test of Performance of Breast MRI Interpretation in a Multicentre Screening Study

Objectives: The aim of this study was to assess the consistency and performance of radiologists interpreting breast magnetic resonance imaging (MRI) examinations. Materials and Methods: Two test sets of eight cases comprising cancers, benign disease, technical problems and parenchymal enhancement were prepared from two manufacturers' equipment (X and Y) and reported by 15 radiologists using the recording form and scoring system of the UK MRI breast screening study [(MAgnetic Resonance Imaging in Breast Screening (MARIBS)]. Variations in assessments of morphology, kinetic scores and diagnosis were measured by assessing intraobserver and interobserver variability and agreement. The sensitivity and specificity of reporting performances was determined using receiver operating characteristic (ROC) curve analysis. Results: Intraobserver variation was seen in 13 (27.7%) of 47 of the radiologists' conclusions (four technical and seven pathological differences). Substantial interobserver variation was observed in the scores recorded for morphology, pattern of enhancement, quantification of enhancement and washout pattern. The overall sensitivity of breast MRI was high [88.6%, 95% confidence interval (CI) 77.4-94.7%], combined with a specificity of 69.2% (95% CI 60.5-76.7%). The sensitivities were similar for the two test sets (P=.3), but the specificity was significantly higher for the Manufacturer X dataset (P

Statistical distribution, host for encrypted information

The statistical distribution, when determined from an incomplete set of constraints, is shown to be suitable as host for encrypted information. We design an encoding/decoding scheme to embed such a distribution with hidden information. The encryption security is based on the extreme instability of the encoding procedure. The essential feature of the proposed system lies in the fact that the key for retrieving the code is generated by random perturbations of very small value. The security of the proposed encryption relies on the security to interchange the secret key. Hence, it appears as a good complement to the quantum key distribution protocol. © 2005 Elsevier B.V. All rights reserved.

Comparative analysis by protocol and key of seed storage behaviour of sixty Vietnamese tree species

Seed storage behaviour of 5 1 native and 9 introduced tree species in Vietnam was investigated using a brief protocol developed to aid biodiversity conservation in circumstances where little is known about the seeds. Of the 60 species, 34 appeared to show orthodox (Acacia auriculaeformis, Adenanthera pavonina, Afzelia xylocarpa, Bauhinia purpurea, Callistemon lanceolatus, Cananga odorata, Canarium nigrum, Cassia fistula, Cassia javanica, Cassia splendida, Chukrasia tabularis, Dalbergia bariaensis, Dialium cochinchinensis, Diospyros mollis, Diospyros mun, Dracuntomelon duperreanum, Erythrophleum fordii, Khaya senegalensis, Lagerstroemia speciosa, Leucaena leucocephala, Livistona cochinchinensis, Markhamia stipulata, Melaleuca cajuputi, Millettia ichthyotona, Peltophorum pterocarpum, Peltophorum tonkinensis, Pinus khasya, Pinus massoniana, Pinus merkusii, Pterocarpus macrocarpus, Sindora siamensis, Sophora tonkinense, Sterculia foetida, Swietenia macrophylla), 13 recalcitrant (Avicennia alba, Beilschmiedia roxburghiana, Caryota mitis, Dimocarpus sp., Diospyros malabarica, Dipterocarpus chartaceus, Dypsis pinnatifrons, Hopea odorata, Lithocarpus gigantophylla, Machilus odoratissimus, Melanorrhoea laccifera, Melanorrhea usitata, Syzygium cinereum) and 13 intermediate (Anisoptera cochinchinensis, Aphanamixis polystachya, Averrhoa carambola, Carissa carandas, Chrysopylum cainito, Cinnamomum camphora, Citrofortunella microcarpa, Citrus grandis var. grandis, Elaeis guineensis, Hydnocarpus anthelmintica, Madhuca floribunda, Manilkara achras, Mimusops elengi) seed storage behaviour. A double-criteria key to estimate likely seed storage behaviour showed good agreement with the above: the key can reduce the workload of seed storage behaviour identification considerably.