Friday, July 25, 2008

Friday, July 25, 2008 — 3:30 PM to 4:30 PM EDT

One-More Discrete Logarithm Problems

Speaker: Alfred Menezes Affiliation: University of Waterloo Room: Mathematics & Computer Building (MC) 5158

Abstract:

There are many issues that arise in interpreting reductionist proofs of security of cryptographic protocols. I will consider the case of security proofs that rely on the hardness of non-standard one-more discrete logarithm and Diffie-Hellman problems.

S M T W T F S
29
30
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
  1. 2023 (144)
    1. December (4)
    2. November (17)
    3. October (14)
    4. September (10)
    5. August (7)
    6. July (19)
    7. June (21)
    8. May (12)
    9. April (5)
    10. March (17)
    11. February (10)
    12. January (8)
  2. 2022 (150)
    1. December (8)
    2. November (18)
    3. October (15)
    4. September (11)
    5. August (2)
    6. July (17)
    7. June (17)
    8. May (10)
    9. April (12)
    10. March (18)
    11. February (10)
    12. January (13)
  3. 2021 (103)
  4. 2020 (119)
  5. 2019 (167)
  6. 2018 (136)
  7. 2017 (103)
  8. 2016 (137)
  9. 2015 (136)
  10. 2014 (88)
  11. 2013 (48)
  12. 2012 (39)
  13. 2011 (36)
  14. 2010 (40)
  15. 2009 (40)
  16. 2008 (39)
    1. December (1)
    2. November (4)
    3. October (5)
    4. September (4)
    5. August (2)
    6. July (4)
    7. June (4)
    8. May (4)
    9. April (2)
    10. March (3)
    11. February (3)
    12. January (3)
  17. 2007 (15)