Publication: Puzzles criptográficos : implementación y evaluación
Loading...
Identifiers
Publication date
2012-12
Defense date
2012-12-18
Authors
Advisors
Tutors
Journal Title
Journal ISSN
Volume Title
Publisher
Impact
Export
Abstract
En este Proyecto Fin de Carrera se implementan y evalúan diferentes aplicaciones de los protocolos de pruebas de esfuerzo, también conocidos como puzzles criptográficos, que se han propuesto hasta la fecha como solución a ataques como el spam, en redes peer-to-peer, redes vehiculares, e incluso en tecnología RFID (Radio Frecuency Identification). Para ello, se va a comprobar la viabilidad de algoritmos criptográficos tales como el TEA (Tiny Encryption Algorithm) y el AES (Advanced Encryption Standard) como base de las pruebas de esfuerzo computacional. En el escenario de los RFID, por ejemplo, los puzzles criptográficos implementados pretenden aliviar algunos de los problemas relacionados con la privacidad de la información almacenada en las etiquetas RFID. Los puzzles desarrollados otorgan mayor seguridad ya que en ningún momento la etiqueta transmitirá su identificador en claro. En su lugar, la etiqueta cifrará la suma XOR del identificador (ID) y el número aleatorio (n). A continuación se la enviará al lector junto con la función resumen del identificador, una parte de la clave de cifrado (ks), y el número aleatorio (n). Formando todo ello el puzzle criptográfico Puzzle=enck(ID (+) n), h(ID), ks, n. El lector deberá resolver este puzzle invirtiendo de esta manera tiempo y recursos computacionales para poder obtener el identificador de la etiqueta y acceder así a su información almacenada en base de datos. _______________________________________________________________________________________________________________________________
In this project, different applications of proof of work protocols are implemented, also known as cryptographic puzzles, which have been proposed to combat attacks like spam in peer-topeer networks, vehicular networks, and even in RFID technology (Radio Frequency Identification). In this regard, we focus on evaluating the feasibility of cryptographic algorithms such as TEA (Tiny Encryption Algorithm) and AES (Advanced Encryption Standard) as the basis for testing computational proofs of work protocol in resource-constraint scenarios. For example, assuming a RFID scenario, our cryptographic puzzles aim at alleviating some of the problems related to the privacy of the information stored in RFID tags. Moreover, our developed puzzle-based protocol provides security because of the tag will never transmit its identifier in clear. Instead, tags will encrypt the identifier (ID) XOR a nonce (n) using an encryption key (ks). Thus, it will be sent to the reader together with the hash of the identifier, a part of the encryption key (l-bits of ks), and the nonce (n). All these parts make the cryptographic puzzle: Puzzle=enck(ID (+) n), h(ID), ks, n Reader should solve this puzzle so investing time and computational resources in order to get tags’ identifiers and thereby gaining access to the information stored in the database.
In this project, different applications of proof of work protocols are implemented, also known as cryptographic puzzles, which have been proposed to combat attacks like spam in peer-topeer networks, vehicular networks, and even in RFID technology (Radio Frequency Identification). In this regard, we focus on evaluating the feasibility of cryptographic algorithms such as TEA (Tiny Encryption Algorithm) and AES (Advanced Encryption Standard) as the basis for testing computational proofs of work protocol in resource-constraint scenarios. For example, assuming a RFID scenario, our cryptographic puzzles aim at alleviating some of the problems related to the privacy of the information stored in RFID tags. Moreover, our developed puzzle-based protocol provides security because of the tag will never transmit its identifier in clear. Instead, tags will encrypt the identifier (ID) XOR a nonce (n) using an encryption key (ks). Thus, it will be sent to the reader together with the hash of the identifier, a part of the encryption key (l-bits of ks), and the nonce (n). All these parts make the cryptographic puzzle: Puzzle=enck(ID (+) n), h(ID), ks, n Reader should solve this puzzle so investing time and computational resources in order to get tags’ identifiers and thereby gaining access to the information stored in the database.
Description
Keywords
Criptografía, Puzzles criptográficos