時間

7/06(四)     13:30-15:30

地點

I633

演講者

賴添煌 教授

題目

A Brief Story of Computing on Private Data

摘要

Abstract:  This talk consists of two parts.  The first part is an introduction to a recent breakthrough in cryptography --- Craig Gentry’s fully homomorphic encryption (FHE) --- which is interesting, inspiring, and considered by many as a holy grail of cryptography.  FHE enables clouds to process users private data in an encrypted form (under a single key).  The second part of this talk is a result of ours.  We show that it is possible to convert any single-key FHE scheme into a multi-key (or even multi-scheme) FHE scheme.  Such schemes allow clouds to process data that are encrypted under different keys or even different encryption schemes.  For example, consider the well-known Yao’s millionaires problem.  Suppose two numbers x and y are encrypted as cx and cy by different schemes (and/or under different keys).  We can decide if x < y by directly processing the ciphertexts cx and cy without decrypting them.  This talk is accessible (I hope) to those without much background in cryptography.