BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69ce94b9c7424
DTSTART;TZID=America/Toronto:20250912T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250912T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-roman-langrehr
SUMMARY:Tutte Colloquium - Roman Langrehr
CLASS:PUBLIC
DESCRIPTION:TITLE: On the Black-Box Complexity of Private-Key Inner-Produc
 t\nFunctional Encryption\n\nSPEAKER:\n Roman Langrehr\n\nAFFILIATION:\n Un
 iversity of Waterloo\n\nLOCATION:\n MC 5501\n\nABSTRACT: Traditional encr
 yption (secret key and public key\nencryption) has a very limited function
 ality. Namely\, it allows\nencryption of data for a single recipient that 
 can recover the entire\ndata. This is typically sufficient for transmittin
 g data over insecure\nchannels\, but insufficient for many modern applicat
 ions\, like\nend-to-end encrypted cloud storage\, where partial access to 
 the data\nmight be needed.\n\nFunctional encryption (FE) is a cryptographi
 c primitive that can solve\nthis challenge by allowing to generate customi
 zed secret keys that are\nassociated with a function f. Decrypting with su
 ch a secret key will\nreveal only f(m)\, where m is the encrypted message\
 , and reveal nothing\nelse about m. One of the most well studied variants 
 of FE is\ninner-product functional encryption (IPFE)\, where the functions
  f are\nrestricted to linear functions.\n\nAll known instantiations of IPF
 E\, even of its secret-key version\,\nrequire strong assumptions typically
  used for public-key encryption.\nIn this talk I will give an insight on w
 hy this is the case: An\nimpossibility result for black-box constructions 
 of IPFE from\nsecret-key assumptions (like one-way functions).\n\nThe core
  of our proof is based on a new result of extremal\ncombinatorics\, which 
 we proof based on Fourier analysis or the\nCauchy-Schwartz inequality.\n\n
 The talk will first introduce the cryptographic background and give an\nov
 erview about the cryptographic part of the proof. Then\, the\ncombinatoria
 l problem we encountered and our solution will be\ndiscussed in more detai
 l. The talk will not require any prior\nknowledge in cryptography.\n\nThe 
 full version of the paper presented can be found here:\nhttps://eprint.iac
 r.org/2024/1877
DTSTAMP:20260402T160929Z
END:VEVENT
END:VCALENDAR