## T-79.515 Cryptography: Special Topics (2-6 cr)## Spring 2002: Pairing-based CryptographyPrevious years: [Spring 2002]
[Course Description]
[General Information]
[Seminars]
[Other Interesting Stuff]
[TOPI]
This is a graduate-level (although motivated undergraduate students are
welcome) seminar on Simply put, pairing is an efficiently computable bilinear mapping. If a pairing exists
on some algebraic structure, the ## General Information-
**Seminars**lead by Prof. Helger Lipmaa: Tuesday 16-18, room/hall TB353.**First seminar: 14.01.2003.** -
**Course material**: Menezes's tutorial (copies of slides). Original research papers (see ``The Pairing-Based Crypto Lounge'' by Paulo Barreto). - In order
**to pass the course**one has to- do at least one seminar presentation
- be an opponent of at least one presentation by others
To graduate, every student must submit his or her survey timely, give a good presentation, be able to answer to the discussions, and be a constructive and friendly opponent (In particular, propose a fair grade for the presenter). The purpose of review and feedback is to improve the quality of the work. Grading will also based on the participation during discussion providing constructive feedback to others. -
**Newsgroup**: none
## Course OrganizationDuring most of the seminars, one student will present an about 60 minutes long presentation and a written survey of 5-7 pages on some subject, followed by short discussions, so that every seminar will take approximately 90 minutes. Survey and presentation slides will be made available on the web. The survey must be available to the tutor one week before the presentation. (The only possible exception is the first presenter.) Every student also gets an opponent, who will given the survey before the presentation. The opponent has, for the presentation, to prepare a 2-2.5 page resumé (that should be made available to the presenter and to the responsible teacher two days before the presentation; the resumé will also be made available on the web), and lead discussions with the presenter. If necessary, the presenter must revise his or her survey, based on these remarks, within one week; the revised version will then be put on the web. Back to menu. ## Seminar notes(Presentations and short overviews; reviews --- all by students) Both surveys and reviews are expected to be typeset in LaTeX, using the standard fonts and fontsizes. Please submit both the LaTeX source file and a .pdf or .ps version. For formatting your survey please use this survey by Petteri Kaski (from seminar in 2001) as an example. - Seminar 1: Bilinear Pairings (Sven Laur, slides, 28.01.03) Opponent: Johan Wallén (review)
- Seminar 2: Short Signature Schemes (Johan Wallén, slides 04.02.03) Opponent: Tatiana Issaeva (review)
- ID-Based Cryptography (Tatiana Issaeva, slides, 11.02.03) Opponent: Alexey Vyskubov (review)
- ID-Based Signatures (Alexey Vyskubov, slides, 18.02.03) Opponent: Sven Laur (review)
- Aggregate Signatures (Tatiana Issaeva, slides, 18.03.03) Opponent: Johan Wallén (review)
- Some ID-PKC signcryption schemes (Lauri Tarkkala, slides, 25.03.03) Opponent: Sven Laur (review)
- Weil Pairings (Alexey Vyskubov, slides, 01.04.03) Opponent: ?
- Tate Pairings (Sven Laur, slides, 15.04.03) Opponent: ?
## Other Interesting StuffBack to menu. -->[TCS main] [Contact Info] [Personnel] [Research] [Publications] [Software] [Studies] [News Archive] [Links] Latest update: 22 January 2007. |