Provably Secure Cryptosystems from Pairings
By Xavier Boyen.
At the 3rd YACC biennial cryptography workshop, Ile de Porquerolles, France, June 2006.
This presentation revolves around the theme of ``provable security meets real-world practicality'', and is particularly interested in pairing-based cryptographic constructions that remain practical without the random oracle heuristic. After reviewing some basic notions related to pairings, we will study a few concrete examples of provably secure yet practical constructions that use them. Our examples will include a variety of signatures schemes, zero-knowledge proof techniques, and applications of identity-based encryption.
- presentation slides (HTML)
Unless indicated otherwise, these documents are Copyright © Xavier Boyen; all rights reserved in all countries.
Back to Xavier's homepage