Events by date

Tuesday, August 2, 2016

Tuesday, August 2, 2016 — 10:30 to 10:30 AM EDT

Satish Pandey, Department of Pure Mathematics, University of Waterloo

“Positive maps”

Tuesday, August 2, 2016 — 4:30 PM EDT

Ted Eaton, Combinatorics & Optimization, University of Waterloo


"The quantum random oracle model"

In cryptography, a common task is to reduce the problem of breaking an encryption or digital signature scheme to some underlying hard computational problem. This is similar to how complexity theorists reduce problems to one another to show that they are in the same complexity class.

These reductions can often be established more easily by considering different security models. A common model to employ is called the random oracle model.

S M T W T F S
31
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
3
  1. 2022 (7)
    1. January (7)
  2. 2021 (135)
    1. December (11)
    2. November (22)
    3. October (15)
    4. September (5)
    5. August (15)
    6. July (17)
    7. June (15)
    8. May (1)
    9. April (4)
    10. March (11)
    11. February (9)
    12. January (10)
  3. 2020 (103)
  4. 2019 (199)
  5. 2018 (212)
  6. 2017 (281)
  7. 2016 (335)
    1. December (8)
    2. November (41)
    3. October (35)
    4. September (29)
    5. August (8)
    6. July (17)
    7. June (30)
    8. May (15)
    9. April (12)
    10. March (56)
    11. February (42)
    12. January (42)
  8. 2015 (211)
  9. 2014 (235)
  10. 2013 (251)
  11. 2012 (135)