{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T14:59:47Z","timestamp":1648997987163},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,6,5]],"date-time":"2014-06-05T00:00:00Z","timestamp":1401926400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s12652-014-0239-6","type":"journal-article","created":{"date-parts":[[2014,6,4]],"date-time":"2014-06-04T17:30:49Z","timestamp":1401903049000},"page":"549-555","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["How to build a faster private information retrieval protocol?"],"prefix":"10.1007","volume":"6","author":[{"given":"Wei","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Shuguang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Weidong","family":"Zhong","sequence":"additional","affiliation":[]},{"given":"Xiaoyuan","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,6,5]]},"reference":[{"key":"239_CR1","unstructured":"Bogdanov A, Lee C (2011) Homomorphic encryption from codes (2011). Arxiv preprint arXiv:1111.4301. 1, 9, 14"},{"key":"239_CR2","doi-asserted-by":"crossref","unstructured":"Boneh D, Goh EJ, Nissim K (2005) Evaluating 2-DNF formulas on ciphertexts. TCC 2005, LNCS 3378, pp 325\u2013341","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"239_CR3","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Vaikuntanathany V (2011a) Efficient fully homomorphic encryption from (Standard) LWE. In: Electronic Colloquium on Computational Complexity ECCC, vol. 18, pp 109\u2013138","DOI":"10.1109\/FOCS.2011.12"},{"key":"239_CR18","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Vaikuntanathan V (2011b) Fully homomorphic encryption from ring-LWE and security for key dependent messages. Advances in Cryptology-CRYPTO2011, pp 505\u2013524 (1, 9, 13)","DOI":"10.1007\/978-3-642-22792-9_29"},{"key":"239_CR4","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Gentry C, Vaikuntanathan V (2012) Fully homomorphic encryption without bootstrapping. ITCS, See also http:\/\/eprint.iacr.org\/2011\/277","DOI":"10.1145\/2090236.2090262"},{"key":"239_CR5","first-page":"402","volume":"1999","author":"C Cachin","year":"1999","unstructured":"Cachin C, Micali S, Stadler M (1999) Computationally private information retrieval with polylogarithmic communication. EUROCRYPT 1999:402\u2013444","journal-title":"EUROCRYPT"},{"key":"239_CR6","doi-asserted-by":"crossref","unstructured":"Chen X, Li J, Ma J, Tang Q, Lou W (2012a) New algorithms for secure outsourcing of modular exponentiations. ESORICS 2012, LNCS 7459, Springer, pp 541\u2013556","DOI":"10.1007\/978-3-642-33167-1_31"},{"issue":"6","key":"239_CR7","doi-asserted-by":"crossref","first-page":"1687","DOI":"10.1109\/TIFS.2012.2210880","volume":"7","author":"X Chen","year":"2012","unstructured":"Chen X, Li J, Susilo W (2012b) Efficient fair conditional payments for outsourcing computations. IEEE Trans Inf Forensics Secur 7(6):1687\u20131694","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"239_CR8","unstructured":"Dijk M, Gentry C, Halevi S, Vaikuntanathan V (2010) Fully homomorphic encryption over the integers. Advances in Cryptology-EUROCRYPT, pp 24\u201343"},{"key":"239_CR9","doi-asserted-by":"crossref","unstructured":"Gentry C (2009) Fully homomorphic encryption using ideal lattices. In: Proceedings of STOC, pp 169\u2013178","DOI":"10.1145\/1536414.1536440"},{"key":"239_CR10","doi-asserted-by":"crossref","unstructured":"Gentry C (2009) A fully homomorphic encryption scheme. PhD thesis, Stanford University","DOI":"10.1145\/1536414.1536440"},{"key":"239_CR11","unstructured":"Gentry C, Halevi S, Vaikuntanathan V (2010) A simple BGN-type cryptosystem from LEW. In Proceedings of EUROCRYPT\u201910, LNCS vol 6110. Springer, Heidelberg, pp 506\u2013522"},{"key":"239_CR12","unstructured":"Kushilevitz E, Ostrovsky R (1997) Replicationis not needed: single data base, computationally-private information retrieval. In: FOCS, pp 364\u2013373"},{"key":"239_CR13","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V, Peikert C, Regev O (2010) On ideal lattices and learning with errors over rings. Eurocryt, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques. pp 1\u201323","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"239_CR14","doi-asserted-by":"crossref","unstructured":"Regev O (2009) On lattices, learning with errors, random linear codes, and cryptography. J ACM 56(6):34, Preliminary version in STOC\u201905","DOI":"10.1145\/1568318.1568324"},{"key":"239_CR15","unstructured":"R\u00fcckert M, Schneider M (2010) Estimating the security of lattice-based cryptosystems. http:\/\/eprint.icur.org\/2010\/137.pdf"},{"key":"239_CR16","unstructured":"Smart NP, Vercauteren F (2010) Fully homomorphic encryption with relatively small key and ciphertext sizes. PKC 2010, LNCS 6056, pp 420\u2013443"},{"key":"239_CR17","doi-asserted-by":"crossref","unstructured":"Stehle D, Steinfeld R (2010) Faster fully homomorphic encryption. ASIACRYPT LNCS 6477, pp 377\u2013394","DOI":"10.1007\/978-3-642-17373-8_22"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-014-0239-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12652-014-0239-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-014-0239-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T04:04:51Z","timestamp":1565496291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12652-014-0239-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,5]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["239"],"URL":"https:\/\/doi.org\/10.1007\/s12652-014-0239-6","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"value":"1868-5137","type":"print"},{"value":"1868-5145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,5]]}}}