955 resultados para Cryptographic protocols


Relevância:

20.00% 20.00%

Publicador:

Resumo:

JXTA is a peer-to-peer (P2P) middleware whichhas undergone successive iterations through its 10 years of history, slowly incorporating a security baseline that may cater to different applications and services. However, in order to appeal to a broader set of secure scenarios, it would be interesting to take into consideration more advanced capabilities, such as anonymity.There are several proposals on anonymous protocols that can be applied in the context of a P2P network, but it is necessary to be able to choose the right one given each application¿s needs. In this paper, we provide an experimental evaluation of two relevant protocols, each one belonging to a different category of approaches to anonymity: unimessage and split message. Webase our analysis on two scenarios, with stable and non-stable peers, and three metrics: round trip-time (RTT), node processing time and reliability.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

AbstractObjective:To assess the reduction of estimated radiation dose in abdominal computed tomography following the implementation of new scan protocols on the basis of clinical suspicion and of adjusted images acquisition parameters.Materials and Methods:Retrospective and prospective review of reports on radiation dose from abdominal CT scans performed three months before (group A – 551 studies) and three months after (group B – 788 studies) implementation of new scan protocols proposed as a function of clinical indications. Also, the images acquisition parameters were adjusted to reduce the radiation dose at each scan phase. The groups were compared for mean number of acquisition phases, mean CTDIvol per phase, mean DLP per phase, and mean DLP per scan.Results:A significant reduction was observed for group B as regards all the analyzed aspects, as follows: 33.9%, 25.0%, 27.0% and 52.5%, respectively for number of acquisition phases, CTDIvol per phase, DLP per phase and DLP per scan (p < 0.001).Conclusion:The rational use of abdominal computed tomography scan phases based on the clinical suspicion in conjunction with the adjusted images acquisition parameters allows for a 50% reduction in the radiation dose from abdominal computed tomography scans.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Performance of symmetric and asymmetriccryptography algorithms in small devices is presented. Both temporaland energy costs are measured and compared with the basicfunctional costs of a device. We demonstrate that cryptographicpower costs are not a limiting factor of the autonomy of a deviceand explain how processing delays can be conveniently managedto minimize their impact.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Paratuberculosis is an important enteritis of ruminants caused by Mycobacterium avium subsp. paratuberculosis (Map). The disease is officially considered exotic in Brazil, but recent serological surveys and the isolation of the agent suggest it may occur in our herds. The aim of this study was to evaluate three different formulations of Herrold's egg yolk agar with mycobactin J (HEYM) and four faecal culture protocols considering their ability for Map growth as well as cost and ease of application. Three formulations of HEYM were inoculated with two suspensions of Map. Spiked faeces and naturally contaminated faecal samples were treated by the four faecal culture protocols. Centrifugation protocol and HEYM recommended by OIE showed the best results on the recovery of Map.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The total number of CD34+ cells is the most relevant clinical parameter when selecting human umbilical cord blood (HUCB) for transplantation. The objective of the present study was to compare the two most commonly used CD34+ cell quantification methods (ISHAGE protocol and ProCount™ - BD) and analyze the CD34+ bright cells whose 7-amino actinomycin D (7AAD) analysis suggests are apoptotic or dead cells. Twenty-six HUCB samples obtained at the Placental Blood Program of New York Blood Center were evaluated. The absolute numbers of CD34+ cells evaluated by the ISHAGE (with exclusion of 7AAD+ cells) and ProCount™ (with exclusion of CD34+ bright cells) were determined. Using the ISHAGE protocol we found 35.6 ± 19.4 CD34+ cells/µL and with the ProCount™ method we found 36.6 ± 23.2 CD34+ cells/µL. With the ProCount™ method, CD34+ bright cell counts were 9.3 ± 8.2 cells/µL. CD34+ bright and regular cells were individually analyzed by the ISHAGE protocol. Only about 1.8% of the bright CD34+ cells are alive, whereas a small part (19.0%) is undergoing apoptosis and most of them (79.2%) are dead cells. Our study showed that the two methods produced similar results and that 7AAD is important to exclude CD34 bright cells. These results will be of value to assist in the correct counting of CD34+ cells and to choose the best HUCB unit for transplantation, i.e., the unit with the greatest number of potentially viable stem cells for the reconstitution of bone marrow. This increases the likelihood of success of the transplant and, therefore, the survival of the patient.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Several studies of the quantitative relationship between sodium need and sodium intake in rats are reviewed. Using acute diuretic treatment 24 h beforehand, intake matches need fairly accurately when intake is spread out in time by using a hypotonic solution of NaCl. In contrast, using a hypertonic solution, intake is typically double the need. Using the same diuretic treatment, although the natriuresis occurs within ~1 h, the appetite appears only slowly over 24 h. Increased plasma levels of aldosterone parallel the increased intake; however, treatment with metyrapone blocks the rise in aldosterone but has no effect on appetite. Satiation of sodium appetite was studied in rats using sodium loss induced by chronic diuretic treatment and daily salt consumption sessions. When a simulated foraging cost was imposed on NaCl access in the form of a progressive ratio lever press task, rats showed satiation for NaCl (break point) after consuming an amount close to their estimated deficit. The chronic diuretic regimen produced hypovolemia and large increases in plasma aldosterone concentration and renin activity. These parameters were reversed to or toward non-depleted control values at the time of behavioral satiation in the progressive ratio protocol. Satiation mechanisms for sodium appetite thus do appear to exist. However, they do not operate quantitatively when concentrated salt is available at no effort, but instead allow overconsumption. There are reasons to believe that such a bias toward overconsumption may have been beneficial over evolutionary time, but such biasing for salt and other commodities is maladaptive in a resource-rich environment.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

There is evidence that brain temperature (Tbrain) provides a more sensitive index than other core body temperatures in determining physical performance. However, no study has addressed whether the association between performance and increases in Tbrain in a temperate environment is dependent upon exercise intensity, and this was the primary aim of the present study. Adult male Wistar rats were subjected to constant exercise at three different speeds (18, 21, and 24 m/min) until the onset of volitional fatigue. Tbrain was continuously measured by a thermistor inserted through a brain guide cannula. Exercise induced a speed-dependent increase in Tbrain, with the fastest speed associated with a higher rate of Tbrain increase. Rats subjected to constant exercise had similar Tbrain values at the time of fatigue, although a pronounced individual variability was observed (38.7-41.7°C). There were negative correlations between the rate of Tbrain increase and performance for all speeds that were studied. These results indicate that performance during constant exercise is negatively associated with the increase in Tbrain, particularly with its rate of increase. We then investigated how an incremental-speed protocol affected the association between the increase in Tbrain and performance. At volitional fatigue, Tbrain was lower during incremental exercise compared with the Tbrain resulting from constant exercise (39.3±0.3 vs 40.3±0.1°C; P<0.05), and no association between the rate of Tbrain increase and performance was observed. These findings suggest that the influence of Tbrain on performance under temperate conditions is dependent on exercise protocol.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In Mobile Ad-hoc Networks (MANET) the participating nodes have several roles such as sender, receiver and router. Hence there is a lot of energy consumed by the nodes for the normal working of the network since each node has many different roles. Also in MANET the nodes keep moving constantly and this in turn consumes a lot of energy. Since battery capacity of these nodes is limited it fails to fulfil the high demand of energy. The scarcity of energy makes the energy conservation in mobile ad-hoc networks an important concern. There is several research carried out on the energy consumption of mobile ad-hoc networks these days. Some of this research suggests sleep mode, transmission power control, load balancing etc. In this thesis, we are comparing various proposed energy efficient models for some of the ad-hoc protocols. We compare different energy efficient models for Optimised Linked State Algorithm (OLSR) and Ad-hoc On Demand Distance Vector (AODV). The routing protocols are compared for different parameters such as average remaining energy, number of nodes alive, payload data received and performance with different mobility speed. The simulation results helps in benchmarking the various energy efficient routing models for OLSR and AODV protocols. The benchmarking of the routing protocols can be based on many factors but this thesis concentrates on benchmarking the MANET routing protocols mainly based on the energy efficiency and increased network lifetime.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This thesis focuses on the private membership test (PMT) problem and presents three single server protocols to resolve this problem. In the presented solutions, a client can perform an inclusion test for some record x in a server's database, without revealing his record. Moreover after executing the protocols, the contents of server's database remain secret. In each of these solutions, a different cryptographic protocol is utilized to construct a privacy preserving variant of Bloom filter. The three suggested solutions are slightly different from each other, from privacy perspective and also from complexity point of view. Therefore, their use cases are different and it is impossible to choose one that is clearly the best between all three. We present the software developments of the three protocols by utilizing various pseudocodes. The performance of our implementation is measured based on a real case scenario. This thesis is a spin-off from the Academy of Finland research project "Cloud Security Services".

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Quand le E-learning a émergé il ya 20 ans, cela consistait simplement en un texte affiché sur un écran d'ordinateur, comme un livre. Avec les changements et les progrès dans la technologie, le E-learning a parcouru un long chemin, maintenant offrant un matériel éducatif personnalisé, interactif et riche en contenu. Aujourd'hui, le E-learning se transforme de nouveau. En effet, avec la prolifération des systèmes d'apprentissage électronique et des outils d'édition de contenu éducatif, ainsi que les normes établies, c’est devenu plus facile de partager et de réutiliser le contenu d'apprentissage. En outre, avec le passage à des méthodes d'enseignement centrées sur l'apprenant, en plus de l'effet des techniques et technologies Web2.0, les apprenants ne sont plus seulement les récipiendaires du contenu d'apprentissage, mais peuvent jouer un rôle plus actif dans l'enrichissement de ce contenu. Par ailleurs, avec la quantité d'informations que les systèmes E-learning peuvent accumuler sur les apprenants, et l'impact que cela peut avoir sur leur vie privée, des préoccupations sont soulevées afin de protéger la vie privée des apprenants. Au meilleur de nos connaissances, il n'existe pas de solutions existantes qui prennent en charge les différents problèmes soulevés par ces changements. Dans ce travail, nous abordons ces questions en présentant Cadmus, SHAREK, et le E-learning préservant la vie privée. Plus précisément, Cadmus est une plateforme web, conforme au standard IMS QTI, offrant un cadre et des outils adéquats pour permettre à des tuteurs de créer et partager des questions de tests et des examens. Plus précisément, Cadmus fournit des modules telles que EQRS (Exam Question Recommender System) pour aider les tuteurs à localiser des questions appropriées pour leur examens, ICE (Identification of Conflits in Exams) pour aider à résoudre les conflits entre les questions contenu dans un même examen, et le Topic Tree, conçu pour aider les tuteurs à mieux organiser leurs questions d'examen et à assurer facilement la couverture des différent sujets contenus dans les examens. D'autre part, SHAREK (Sharing REsources and Knowledge) fournit un cadre pour pouvoir profiter du meilleur des deux mondes : la solidité des systèmes E-learning et la flexibilité de PLE (Personal Learning Environment) tout en permettant aux apprenants d'enrichir le contenu d'apprentissage, et les aider à localiser nouvelles ressources d'apprentissage. Plus précisément, SHAREK combine un système recommandation multicritères, ainsi que des techniques et des technologies Web2.0, tels que le RSS et le web social, pour promouvoir de nouvelles ressources d'apprentissage et aider les apprenants à localiser du contenu adapté. Finalement, afin de répondre aux divers besoins de la vie privée dans le E-learning, nous proposons un cadre avec quatre niveaux de vie privée, ainsi que quatre niveaux de traçabilité. De plus, nous présentons ACES (Anonymous Credentials for E-learning Systems), un ensemble de protocoles, basés sur des techniques cryptographiques bien établies, afin d'aider les apprenants à atteindre leur niveau de vie privée désiré.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mémoire numérisé par la Division de la gestion de documents et des archives de l'Université de Montréal

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Key agreement is a cryptographic scenario between two legitimate parties, who need to establish a common secret key over a public authenticated channel, and an eavesdropper who intercepts all their messages in order to learn the secret. We consider query complexity in which we count only the number of evaluations (queries) of a given black-box function, and classical communication channels. Ralph Merkle provided the first unclassified scheme for secure communications over insecure channels. When legitimate parties are willing to ask O(N) queries for some parameter N, any classical eavesdropper needs Omega(N^2) queries before being able to learn their secret, which is is optimal. However, a quantum eavesdropper can break this scheme in O(N) queries. Furthermore, it was conjectured that any scheme, in which legitimate parties are classical, could be broken in O(N) quantum queries. In this thesis, we introduce protocols à la Merkle that fall into two categories. When legitimate parties are restricted to use classical computers, we offer the first secure classical scheme. It requires Omega(N^{13/12}) queries of a quantum eavesdropper to learn the secret. We give another protocol having security of Omega(N^{7/6}) queries. Furthermore, for any k>= 2, we introduce a classical protocol in which legitimate parties establish a secret in O(N) queries while the optimal quantum eavesdropping strategy requires Theta(N^{1/2+k/{k+1}}) queries, approaching Theta(N^{3/2}) when k increases. When legitimate parties are provided with quantum computers, we present two quantum protocols improving on the best known scheme before this work. Furthermore, for any k>= 2, we give a quantum protocol in which legitimate parties establish a secret in O(N) queries while the optimal quantum eavesdropping strategy requires Theta(N^{1+{k}/{k+1}})} queries, approaching Theta(N^{2}) when k increases.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Sensor networks are one of the fastest growing areas in broad of a packet is in transit at any one time. In GBR, each node in the network can look at itsneighbors wireless ad hoc networking (? Eld. A sensor node, typically'hop count (depth) and use this to decide which node to forward contains signal-processing circuits, micro-controllers and a the packet on to. If the nodes' power level drops below a wireless transmitter/receiver antenna. Energy saving is one certain level it will increase the depth to discourage trafiE of the critical issue for sensor networks since most sensors are equipped with non-rechargeable batteries that have limitedlifetime. Routing schemes are used to transfer data collectedby sensor nodes to base stations. In the literature many routing protocols for wireless sensor networks are suggested. In this work, four routing protocols for wireless sensor networks viz Flooding, Gossiping, GBR and LEACH have been simulated using TinyOS and their power consumption is studied using PowerTOSSIM. A realization of these protocols has beencarried out using Mica2 Motes.