BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//הפקולטה למדעי המחשב והמידע - ECPv6.15.15//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://cis.haifa.ac.il
X-WR-CALDESC:Events for הפקולטה למדעי המחשב והמידע
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Jerusalem
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:IDT
DTSTART:20250328T000000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:IST
DTSTART:20251025T230000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:IDT
DTSTART:20260327T000000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:IST
DTSTART:20261024T230000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:IDT
DTSTART:20270326T000000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:IST
DTSTART:20271030T230000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Jerusalem:20260105T110000
DTEND;TZID=Asia/Jerusalem:20260105T120000
DTSTAMP:20260417T144642
CREATED:20260105T063751Z
LAST-MODIFIED:20260105T063751Z
UID:5029-1767610800-1767614400@cis.haifa.ac.il
SUMMARY:Tamer Mour (Bocconi University) - Computing on Encrypted Data; Extremely Fast and Simple
DESCRIPTION:Title: Computing on Encrypted Data; Extremely Fast and Simple \n\nAbstract: \nConsider the following setting for computing on private data. A client uploads an encryption of a big input X to an untrusted server\, and then wishes to make an unbounded number of queries f(X) while hiding f and X from the server and using only its secret key. How efficiently can this be done?\nI will present a new framework for achieving the above for two useful special cases:\n1- Data access (secret-key private information retrieval; sk-PIR)\, where X is a database and f(X)=X[i] for a secret index i.\n2- Linear computations (encrypted matrix-vector product; EMVP)\, where X is a matrix and f(X)=Xv for a secret vector v.\nOur framework yields extremely practical solutions\, often approaching the concrete efficiency of cleartext computation across relevant metrics (down to a x1.25 overhead). This is enabled by a non-traditional approach to cryptographic design that prioritizes real-world considerations and from which new sources of hardness emerge.\nIn addition\, we obtain new feasibility results for sk-PIR and EMVP based on the standard Learning Parity with Noise assumption (LPN)\, in a parameter regime not known to imply public-key encryption. \nBased on joint works with Fabrice Benhamouda\, Caicai Chen\, Yuval Ishai\, Shai Halevi\, Hugo Krawczyk\, Tal Rabin and Alon Rosen.
URL:https://cis.haifa.ac.il/event/cs-seminar-computing-on-encrypted-data/
CATEGORIES:סמינרים מדעי המחשב
END:VEVENT
END:VCALENDAR