Reusable garbled gates for new fully homomorphic encryption service

In this paper, we propose a novel way to provide a fully homomorphic encryption service, namely by using garbled circuits. From a high level perspective, garbled circuits and fully homomorphic encryption, both aim at implementing complex computation on ciphertexts. We define a new cryptographic prim...

Full description

Bibliographic Details
Authors: Wang, Xu An, Xhafa Xhafa, Fatos|||0000-0001-6569-5497, Ma, Jianfeng, Cao, Yunfei, Tang, Dianhua
Format: article
Publication Date:2017
Country:España
Institution:Universitat Politècnica de Catalunya (UPC)
Repository:UPCommons. Portal del coneixement obert de la UPC
Language:English
OAI Identifier:oai:upcommons.upc.edu:2117/104501
Online Access:https://hdl.handle.net/2117/104501
https://dx.doi.org/10.1504/IJWGS.2017.10002839
Access Level:Open access
Keyword:Data encryption (Computer science)
Fully homomorphic encryption service
Reusable garbled gate
Reusable garbled circuits service
Indistinguishable obfuscation
Xifratge (Informàtica)
Àrees temàtiques de la UPC::Informàtica::Seguretat informàtica
id ES_2838dad49066e7aebfc888d81da85e1e
oai_identifier_str oai:upcommons.upc.edu:2117/104501
network_acronym_str ES
network_name_str España
repository_id_str
spelling Reusable garbled gates for new fully homomorphic encryption serviceWang, Xu AnXhafa Xhafa, Fatos|||0000-0001-6569-5497Ma, JianfengCao, YunfeiTang, DianhuaData encryption (Computer science)Fully homomorphic encryption serviceReusable garbled gateReusable garbled circuits serviceIndistinguishable obfuscationXifratge (Informàtica)Àrees temàtiques de la UPC::Informàtica::Seguretat informàticaIn this paper, we propose a novel way to provide a fully homomorphic encryption service, namely by using garbled circuits. From a high level perspective, garbled circuits and fully homomorphic encryption, both aim at implementing complex computation on ciphertexts. We define a new cryptographic primitive named reusable garbled gate, which comes from the area of garbled circuits, then based on this new primitive we show that it is very easy to construct a fully homomorphic encryption. However, the instantiation of reusable garbled gates is rather difficult, in fact, we can only instantiate this new primitive based on indistinguishable obfuscation. Furthermore, reusable garbled gates can be a core component for constructing the reusable garbled circuits, which can reduce the communication complexity of them from O(n) to O(1). We believe that reusable garbled gates promise a new way to provide fully homomorphic encryption and reusable garbled circuits service fast.Peer Reviewed20172017-02-0620172017-05-16journal articlehttp://purl.org/coar/resource_type/c_6501AMhttp://purl.org/coar/version/c_ab4af688f83e57aainfo:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/2117/104501https://dx.doi.org/10.1504/IJWGS.2017.10002839reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/1045012026-05-27T15:37:01Z
dc.title.none.fl_str_mv Reusable garbled gates for new fully homomorphic encryption service
title Reusable garbled gates for new fully homomorphic encryption service
spellingShingle Reusable garbled gates for new fully homomorphic encryption service
Wang, Xu An
Data encryption (Computer science)
Fully homomorphic encryption service
Reusable garbled gate
Reusable garbled circuits service
Indistinguishable obfuscation
Xifratge (Informàtica)
Àrees temàtiques de la UPC::Informàtica::Seguretat informàtica
title_short Reusable garbled gates for new fully homomorphic encryption service
title_full Reusable garbled gates for new fully homomorphic encryption service
title_fullStr Reusable garbled gates for new fully homomorphic encryption service
title_full_unstemmed Reusable garbled gates for new fully homomorphic encryption service
title_sort Reusable garbled gates for new fully homomorphic encryption service
dc.creator.none.fl_str_mv Wang, Xu An
Xhafa Xhafa, Fatos|||0000-0001-6569-5497
Ma, Jianfeng
Cao, Yunfei
Tang, Dianhua
author Wang, Xu An
author_facet Wang, Xu An
Xhafa Xhafa, Fatos|||0000-0001-6569-5497
Ma, Jianfeng
Cao, Yunfei
Tang, Dianhua
author_role author
author2 Xhafa Xhafa, Fatos|||0000-0001-6569-5497
Ma, Jianfeng
Cao, Yunfei
Tang, Dianhua
author2_role author
author
author
author
dc.subject.none.fl_str_mv Data encryption (Computer science)
Fully homomorphic encryption service
Reusable garbled gate
Reusable garbled circuits service
Indistinguishable obfuscation
Xifratge (Informàtica)
Àrees temàtiques de la UPC::Informàtica::Seguretat informàtica
topic Data encryption (Computer science)
Fully homomorphic encryption service
Reusable garbled gate
Reusable garbled circuits service
Indistinguishable obfuscation
Xifratge (Informàtica)
Àrees temàtiques de la UPC::Informàtica::Seguretat informàtica
description In this paper, we propose a novel way to provide a fully homomorphic encryption service, namely by using garbled circuits. From a high level perspective, garbled circuits and fully homomorphic encryption, both aim at implementing complex computation on ciphertexts. We define a new cryptographic primitive named reusable garbled gate, which comes from the area of garbled circuits, then based on this new primitive we show that it is very easy to construct a fully homomorphic encryption. However, the instantiation of reusable garbled gates is rather difficult, in fact, we can only instantiate this new primitive based on indistinguishable obfuscation. Furthermore, reusable garbled gates can be a core component for constructing the reusable garbled circuits, which can reduce the communication complexity of them from O(n) to O(1). We believe that reusable garbled gates promise a new way to provide fully homomorphic encryption and reusable garbled circuits service fast.
publishDate 2017
dc.date.none.fl_str_mv 2017
2017-02-06
2017
2017-05-16
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
AM
http://purl.org/coar/version/c_ab4af688f83e57aa
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/104501
https://dx.doi.org/10.1504/IJWGS.2017.10002839
url https://hdl.handle.net/2117/104501
https://dx.doi.org/10.1504/IJWGS.2017.10002839
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869404932440850432
score 15.301629

Similar Items