BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen - ECPv5.7.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
X-ORIGINAL-URL:https://www.greyc.fr
X-WR-CALDESC:évènements pour GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20230326T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20231029T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20230912T100000
DTEND;TZID=Europe/Paris:20230912T110000
DTSTAMP:20260423T041034
CREATED:20230911T082936Z
LAST-MODIFIED:20230911T082936Z
UID:11241-1694512800-1694516400@www.greyc.fr
SUMMARY:Séminaire Algorithmique : Ana Maria Costache (NTNU\, Trondheim\, Norvège) « FHE Circuit Privacy for Free »
DESCRIPTION:Circuit privacy is an important notion in Fully Homomorphic Encryption (FHE)\, well-illustrated by the Machine Learning-as-a-Service scenario. A scheme is circuit private if an adversary cannot learn the circuit evaluated on a ciphertext from the computation result. In this talk\, we show that the FHE scheme BGV is computationally circuit private in a semi-honest context. \nIn more detail\, we first introduce the notions of FHE and the BGV scheme. Then\, we define computational circuit privacy and argue why this definition is strong enough for our purpose. We then show that BGV naturally fulfills this definition and\, furthermore\, that if the adversary is assumed to have the secret key\, it may learn information about the circuit even if the scheme is proven to be circuit private. We therefore\, propose a new definition of computational circuit privacy to capture this as well. We prove that through modulus switching ciphertexts in strategic places\, we can achieve this new definition without the need for any additional expensive machinery. \nJoint work with Lea Nürnberger and Tjerand Silde.
URL:https://www.greyc.fr/event/seminaire-algorithmique-ana-maria-costache-ntnu-trondheim-norvege-fhe-circuit-privacy-for-free/
LOCATION:Sciences 3- S3 351
CATEGORIES:General,News,Séminaire Algo
END:VEVENT
END:VCALENDAR