Una breve introducción a la Seguridad Demostrable (A Brief Introduction to Provable Security)

Sandra Díaz Santiago (sdiazsa@ipn.mx)1, Gina Gallegos García (ggallegosg@ipn.mx)2, Lil María Rodríguez Henríquez (lilmaria@cic.ipn.mx)3, Nareli Cruz Cortes (nareli@cic.ipn.mx)4

1Escuela Superior de Cómputo, Instituto Politécnico Nacional
2Escuela Superior de Ingeniería Mecánica y Eléctrica, Unidad Culhuacan, Instituto Politécnico Nacional
3CINVESTAV y CIC-Instituto Politécnico Nacional
4Centro de Investigación en Computación, Instituto Politécnico Nacional

This paper appears in: Revista IEEE América Latina

Publication Date: May 2016
Volume: 14,   Issue: 5 
ISSN: 1548-0992

A recurring question when we design a cryptographic scheme is how to determine its security level. The provable security is a technique that can help to answer this question. In this paper we present a friendly introduction of this technique by analyzing a cryptographic scheme in the private-key setting, also we briefly discuss some alternatives to provable security, and finally we point out some open problems and possible research directions.

Index Terms:
provable security, random oracle model, pseudorandom functions, chosen plaintext attack   

Documents that cite this document
This function is not implemented yet.

[PDF Full-Text (408)]