ECC programming in Java Card

9 páginas, 3 figuras, 3 listingElliptic Curve Cryptography (ECC) is a branch of public-key cryptography based on the arithmetic of el- liptic curves. Given its mathematical characteristics, ECC is currently one of the best options for protecting sensitive information. The lastest version of the Java Card platform includes several classes related to elliptic curves. However, potential developers are discouraged by the peculiarities of its programming model and the scarce information available. In this work, we present an up to date and extensive review of the ECC support in Java Card. In addition to that, we offer to the reader the complete code of two applications that will allow programmers to understand and test the entire application development process in Java Card.This work has been partially supported by Ministerio de Ciencia e Innovaci ́ on (Spain) under the grant TIN2011- 22668.Peer reviewe

Biometric Fuzzy Extractor Scheme for Iris Templates

In: The 2009 World Congress in Computer Science, Computer Engineering, and Applied Computing (WORLDCOMP'09), The 2009 International Conference on Security and Management (SAM'09), Vol II, Proceedings 563--569. H.R. Arabnia and K. Daimi (Eds.), Las Vegas (USA), July, 2009Biometric recognition offers a reliable and natural solution to the problem of user authentication by means of her physical and behavioral traits. An iris template protection scheme which associates and retrieves a secret value with a high level of security, is proposed. The security is guaranteed thanks to the requirements of fuzzy extractors. The implementation of the scheme is done in Java and experimental results are performed to calculate its False Acceptance Rate and its False Rejection Rate.This work has been partially supported by Ministerio de Industria, Turismo y Comercio (Spain), in collaboration with CDTI and Telefónica I+D under the project SEGUR@ (CENIT-2007 2004).Peer reviewe

Codificación de información mediante códigos de barras

Se presentan en este artículo varios sistemas de codificación de información mediante códigos de barras. En particular se detalla la forma de elaborar el código de barras EAN13, posiblemente el más utilizado en la actualidad, y su relación con otro de los códigos más empleados: el ISBN para la catalogación de libros. Se incluyen y comentan los procesos matemáticos empleados para elaborar tales códigosPeer reviewe

Graphic cryptography with pseudorandom bit generators and cellular automata

In this paper we propose a new graphic symmetrical cryptosystem in order to encrypt a colored image defined by pixels and by any number of colors. This cryptosystem is based on a reversible bidimensional cellular automaton and uses a pseudorandom bit generator. As the key of the cryptosystem is the seed of the pseudorandom bit generator, the latter has to be cryptographically secure. Moreover, the recovered image from the ciphered image has not loss of resolution and the ratio between the ciphered image and the original one, i.e., the factor expansion of the cryptosystem, is $1$.Peer reviewe

Graphic cryptosystem using memory cellular automata

In this paper, a new graphic cryptosystem based on reversible memory cellular automata is introduced. Its main feature is that the original image and the cipher image are defined by the same palette of colors and that the recovered image is equal to the original one, that is, there is not loss of resolution. Moreover, it is proved that the proposed cryptosystem is secure against brute-force attacks, statistical attacks and chosen plaintext attacksPeer reviewe

El tratamiento quirúrgico prenatal del mielomeningocele

Tesis doctoral inédita leída en la Universidad Autónoma de Madrid, Facultad de Medicina, Departamento de Pediatría. Fecha de lectura: 16-06-201

A group signature scheme based on the integer factorization and the subgroup discrete logarithm problems

8 pagesGroup signature schemes allow a user, belonging to a speci c group of users, to sign a message in an anonymous way on behalf of the group. In general, these schemes need the collaboration of a Trusted Third Party which, in case of a dispute, can reveal the identity of the real signer. A new group signature scheme is presented whose security is based on the Integer Factorization Problem (IFP) and on the Subgroup Discrete Logarithm Problem (SDLP).This work has been partially supported by the \Fundaci on Memoria D. Samuel Sol orzano Barruso" under the Project FS/7-2010.Peer reviewe

A New Edit Distance for Fuzzy Hashing Applications

7 páginas, 5 tablas, 2 algoritmos. Comunicación presentada en: The 2015 World Congress in Computer Science, Computer Engineering, and Applied Computing (WORLDCOMP'15). The 2015 International Conference on Security and Management (SAM'15), Las Vegas, USA, July 27 - 30Similarity preserving hashing applications, also known as fuzzy hashing functions, help to analyse the content of digital devices by performing a resemblance comparison between different files. In practice, the similarity matching procedure is a two-step process, where first a signature associated to the files under comparison is generated, and then a comparison of the signatures themselves is performed. Even though ssdeep is the best-known application in this field, the edit distance algorithm that ssdeep uses for performing the signature comparison is not well-suited for certain scenarios. In this contribution we present a new edit distance algorithm that better reflects the similarity of two strings, and that can be used by fuzzy hashing applications in order to improve their results.This work has been partially supported by Comunidad de Madrid (Spain) under the project S2013/ICE-3095-CM (CIBERDINE) and by Ministerio de Economía y Com- petitividad (Spain) under the grant TIN2014-55325-C2-1-R (ProCriCiS).Peer reviewe

Group signatures in practice

10 páginas, 2 figuras, 1 tabla. International Joint Conference. CISIS’15 and ICEUTE’15Group signature schemes allow a user to sign a message in an anonymous way on behalf of a group. In general, these schemes need the collaboration of a Key Generation Center or a Trusted Third Party, which can disclose the identity of the actual signer if necessary (for exam- ple, in order to settle a dispute). This paper presents the results obtained after implementing a group signature scheme using the Integer Factoriza- tion Problem and the Subgroup Discrete Logarithm Problem, which has allowed us to check the feasibility of the scheme when using big numbers.This work has been partially supported under the framework of the international cooperation program managed by National Research Foundation of Korea (NRF- 2013K2A1A2053670) and by Comunidad de Madrid (Spain) under the project S2013/ICE-3095-CM (CIBERDINE).Peer reviewe

A multisignature scheme based on the SDLP and on the IFP

8 páginasMultisignature schemes are digital signature schemes that permit one to determine a unique signature for a given message, depending on the signatures of all the members of a speci c group. In this work, we present a new semi-short multisignature scheme based on the Subgroup Discrete Logarithm Problem (SDLP) and on the Integer Factorization Problem (IFP). The scheme can be carried out in an on- and o -line basis, is efficient, and the bitlength of the multisignature does not depend on the number of signers.This work has been partially supported by the \Fundación Memoria D. Samuel Solórzano Barruso" under the Project FS/7-2010.Peer reviewe