Bonn-Aachen International Center
for Information Technology





city life
cosec >students >Special events >crypt@b-it 2010 

crypt@b-it 2010


Preparatory material

Preparation sheet

The preparation sheet (PDF) contains exercises to basics of public-key cryptography, lattice-based cryptanalysis and pairing-based cryptography.  It is strongly recommended that you make yourself familiar with the concepts covered in the sheet. The lecturers will not repeat all the details of these basic principles.  Note that the exercises are meant for your personal control only, it's your responsibility.

If you have questions concerning the sheet, please feel free to discuss them among all participants via the mailing list .

Additional material pairing-based cryptography

Students should be familiar with basic concepts in public key cryptography, such as definitions and examples of public key encryption and signature schemes. It would also be helpful if students already have an appreciation of security proofs in cryptography. Finally, students should be aware of the Random Oracle Model and its use.

Once you are logged in with your cosec web account, you can access extra features.

During the talks, I will be covering material from the following papers (and more!):

  1. M. Bellare, P. Rogaway: Random oracles are practical: A paradigm for designing efficient protocols. In: Proc. of the First ACM Conference on Computer and Communications Security, pp. 62–73 (1993).
  2. S.D. Galbraith, K.G. Paterson and N.P. Smart, Pairings for Cryptographers. Discrete Applied Mathematics 156(2008), 3113-3121.
  3. A. Shamir. Identity-based cryptosystems and signature schemes. In CRYPTO'84, pages 47-53, 1984.
  4. D. Boneh and M.K. Franklin. Identity-based encryption from the Weil Pairing. In Joe Kilian, editor, CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 213{229. Springer, 2001.
  5. D. Boneh, H. Shacham, and B. Lynn. Short signatures from the Weil pairing. In C. Boyd, editor, Advances in Cryptology - ASIACRYPT 2001, volume 2248 of Lecture Notes in Computer Science, pages 514–532. Springer Verlag, 2001.
  6. D. Boneh, C. Gentry, B. Lynn, H. Shacham: Aggregate and Verifiably Encrypted Signatures from Bilinear Maps. EUROCRYPT 2003: 416-432
  7. B. Waters: Efficient identity-based encryption without random oracles. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 114–127.
  8. D. Boneh, X. Boyen: Short Signatures Without Random Oracles. EUROCRYPT 2004: 56-73
  9. R. Canetti, S. Halevi, and J. Katz. Chosen-ciphertext security from identity-based encryption. In Christian Cachin and Jan Camenisch, editors, EUROCRYPT 2004, volume 3027 of Lecture Notes in Computer Science, pages 207-222. Springer, 2004.
  10. S.S. Al-Riyami and K.G. Paterson: Certificateless public key cryptography. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 452–473. Springer, Heidelberg (2003)

Imprint, webmaster & more