| Document Date: 2015-02-15 02:39:26
Open Document File Size: 529,88 KBShare Result on Facebook
Company ZN Online Comp. / Offline Comp / / / Event FDA Phase / / Facility Tel-Aviv University / M plant / University of Texas / / IndustryTerm online computational complexity / online time complexity / online computation / online output / quadratic online computation / Online Comm / verification algorithm / online computational overhead / decoder algorithm / online encoding / overall concrete online complexity / above protocol / online computations / minimal achievable online rate / computable online part / concrete applications / online communication complexity / even logarithmic online rate / online complexity / online computation complexity / software protection / online part / representative applications / secure protocol / Online Rate / constant online rate / similar protocols / correct protocol / online phase / computing / concrete online complexity / online communication / non-interactive solution / online key / linear online computation / online decoding / / Organization School of Electrical Engineering / Department of Computer Science / Tel-Aviv University / Technion / University of Texas / / Person Brent Waters¶ August / Benny Applebaum† Yuval Ishai / Bob / Ki / Alice / / Position representative / / Product REs / FKN94 / / ProvinceOrState Texas / / Technology computationally secure protocol / RAM / RE-based protocols / VC protocols / perfectly correct protocol / above protocol / two-message protocols / previous protocols / secret key / encryption / cryptography / Boolean Circuits Homomorphic Encryption / public key / FHE-based protocols / verification algorithm / decoder algorithm / FHE encryption / /
SocialTag |
Encoding Functions with Constant Online Rate or How to Compress Garbled Circuit Keys∗ Benny Applebaum† Yuval Ishai‡