Monday, May 12, 2014

Monday, May 12, 2014 — 2:30 PM to 3:30 PM EDT

Omar Fawzi, McGill University

The goal of two-party cryptography is to enable Alice and Bob to solve tasks in cooperation even if they do not trust each other. Examples of such tasks include bit commitment, coin flipping and oblivious transfer. Unfortunately, it has been shown that even using quantum communication, none of these tasks can be implemented when the adversary is completely general.

S M T W T F S
27
28
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. 2021 (45)
    1. November (2)
    2. October (5)
    3. September (3)
    4. August (4)
    5. July (4)
    6. June (5)
    7. May (3)
    8. April (4)
    9. March (5)
    10. February (4)
    11. January (6)
  2. 2020 (31)
    1. December (2)
    2. November (5)
    3. October (4)
    4. September (3)
    5. August (2)
    6. June (4)
    7. April (1)
    8. March (3)
    9. February (5)
    10. January (2)
  3. 2019 (139)
  4. 2018 (142)
  5. 2017 (131)
  6. 2016 (88)
  7. 2015 (82)
  8. 2014 (94)
    1. December (5)
    2. November (4)
    3. October (13)
    4. September (8)
    5. August (4)
    6. July (9)
    7. June (11)
    8. May (7)
    9. April (12)
    10. March (10)
    11. February (7)
    12. January (5)
  9. 2013 (91)
  10. 2012 (122)
  11. 2011 (117)
  12. 2010 (41)
  13. 2009 (4)
  14. 2008 (1)
  15. 2005 (1)
  16. 2004 (3)