| Document Date: 2014-06-18 07:33:20
Open Document File Size: 493,80 KBShare Result on Facebook
City Lausanne / / Country Switzerland / Italy / Israel / / / Facility Bar-Ilan University / Sapienza University of Rome / / IndustryTerm external server / subset sum algorithm / malicious server / generic solutions / round optimal protocols / cloud server / delegatable computing / cloud computing services / text search / probabilistic polynomial-time algorithms / simpler keyword search problem / search engines / external untrusted server / cryptographic algorithms / mobile broadband internet connections / search functionalities / search queries / knowledge protocols / search query / cloud computing / weak devices / semi-honest server / keyword search / / Organization University of Rome / Bar-Ilan University / Faculty of Engineering / Computer Science Department / / Person Semi-Honest Adversaries / Note / Daniele Venturi‡ June / Sebastian Faust∗ Carmit Hazay / / / Position Senator / / Technology encryption / subset sum algorithm / broadband / using searchable encryption / secure two-party protocol / PPT algorithm / separated protocol / 2 Algorithms / non-committing encryptions / LLL algorithm / Smartphone technology / probabilistic polynomial-time algorithms / secret key / simulation / Searchable/Non-Committing encryption / cryptographic algorithms / knowledge protocols / mobile devices / /
SocialTag |
An extended abstract of this paper is published in the proceedings of the 40th International Colloquium on Automata, Languages and Programming—ICALPThis is the full version. Outsourced Pattern Matching Sebastian