Random security scheme selection for mobile transactions

Security in a mobile communication environment is always a matter for concern, even after deploying many security techniques at device, network, and application levels. The end-to-end security for mobile applications can be made robust by developing dynamic schemes at application level which makes use of the existing security techniques varying in terms of space, time, and attacks complexities. In this paper we present a security techniques selection scheme for mobile transactions, called the Transactions-Based Security Scheme (TBSS). The TBSS uses intelligence to study, and analyzes the security implications of transactions under execution based on certain criterion such as user behaviors, transaction sensitivity levels, and credibility factors computed over the previous transactions by the users, network vulnerability, and device characteristics. The TBSS identifies a suitable level of security techniques from the repository, which consists of symmetric, and asymmetric types of security algorithms arranged in three complexity levels, covering various encryption/decryption techniques, digital signature schemes, andhashing techniques. From this identified level, one of the techniques is deployed randomly. The results shows that, there is a considerable reduction in security cost compared to static schemes, which employ pre-fixed security techniques to secure the transactions data.

A Flexible Crypto-system Based upon the REDEFINE Polymorphic ASIC Architecture

The highest levels of security can be achieved through the use of more than one type of cryptographic algorithm for each security function. In this paper, the REDEFINE polymorphic architecture is presented as an architecture framework that can optimally support a varied set of crypto algorithms without losing high performance. The presented solution is capable of accelerating the advanced encryption standard (AES) and elliptic curve cryptography (ECC) cryptographic protocols, while still supporting different flavors of these algorithms as well as different underlying finite field sizes. The compelling feature of this cryptosystem is the ability to provide acceleration support for new field sizes as well as new (possibly proprietary) cryptographic algorithms decided upon after the cryptosystem is deployed.

Highly luminescent and thermally stable lanthanide coordination polymers designed from 4-(dipyridin-2-yl)aminobenzoate: efficient energy transfer from Tb3+ to Eu3+ in a mixed lanthanide coordination compound

Herein, a new aromatic carboxylate ligand, namely, 4-(dipyridin-2-yl)aminobenzoic acid (HL), has been designed and employed for the construction of a series of lanthanide complexes (Eu3+ = 1, Tb3+ = 2, and Gd3+ = 3). Complexes of 1 and 2 were structurally authenticated by single-crystal X-ray diffraction and were found to exist as infinite 1D coordination polymers with the general formulas {Eu(L)(3)(H2O)(2)]}(n) (1) and {Tb(L)(3)(H2O)]center dot(H2O)}(n) (2). Both compounds crystallize in monoclinic space group C2/c. The photophysical properties demonstrated that the developed 4-(dipyridin-2-yl)aminobenzoate ligand is well suited for the sensitization of Tb3+ emission (Phi(overall) = 64%) thanks to the favorable position of the triplet state ((3)pi pi*) of the ligand the energy difference between the triplet state of the ligand and the excited state of Tb3+ (Delta E) = (3)pi pi* - D-5(4) = 3197 cm(-1)], as investigated in the Gd3+ complex. On the other hand, the corresponding Eu3+ complex shows weak luminescence efficiency (Phi(overall) = 7%) due to poor matching of the triplet state of the ligand with that of the emissive excited states of the metal ion (Delta E = (3)pi pi* - D-5(0) = 6447 cm(-1)). Furthermore, in the present work, a mixed lanthanide system featuring Eu3+ and Tb3+ ions with the general formula {Eu0.5Tb0.5(L)(3)(H2O)(2)]}(n) (4) was also synthesized, and the luminescent properties were evaluated and compared with those of the analogous single-lanthanide-ion systems (1 and 2). The lifetime measurements for 4 strongly support the premise that efficient energy transfer occurs between Tb3+ and Eu3+ in a mixed lanthanide system (eta = 86%).

Mobile node authentication using key distribution scheme in wireless sensor networks

We consider the problem of secure communication in mobile Wireless Sensor Networks (WSNs). Achieving security in WSNs requires robust encryption and authentication standards among the sensor nodes. Severe resources constraints in typical Wireless Sensor nodes hinder them in achieving key agreements. It is proved from past studies that many notable key management schemes do not work well in sensor networks due to their limited capacities. The idea of key predistribution is not feasible considering the fact that the network could scale to millions. We prove a novel algorithm that provides robust and secure communication channel in WSNs. Our Double Encryption with Validation Time (DEV) using Key Management Protocol algorithm works on the basis of timed sessions within which a secure secret key remains valid. A mobile node is used to bootstrap and exchange secure keys among communicating pairs of nodes. Analysis and simulation results show that the performance of the DEV using Key Management Protocol Algorithm is better than the SEV scheme and other related work.

Variants of waters’ dual system primitives using asymmetric pairings

Waters, in 2009, introduced an important technique, called dual system encryption, to construct identity-based encryption (IBE) and related schemes. The resulting IBE scheme was described in the setting of symmetric pairing. A key feature of the construction is the presence of random tags in the ciphertext and decryption key. Later work by Lewko and Waters removed the tags and proceeding through composite-order pairings led to a more efficient dual system IBE scheme using asymmetric pairings whose security is based on non-standard but static assumptions. In this work, we have systematically simplified Waters 2009 IBE scheme in the setting of asymmetric pairing. The simplifications retain tags used in the original description. This leads to several variants, the first one of which is based on standard assumptions and in comparison to Waters’ original scheme reduces ciphertexts and keys by two elements each. Going through several stages of simplifications, we finally obtain a simple scheme whose security can be based on two standard assumptions and a natural and minimal extension of the decision Diffie-Hellman problem for asymmetric pairing groups. The scheme itself is also minimal in the sense that apart from the tags, both encryption and key generation use exactly one randomiser each. This final scheme is more efficient than both the previous dual system IBE scheme in the asymmetric setting due to Lewko and Waters and the more recent dual system IBE scheme due to Lewko. We extend the IBE scheme to hierarchical IBE (HIBE) and broadcast encryption (BE) schemes. Both primitives are secure in their respective full models and have better efficiencies compared to previously known schemes offering the same level and type of security.

Fault Attacks on Pairing-Based Protocols Revisited

Several papers have studied fault attacks on computing a pairing value e(P, Q), where P is a public point and Q is a secret point. In this paper, we observe that these attacks are in fact effective only on a small number of pairing-based protocols, and that too only when the protocols are implemented with specific symmetric pairings. We demonstrate the effectiveness of the fault attacks on a public-key encryption scheme, an identity-based encryption scheme, and an oblivious transfer protocol when implemented with a symmetric pairing derived from a supersingular elliptic curve with embedding degree 2.

Anonymous Authentication with Shared Secrets

Anonymity and authenticity are both important yet often conflicting security goals in a wide range of applications. On the one hand for many applications (say for access control) it is crucial to be able to verify the identity of a given legitimate party (a.k.a. entity authentication). Alternatively an application might require that no one but a party can communicate on its behalf (a.k.a. message authentication). Yet, on the other hand privacy concerns also dictate that anonymity of a legitimate party should be preserved; that is no information concerning the identity of parties should be leaked to an outside entity eavesdropping on the communication. This conflict becomes even more acute when considering anonymity with respect to an active entity that may attempt to impersonate other parties in the system. In this work we resolve this conflict in two steps. First we formalize what it means for a system to provide both authenticity and anonymity even in the presence of an active man-in-the-middle adversary for various specific applications such as message and entity authentication using the constructive cryptography framework of Mau11, MR11]. Our approach inherits the composability statement of constructive cryptography and can therefore be directly used in any higher-level context. Next we demonstrate several simple protocols for realizing these systems, at times relying on a new type of (probabilistic) Message Authentication Code (MAC) called key indistinguishable (KI) MACs. Similar to the key hiding encryption schemes of BBDP01] they guarantee that tags leak no discernible information about the keys used to generate them.

Institutional designs to face the dark side of total allowable catches

Setting total allowable catches (TACs) is an endogenous process in which different agents and institutions, often with conflicting interests and opportunistic behaviour, try to influence policy-makers. Such policy-makers, far from being the benevolent social planners many would wish them to be, may also pursue self-interest when making final decisions. Although restricted knowledge of stock abundance and population dynamics, and weakness in enforcement, have effects, these other factors may explain the reason why TAC management has failed to guarantee sustainable exploitation of fish resources. Rejecting the exogeneity of the TAC and taking advantage of fruitful debate on economic policy (i.e. the rules vs. discretion debate, and that surrounding the independence of central banks), two institutional developments are analysed as potential mechanisms to face up to misconceptions about TACs: long-term harvest control rules, and a central bank of fish.

Circuitos integrados reconfigurables de bajo consumo

El objetivo principal del trabajo es el diseño, utilizando técnicas de bajo consumo, del algoritmo de cifrado estándar AES (Advanced Encryption Standard) y su implementación sobre dispositivos reconfigurables, en particular sobre una FPGA.

Cascaded Fresnel digital hologram and its application to watermarking

A cascaded Fresnel digital hologram (CFDH) is proposed, together with its mathematical derivation. Its application to watermarking has been demonstrated by a simulation procedure, in which the watermark image to be hidden is encoded into the phase of the host image. The watermark image can be deciphered by the CFDH setup, the reconstructed image shows good quality and the error is almost close to zero. Compared with previous technique, this is a lensless architecture which minimizes the hardware requirement, and it is used for the encryption of digital image.

Watermarks encrypted in the cascaded Fresnel digital hologram

A cascaded Fresnel digital hologram (CFDH) is proposed, together with its mathematical derivation. Its application to watermarking has been demonstrated by a simulation procedure, in which the watermark image to be hidden is encoded into the phase of the host image. The watermark image can be deciphered by the CFDH setup, the reconstructed image shows good quality and the error is almost closed to zeros. Compared with previous technique, this is a lensless architecture, which minimizes the hardware requirement. (c) 2006 Elsevier GmbH. All rights reserved.

Deus, o diabo e a televisão: mídia moderna de massa e pentecostalismo em uma comunidade evangélica da Ilha Grande

O foco desta dissertação é a relação entre Pentecostalismo e a tecnologia televisiva na vila de Provetá, uma comunidade evangélica situada na Ilha Grande, município de Angra dos Reis, Estado do Rio de Janeiro. Os residentes de Provetá são majoritariamente membros da Igreja Pentecostal Assembléia de Deus, situada ali desde princípios da década de 1930. A televisão, em contraste, fora introduzida na vila apenas em 1987, mediante o acesso a antenas parabólicas. O objetivo central da dissertação é compreender o processo histórico e social de inserção da tecnologia televisiva na vila de Provetá, e como esta tecnologia se relaciona com mídias e práticas Pentecostais de mediação com o transcendental. Condenada num primeiro momento pelo então pastor presidente da Assembléia de Deus como uma tecnologia exclusivamente diabólica e portanto, irrevogavelmente proibida aos membros da igreja , a televisão fora progressivamente ressignificada pelas lideranças da igreja como uma tecnologia ambivalente, a partir da qual tanto Deus quanto o Diabo seriam capazes de operar. A dissertação explora, nesse sentido, o processo de negociação em torno dos significados religiosos atribuídos à televisão, bem como os regimes normativos relativos ao seu consumo. Dado o status ambivalente da tecnologia televisiva aos olhos das lideranças contemporâneas da igreja seu potencial de estar a serviço de Deus ou do Diabo, do bem ou do mal , busco compreender uma ética do assistir que parece subjazer o processo de autorização do consumo da televisão, isto é, como um crente deve assisti-la. Assistir à televisão de forma eticamente apropriada, portanto, implicaria um conhecimento essencial sobre como assistir. Este conhecimento, argumento, é o conhecimento da Bíblia. Mediante um regime de verdade bíblico, os provetaenses traçariam uma distinção fundamental em relação aos conteúdos televisivos considerados factuais ou reais, cujo consumo seria inofensivo ou benéfico, e aqueles considerados forjados, encenados ou construídos, cujo consumo seria inapropriado, ou ainda perigoso. Partindo da identificação das telenovelas da Rede Globo como mentiras de natureza diabólica, e do telejornal como um espaço de aprendizado para o crente, empreendo uma análise de recepção destes programas, buscando compreender as dinâmicas simbólicas e sensoriais de identificação das presenças e das agências de Deus e do Diabo através da televisão. O argumento central a ser desenvolvido na dissertação é o de que a experiência de assistir à televisão em Provetá encontra-se estruturada por uma estética Pentecostal fomentada a partir da Bíblia. A partir das práticas religiosas de mediação centradas na Bíblia, um regime sensorial Pentecostal fora progressivamente constituído: uma dada gramática do sentir os objetos da experiência em relação ao regime de verdade Bíblico. Têm-se, desse modo, uma dinâmica circular no interior da qual imagens são experimentadas sensivelmente a partir do prisma da verdade Bíblica, e tais sensações, por sua vez, objetificam a realidade dessa verdade no corpo do sujeito. Nessa dialética entre o crer e o sentir, a experiência sensível de assistir à televisão é informada por um entendimento Pentecostal da realidade, e esse entendimento é autenticado por aquilo que é sentido.

Criptografia: Da origem aos dias atuais

Esta pesquisa foi realizada com a intenção de motivar o estudo da criptografia, mostrando que a matemática e a comunicação estão presentes em diversos momentos, tanto no passado quanto no presente. Este trabalho mostra a origem da criptoanálise e toda a sua evolução dando ênfase nos mecanismos de codificação e decodificação através de exemplos práticos. Além disso, alguns métodos criptográficos são destacados como a cifra de substituição monoalfabética, a cifra de Vigenère, a criptografia RSA que é o método mais conhecido de criptografia de chave pública, as cifras de Hill, o método das transformações lineares e o método de Rabin, devido a sua grande importância para a evolução de sistemas computacionais e assinaturas digitais entre outros. Por fim, mostra-se a importância e a necessidade dos recursos criptográficos nos dias de hoje, na tentativa de impedir que hackers e pessoas que fazem mau uso do conhecimento matemático possam causar danos a sociedade, seja por uma simples mensagem ou até mesmo através de situações mais imprudentes como as transações bancárias indevidas

On a Certain Algebraic Property of Block Ciphers

This is a study on a certain group theoretic property of the set of encryption functions of a block cipher. We have shown how to construct a subset which has this property in a given symmetric group by a computer algebra software GAP4.2 (Groups, Algorithms, and Programming, Version 4.2). These observations on group structures of block ciphers suggest us that we may be able to set a trapdoor based on meet-in-the-middle attack on block ciphers.

韩国加密标准的安全性分析

SEED是韩国的数据加密标准，设计者称用线性密码分析攻击SEED的复杂度为2^335.4，而用本文构造的15轮线性逼近攻击SEED的复杂度为2^328．为了说明SEED抵抗差分密码分析的能力，设计者首先对SEED的变体SEED‘做差分密码分析，指出9轮SEED*对差分密码分析是安全的；利用SEED^*的扩散置换和盒子的特性，本文构造SEED^*的9轮截断差分，因此10轮SEED^*对截断差分密码分析是不免疫的．本文的结果虽然对SEED的实际应用构成不了威胁，但是显示了SEED的安全性并没有设计者所称的那样安全．