This study evaluates the predictive capacity of sociodemographic variables of the mother over the level of maternal secure base scripts. The participants were 83 mothers from 15 to 45 years old (M = 24.72, SD = 8.70).The level of maternal secure base was evaluated through the Narratives of Adult Attachment (Waters & Waters, 2006). The results show that the participants do not have an adequate level of secure base script. It was found that interaction between the age of the mother and the educational attainment level, partly explains the level of the maternal secure base script (R2 = .19). The protector role of the level of educational attainment for older mothers to have a higher level of secure base scripts isproposed. / Este estudio evalúa la capacidad predictiva de variables sociodemográficas de la madre sobre sus guiones de base segura. Participaron 83 madres de 15 a 45 años de edad (M =24.72, DE = 8.70). El nivel de base segura materno fue evaluado a través de las Narrativas de Apego Adulto (Waters & Waters, 2006). Los resultados muestran que las participantes no cuentan con un adecuado nivel de base segura. Se encontró que la interacción entre la edad y el nivel de instrucción materno explica en parte el nivel de base segura de las madres (R2 =.19). Se postula el rol protector del nivel de instrucción para que las madres mayores, tengan un mayor nivel de base segura en sus guiones. / Esta pesquisa avalia a capacidade preditiva das variáveis sócio-demográficas da mãe, a partir de seu script de base segura. Participaram 83 mães com idades entre 15 e 45 anos (M = 24.72, DE = 8.70). O nível de script de base segura materno foi avaliado através das Narrativas de Apego Adulto (Waters & Waters, 2006). Os resultados mostram que as participantes não apresentam um nível adequado de base segura. Encontrou-se que a interação entre idade e grau de instrução da mãe explica, em parte, o nível de base segura das mães (R2 = .19). Propõe-se que um grau de instrução maior constituiria um papel protetor nas mães mais velhas, para elas apresentarem maior nível de base segura nos seus scripts.

Submitted by Irene Nascimento (irene.kessia@ufpe.br) on 2016-06-22T17:04:20Z No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Utilizando o Protocolo Bitcoin para Condução de Computações Multilaterais Seguras e Justas.pdf: 1665447 bytes, checksum: 2ff437be55e080c80d97e0d6582cb360 (MD5) / Made available in DSpace on 2016-06-22T17:04:20Z (GMT). No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Utilizando o Protocolo Bitcoin para Condução de Computações Multilaterais Seguras e Justas.pdf: 1665447 bytes, checksum: 2ff437be55e080c80d97e0d6582cb360 (MD5) Previous issue date: 2016-02-02 / Suponha que dois milionários desejam descobrir quem é o mais rico sem que, para isso, um descubra o valor da fortuna do outro. Esse problema pode ser facilmente resolvido se ambos concordarem sobre um juiz a quem eles possam confiar a tarefa de calcular a resposta sem quebrar a privacidade de nenhum dos dois. O desafio, no entanto, é substituir esse juiz por uma interação multilateral, ou protocolo, que alcance o mesmo grau de segurança. Isso significa conduzir uma computação multilateral segura. Esse exemplo é conhecido como o problema dos milionários de Yao e foi proposto por Andrew Yao em um dos primeiros esforços para desenvolver uma forma geral de se conduzir computações multilaterais seguras. Desde lá, na década de 1980, vários avanços foram feitos nesse sentido e, hoje, já é um resultado bem estabelecido que qualquer função multilateral pode ser computada de maneira segura. Esse importante resultado, no entanto, vem com uma importante ressalva: a justiça não pode ser alcançada de maneira geral. Entende-se por justiça a garantia de que, no final de uma computação, ou todos os participantes recebem suas respostas ou nenhum deles recebe. Motivadas por esse resultado de impossibilidade, várias definições alternativas de justiça foram concebidas. Uma delas considera uma computação como sendo justa se os participantes que agirem desonestamente forem monetariamente penalizados. Ou seja, se alguns participantes receberem o resultado da computação e privarem os demais de receberem, então esse conluio é penalizado e os demais participantes, compensados. Com essa definição, uma computação justa pode ser vista como o cumprimento de um contrato, no qual cada participante se compromete a agir honestamente ou a pagar uma multa. Sob essa perspectiva, trabalhos recentes mostram como criptomoedas podem ser utilizadas para escrever esses contratos e, portanto, servir para condução de computações multilaterais seguras e monetariamente justas. Uma criptomoeda é um sistema monetário que se baseia em princípios criptográficos para alcançar segurança e controlar a taxa de emissão de novas moedas. O Bitcoin, criado em 2008 por Satoshi Nakamoto, foi a primeira realização dessa ideia. Ele se baseia em uma estrutura de dados pública chamada blockchain, que armazena o histórico de todas as transações já realizadas. A segurança da blockchain, incluindo sua não-maleabilidade, é garantida pela dificuldade da prova de trabalho exigida para que novas informações sejam adicionadas nessa estrutura. Cada transferência de moedas no Bitcoin é feita de maneira que um usuário só pode recebê-las mediante a apresentação de uma entrada que satisfaça um script especificado pelo remetente. Contratos escritos através desses scripts se fazem cumprir sem a necessidade de intervenção de uma parte confiável externa. Essa característica é o que faz o Bitcoin ser adequado e atrativo para se conferir justiça para computações multilaterais seguras. Um dos nossos objetivos neste trabalho é a realização de um estudo sobre os resultados que permitem a computação segura de uma função qualquer e dos que estabelecem a impossibilidade de se alcançar justiça de maneira geral. Tentaremos manter o rigor matemático para evitar uma apresentação estritamente panorâmica. Além disso, analisaremos criticamente uma construção proposta para utilizar o Bitcoin como plataforma para condução de computações multilaterais seguras e justas. Por fim, a partir dos pontos positivos e negativos levantados, apresentaremos uma proposta nossa com a mesma finalidade. / Suppose that two millionaires want to find out which one is the richest, but without revealing how much their fortunes are worth in the process. This problem can be easily solved if they trust a judge to compute the desired answer without compromising their privacy. The challenge, however, is to replace such a judge by a multiparty interaction, or protocol, that achieves the same level of security. That is, the challenge is to carry out a secure multiparty computation. The previous example is known as Yao’s millionaires’ problem and was stated by Andrew Yao in one of the first efforts to develop a general algorithm to carry out secure multiparty computations. Since then, in the 1980s, several advances were made to achieve this goal and, nowadays, it is a well-established result that any multiparty function can be securely computed. This important result, however, comes with an important restriction: fairness cannot be achieved in general. Fairness is the guarantee that, at the end of a computation, either all parties receive their outputs or none of them does. Motivated by this impossibility, several alternative definitions of fairness have been proposed. One of them considers a computation to be fair if the dishonest parties are monetarily penalized and the honest ones are monetarily compensated. According to this definition, a fair computation can be viewed as the enforcement of a contract, in which the parties agree on paying a penalty if they misbehave. Recent works have shown how cryptocoins can be used to write those contracts and, therefore, to be used for carrying out secure and monetarily fair multiparty computations. A cryptocoin is a monetary system that relies on cryptographic principles for achieving security and controlling the coin issuing rate. Bitcoin, created in 2008 by Satoshi Nakamoto, was the first practical realization of this idea. In its core, there is a publicly maintained data structure called blockchain, which works as a ledger and stores every transaction ever made. The security of the blockchain, including its non-malleability, is guaranteed by the difficulty of the proof of work required to add new data to it. A Bitcoin transaction can only be redeemed by a user that presents an input satisfying a script specified by the issuer of the transaction. Contracts written on these scripts are enforced without an external trusted third-party to intervene. This makes Bitcoin suitable and interesting to confer monetary fairness to multiparty computations. One of the goals of this work is to present the results that allow any function to be securely computed and the ones that show the impossibility of achieving fairness in general. We will try to present these results with the appropriate mathematical rigor to avoid giving just an overview of them. We will also analyze a recently proposed construction that uses Bitcoin as a platform to carry out fair multiparty computations. Finally, based on its positive and negative points, we will propose a construction with the same goal.

Context: In Web applications, the Software vulnerability can be reduced by applying security testing in all phases of the software development life cycle (SDLC). Lot of vulnerabilities might occur if the security testing is applied in the last phase of SDLC. In order to mitigate these vulnerabilities, a lot of rework is required that involves reverse engineering in the development and design phases. To overcome this situation, organizations are shifting from security testing (performed in last phase) towards security testing in the early phases of SDLC. Objectives: The main objectives of this thesis are to gather the benefits and challenges of security testing in the last phase versus security testing in every phase of the SDLC. After gathering, authors want to compare both implementations because these days most organizations are shifting from last phase to every phase of SDLC. Justification to the reason can be achieved by this comparison. Methods: In order to satisfy the objectives of this thesis, a literature review and interviews were conducted. The literature review was conducted by gathering benefits and challenges of last phase and every phase of SDLC. Authors have applied coding technique to the data gathered from literature review. By using the results from literature review, a set of questions were framed. Based on these questions, interviews in various organizations were performed. To analyze the practitioner’s data we used Sorting and Coding technique. Then, we conducted a comparative analysis to compare both results. Results: Application of security testing in the last phase of the SDLC results in a lot of rework which in turn leads to instability in managing the cost, time and resources in an organisation. In order to overcome this, more and more organisations are introducing security testing at each and every phase of SDLC. Conclusions: It can be concluded that every phase of security testing in SDLC has more benefits than applying in last phase of SDLC. To evaluate this process more research is needed to acquire more knowledge of security testing in all phases of SDLC. Through literature review and interviews conducted, it is evident that security testing at early phases causes a reduction in rework which in turn leads to more efficient management of cost, time and resources of a project. / +91 8977404640

Mötet med närstående till patienter som avlidit är ett stressfyllt möte, både för närstående och sjuksköterskan. Tidigare forskning visade att närstående önskade få tydlig information och söker trygghet hos varandra. Närstående upplevde sjuksköterskan som en stor källa för trygghet och stöd i sorgprocessen. Den professionalitet och säkerhet hon förmedlar var av stor vikt för närståendes upplevelse av hela vårdtiden. Syftet med studien var att beskriva erfarna intensivvårdssjuksköterskors reflektioner från möten med närstående till patienter som avlidit. En intervjustudie med kvalitativ ansats gjordes. Informanterna i denna studie kunde alla klassificeras som skickliga och expertsjuksköterskor enligt Benners utvecklingsstadier för sjuksköterskan. Informanterna beskrev möten som kunde delas in i följande huvudteman för att ge stöd till de närstående som, trygghet, lyhördhet, stillhet och lugn. Med hjälp av dessa huvudteman upplevde informanterna att de kunde skapa optimala förutsättningar för att skapa stillhet och lugn. / Meeting patient’s next of kin after decease is a stressful meeting for both the next of kin and the advanced practice nurse. Preceding research showed that the next of kin sought to receive information that was easy to understand and that they seek solace from each other. The advanced practice nurse was experienced as a great source of comfort and support in the grieving process by next of kin. Professionalism and support mediated by the advanced practice nurse was of great importance for the next of kin’s experience of the hospitalization period. The aim of this study was to describe experienced intensive care unit nurses reflections of meeting next of kin to patients who are diseased. An interview study with a qualitative approach was done. The informants in this study could all be classified as the skilful and the expert nurse according to Benners stages of progression for the nurse. The informants described main themes to support and comfort the next of kin, they were; feeling secure, attentiveness, stillness. With the aid of these categories the informants experienced that they could create the optimal conditions in creating stillness in the storm that the next of kin are in after death has occurred.

In recent years, researchers have become interested in the concept of a positive body image. Interpersonal relationships influence the acceptance and appreciation of the body. However, prior studies on positive body image has almost exclusively focused on studying general instead of specific relationships. The present study sought to investigate whether the association between secure attachment to friends and body appreciation is moderated by the personality trait Extraversion in young adults. The participants were 194 men and women aged 18 to 25 years (M = 22, SD = 1.78) who completed a questionnaire measuring body appreciation, secure attachment to friends and Extraversion. The results of a hierarchal regression showed that secure attachment to friends did not predict body appreciation and that Extraversion did not have a moderating effect. Extraversion was, however, positively associated with body appreciation, above and beyond the effect of sex, BMI and parental socioeconomic status. These findings contribute to a richer understanding of the potential advantages of including Extraversion when studying body image in young adults. / Begreppet positiv kroppsbild har under den senaste tiden börjat att fånga forskares intresse. Acceptans och uppskattning av sin kropp påverkas av interpersonella relationer. Tidigare studier på positiv kroppsbild har dock nästan uteslutande fokuserat på att studera generella istället för specifika relationer. Denna studie syftade till att utforska huruvida trygg anknytning till vänner hos unga vuxna påverkar kroppsuppskattningen och om sambandet modereras av personlighetsdraget Extraversion. Deltagarna var 194 kvinnor och män i åldrarna 18 till 25 år (M = 22, SD = 1.78) som besvarade en enkät gällande kroppsuppskattning, trygg anknytning till vänner och extraversion. Resultatet av en hierarkisk regression visade att trygg anknytning till vänner inte förutspådde kroppsuppskattning och att extraversion inte hade en modererande effekt. Extraversion var dock positivt korrelerat med kroppsuppskattning, även efter det att kön, BMI och föräldrars socioekonomiska status kontrollerats för. Dessa fynd bidrar till en större förståelse för de potentiella fördelarna med att inkludera extraversion vid studier av positiv kroppsbild bland unga vuxna.

Participants from recent secure email user studies have expressed a need to use secure email tools only a few times a year. At the same time, Internet users are expressing concerns over the permanence of personal information on the Internet. Support for short-lived keys has the potential to address both of these problems. However, the short-lived keys usability and security space is underdeveloped and unexplored. In this thesis, we present an exploration of the short-lived keys usability and security design space. We implement both a short-lived keys and a long-term keys secure email prototype. With these two prototypes, we conduct a within-subjects user study. Results from our study show that participants believe the short-lived keys prototype is more secure and more trusted. Participants also provide feedback on what they want in a system supporting short-lived keys. They also discuss how concerned they are about the permanence of their information on the Internet and on their devices.

A dependency on secrets is inherent in most IT systems, especially as they become increasingly complex and interdependent. Vast amounts of research have explored how to protect the confidentiality, integrity and authenticity of secrets through means such as encryption and authentication. These means are in themselves supported by secrets, and introducing those secrets is an area that has seen less exploration. Secrets are protected by secrets, and the secret at the top needs to be provided by one of the numerous methods with various advantages and disadvantages. This work follows a design science research approach to design a framework for comparing those methods of secure introduction, demonstrated through scenarios and practical exercises.

The thesis is focused on implementation of aplication for secure telephone communication on data network. Application is developed for operating system Android. For call management is responsible signaling protocol SIP and for transfer of voice data is used protocol RTP. For security of call is first created cryptografic key for symetric cryptography. After generating key is established call, which is encrypted by symetric cipher AES. Encrypting between communicating sides is provided in application or on microSD card. Part of solution is measurement of speed of cryptographic primitives, which are used for secure call.

My master’s thesis is focused on designing and creating communication network, which provides communication between two independent networks through encrypted tunnel. My solution is based on routers formed by older personal computers with FreeBSD like a operating system. Between routers is created static encrypted tunnel by using IPSec protocol. Voice services provides packet oriented exchange Asterisk with support of signaling protocol SIP. This solution can be used eg. for connecting remote branch to headquarters of company and then can branch utilize shrared resources. To headquarters can connect also remote workers from their home. In this case are used SSL certificates to authentication of user. This scenario is very required today.

This master´s thesis deals with problems of certification authorities and digital signature. There are analyzed principles of digital certificates and certification authorities. It describes the the most widely used cryptosystems and hash functions, which are used in communications with certificates and digital signature. Analysis is focused on Public key infrastructure standard, which describes rules of creating of certification authority and digital signature. There is also described detailed principle of digital signature. Next chapters deals with studying of protocol SSL, principles of functions and usage of SSL. Practical part of this thesis realizes certification authority and information system. There is shown used software and configuration of it. Last part describes procedures during using aplication and her realization.