Fast Two-Output Secure Computation with Optimal Error Probability

Cut-and-choose paradigm makes Yao’s protocol for two-party computation secure in malicious model with an error probability.In CRYPTO 2013,based on multi-phase cut-and-choose,Lindell reduced this probability to the optimal value.However,this work can only compute single-output functions with optimal...

Full description

Saved in:
Bibliographic Details
Published in:电子学报：英文版 2017 (5), p.933-941
Main Author: ZHAO Chuan JIANG Han XU Qiuliang WANG Yilei WEI Xiaochao CUI Shujie
Format: Article
Language:English
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 941
container_issue 5
container_start_page 933
container_title 电子学报：英文版
container_volume
creator ZHAO Chuan JIANG Han XU Qiuliang WANG Yilei WEI Xiaochao CUI Shujie
description Cut-and-choose paradigm makes Yao’s protocol for two-party computation secure in malicious model with an error probability.In CRYPTO 2013,based on multi-phase cut-and-choose,Lindell reduced this probability to the optimal value.However,this work can only compute single-output functions with optimal error probability.We transform multi-phase cut-and-choose for singleoutput case into one that can deal with two-output functions,meanwhile maintaining the optimal error probability.Based on this new paradigm,we propose an efficient two-output secure computation protocol.Besides,by utilizing the specific property of the output garbled keys,we solve the authenticity issue of the generator’s output with only symmetric cryptographic operations linear in the output length of the generator,which is the most efficient method so far in standard model without Random oracle(RO).
format article
fullrecord <record><control><sourceid>chongqing</sourceid><recordid>TN_cdi_chongqing_primary_69689088504849554853484855</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cqvip_id>69689088504849554853484855</cqvip_id><sourcerecordid>69689088504849554853484855</sourcerecordid><originalsourceid>FETCH-chongqing_primary_696890885048495548534848553</originalsourceid><addsrcrecordid>eNqdizEKgzAUQDO0UGm9Qy4gxCY_jWMRpZuFuksUqwE1Nvki3r4OPUGn997wDiSI2fUaCQn8RELvTc0g5vIGkgfknmuPtFxtVCw4L0hfbbO4lqZ23EujsRNdDfa0mNGMeqCZc9bRp7O1rs1gcLuQ41sPvg1_PBOeZ2X6iJreTt3HTF01u311WyUTqRKmFDChRAIgFPDdFAD_7_oCC6dAZA</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Fast Two-Output Secure Computation with Optimal Error Probability</title><source>IET Digital Library - eJournals</source><source>IEEE Xplore All Journals</source><creator>ZHAO Chuan JIANG Han XU Qiuliang WANG Yilei WEI Xiaochao CUI Shujie</creator><creatorcontrib>ZHAO Chuan JIANG Han XU Qiuliang WANG Yilei WEI Xiaochao CUI Shujie</creatorcontrib><description>Cut-and-choose paradigm makes Yao’s protocol for two-party computation secure in malicious model with an error probability.In CRYPTO 2013,based on multi-phase cut-and-choose,Lindell reduced this probability to the optimal value.However,this work can only compute single-output functions with optimal error probability.We transform multi-phase cut-and-choose for singleoutput case into one that can deal with two-output functions,meanwhile maintaining the optimal error probability.Based on this new paradigm,we propose an efficient two-output secure computation protocol.Besides,by utilizing the specific property of the output garbled keys,we solve the authenticity issue of the generator’s output with only symmetric cryptographic operations linear in the output length of the generator,which is the most efficient method so far in standard model without Random oracle(RO).</description><identifier>ISSN: 1022-4653</identifier><language>eng</language><ispartof>电子学报：英文版, 2017 (5), p.933-941</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttp://image.cqvip.com/vip1000/qk/86774X/86774X.jpg</thumbnail><link.rule.ids>314,776,780,4010</link.rule.ids></links><search><creatorcontrib>ZHAO Chuan JIANG Han XU Qiuliang WANG Yilei WEI Xiaochao CUI Shujie</creatorcontrib><title>Fast Two-Output Secure Computation with Optimal Error Probability</title><title>电子学报：英文版</title><addtitle>Chinese Journal of Electronics</addtitle><description>Cut-and-choose paradigm makes Yao’s protocol for two-party computation secure in malicious model with an error probability.In CRYPTO 2013,based on multi-phase cut-and-choose,Lindell reduced this probability to the optimal value.However,this work can only compute single-output functions with optimal error probability.We transform multi-phase cut-and-choose for singleoutput case into one that can deal with two-output functions,meanwhile maintaining the optimal error probability.Based on this new paradigm,we propose an efficient two-output secure computation protocol.Besides,by utilizing the specific property of the output garbled keys,we solve the authenticity issue of the generator’s output with only symmetric cryptographic operations linear in the output length of the generator,which is the most efficient method so far in standard model without Random oracle(RO).</description><issn>1022-4653</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><recordid>eNqdizEKgzAUQDO0UGm9Qy4gxCY_jWMRpZuFuksUqwE1Nvki3r4OPUGn997wDiSI2fUaCQn8RELvTc0g5vIGkgfknmuPtFxtVCw4L0hfbbO4lqZ23EujsRNdDfa0mNGMeqCZc9bRp7O1rs1gcLuQ41sPvg1_PBOeZ2X6iJreTt3HTF01u311WyUTqRKmFDChRAIgFPDdFAD_7_oCC6dAZA</recordid><startdate>2017</startdate><enddate>2017</enddate><creator>ZHAO Chuan JIANG Han XU Qiuliang WANG Yilei WEI Xiaochao CUI Shujie</creator><scope>2RA</scope><scope>92L</scope><scope>CQIGP</scope><scope>~WA</scope></search><sort><creationdate>2017</creationdate><title>Fast Two-Output Secure Computation with Optimal Error Probability</title><author>ZHAO Chuan JIANG Han XU Qiuliang WANG Yilei WEI Xiaochao CUI Shujie</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-chongqing_primary_696890885048495548534848553</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>ZHAO Chuan JIANG Han XU Qiuliang WANG Yilei WEI Xiaochao CUI Shujie</creatorcontrib><collection>中文科技期刊数据库</collection><collection>中文科技期刊数据库-CALIS站点</collection><collection>维普中文期刊数据库</collection><collection>中文科技期刊数据库- 镜像站点</collection><jtitle>电子学报：英文版</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>ZHAO Chuan JIANG Han XU Qiuliang WANG Yilei WEI Xiaochao CUI Shujie</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Fast Two-Output Secure Computation with Optimal Error Probability</atitle><jtitle>电子学报：英文版</jtitle><addtitle>Chinese Journal of Electronics</addtitle><date>2017</date><risdate>2017</risdate><issue>5</issue><spage>933</spage><epage>941</epage><pages>933-941</pages><issn>1022-4653</issn><abstract>Cut-and-choose paradigm makes Yao’s protocol for two-party computation secure in malicious model with an error probability.In CRYPTO 2013,based on multi-phase cut-and-choose,Lindell reduced this probability to the optimal value.However,this work can only compute single-output functions with optimal error probability.We transform multi-phase cut-and-choose for singleoutput case into one that can deal with two-output functions,meanwhile maintaining the optimal error probability.Based on this new paradigm,we propose an efficient two-output secure computation protocol.Besides,by utilizing the specific property of the output garbled keys,we solve the authenticity issue of the generator’s output with only symmetric cryptographic operations linear in the output length of the generator,which is the most efficient method so far in standard model without Random oracle(RO).</abstract></addata></record>
fulltext fulltext
identifier ISSN: 1022-4653
ispartof 电子学报：英文版, 2017 (5), p.933-941
issn 1022-4653
language eng
recordid cdi_chongqing_primary_69689088504849554853484855
source IET Digital Library - eJournals; IEEE Xplore All Journals
title Fast Two-Output Secure Computation with Optimal Error Probability
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-06T23%3A19%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-chongqing&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Fast%20Two-Output%20Secure%20Computation%20with%20Optimal%20Error%20Probability&rft.jtitle=%E7%94%B5%E5%AD%90%E5%AD%A6%E6%8A%A5%EF%BC%9A%E8%8B%B1%E6%96%87%E7%89%88&rft.au=ZHAO%20Chuan%20JIANG%20Han%20XU%20Qiuliang%20WANG%20Yilei%20WEI%20Xiaochao%20CUI%20Shujie&rft.date=2017&rft.issue=5&rft.spage=933&rft.epage=941&rft.pages=933-941&rft.issn=1022-4653&rft_id=info:doi/&rft_dat=%3Cchongqing%3E69689088504849554853484855%3C/chongqing%3E%3Cgrp_id%3Ecdi_FETCH-chongqing_primary_696890885048495548534848553%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_cqvip_id=69689088504849554853484855&rfr_iscdi=true