Efficient Round-Optimal Secure Two-Party Computation from Sigma-protocol

In this paper, based on Σ-protocol on HC (a NP-complete language), we firstly construct a Σ-protocol for any NP language thm1 ∧ thm2, then transfer it into a non-interactive protocol from a hash function and a pseudo-random generator. Finally, we construct an efficient round-optimal secure two-party...

Full description

Saved in:
Bibliographic Details
Published in2010 International Conference on Communications and Mobile Computing Vol. 1; pp. 26 - 30
Main Authors Yonglong Tang, Chunming Tang
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.04.2010
Subjects
Online AccessGet full text
ISBN9781424463275
1424463270
DOI10.1109/CMC.2010.280

Cover

Abstract In this paper, based on Σ-protocol on HC (a NP-complete language), we firstly construct a Σ-protocol for any NP language thm1 ∧ thm2, then transfer it into a non-interactive protocol from a hash function and a pseudo-random generator. Finally, we construct an efficient round-optimal secure two-party computation protocol from our non-interactive protocols.
AbstractList In this paper, based on Σ-protocol on HC (a NP-complete language), we firstly construct a Σ-protocol for any NP language thm1 ∧ thm2, then transfer it into a non-interactive protocol from a hash function and a pseudo-random generator. Finally, we construct an efficient round-optimal secure two-party computation protocol from our non-interactive protocols.
Author Chunming Tang
Yonglong Tang
Author_xml – sequence: 1
  surname: Yonglong Tang
  fullname: Yonglong Tang
  email: tyltyls@163.com
  organization: Sch. of Inf. Adm. & Eng., Jishou Univ., Jishou, China
– sequence: 2
  surname: Chunming Tang
  fullname: Chunming Tang
  email: ctang@gzhu.edu.cn
  organization: Sch. of Math. & Inf. Sci., Guangzhou Univ., Guangzhou, China
BookMark eNp9jL2KwkAYRb9FBf_SbWczL5Ds_JpMHVxsRFntZYiTZZZkvjCZIL69KWxs9jSXw4WzhKlHbwE-Gc0Yo_qrPJQZp6Pxgn5AovOCSS7lVvCCT948VzNYckq1lkJv1RySvv-jI1JxLtQC9ru6dpWzPpIfHPwtPXbRtaYhZ1sNwZLLHdOTCfFBSmy7IZro0JM6YEvO7rc1aRcwYoXNGma1aXqbvHYFm-_dpdynzlp77cIYDY-rkjkThRb_v08a5UHt
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/CMC.2010.280
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISBN 9781424463282
1424463289
EndPage 30
ExternalDocumentID 5471389
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AAWTH
ADFMO
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
IEGSK
IERZE
OCL
RIE
RIL
ID FETCH-ieee_primary_54713893
IEDL.DBID RIE
ISBN 9781424463275
1424463270
IngestDate Wed Aug 27 02:24:44 EDT 2025
IsPeerReviewed false
IsScholarly false
LCCN 2009943965
Language English
LinkModel DirectLink
MergedId FETCHMERGED-ieee_primary_54713893
ParticipantIDs ieee_primary_5471389
PublicationCentury 2000
PublicationDate 2010-April
PublicationDateYYYYMMDD 2010-04-01
PublicationDate_xml – month: 04
  year: 2010
  text: 2010-April
PublicationDecade 2010
PublicationTitle 2010 International Conference on Communications and Mobile Computing
PublicationTitleAbbrev cmc
PublicationYear 2010
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000452235
Score 2.8737905
Snippet In this paper, based on Σ-protocol on HC (a NP-complete language), we firstly construct a Σ-protocol for any NP language thm1 ∧ thm2, then transfer it into a...
SourceID ieee
SourceType Publisher
StartPage 26
SubjectTerms Cost function
Cryptographic protocols
Cryptography
Information science
Information security
Laboratories
Mathematics
Mobile communication
Mobile computing
round-optimal secure two-party computation /sum-protocol
Secure computation
Title Efficient Round-Optimal Secure Two-Party Computation from Sigma-protocol
URI https://ieeexplore.ieee.org/document/5471389
Volume 1
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3PS8MwFH5sO-nFH5uoU8nBo-lYm2Sv57JRhOrQCbuNNs1EdK1oi-hfb35sVWQHb0kg4UFCvvDyfd8DuAxkqJiRn2EuUsryPKWhhl2KTErEJUMhjVA4uRHxA7ue83kLrhotjFLKks-UZ5r2Lz8vZW1SZQOub1INsG1oj1A4rVaTT7HW4AHfaLdE4I8aS6d1nzfE93AQJZHjdfnGEPJXYRWLK5M9SDYROTrJs1dXmSe__pg1_jfkfej9KPjItMGmA2ip4hB2k8aj9b0L8di6R-jp5M7UVqK3-vZYpS_EpuAVmX2UdKoP1idxlR_sFhIjRyH3T4-rlBqLh1Kfox70J-NZFFMT1-LV2Vcs1iEFR9ApykIdA0FfZWKImIlgyPT7L1ShUJhJ5D7ydClPoLtthdPtw33YcV_sht5yBp3qrVbnGrmr7MJu2TfKB5lF
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1dS8MwFL3M-aC--LGJOj_y4KPZWJvE9LlsVF3n0Ap7K22aieha0RbRX28-tiqyB9-SQMKFhJxwc865AOeu8CTR8jOesQSTLEuwp2AXcyIE5zPCmdBC4XDMggdyPaXTBlzUWhgppSGfya5umr_8rBCVTpX1qLpJFcCuwTolhFCr1qozKsYc3KVL9RZzncva1GnRpzX13ev5oW-ZXY62hPxVWsUgy3AbwmVMllDy3K3KtCu-_tg1_jfoHWj_aPjQpEanXWjIfA-2wtql9b0FwcD4R6jp6E5XV8K36v6YJy_IJOElij4KPFFH6xPZ2g9mE5EWpKD7p8d5grXJQ6FOUhs6w0HkB1jHFb9aA4t4EZK7D828yOUBIO7IlPU5T5nbJ-oF6EmPSZ4KTh1Ok5k4hNaqFY5WD5_BRhCFo3h0Nb7pwKb9cNdkl2Nolm-VPFE4XqanZvu-AQQsnJI
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2010+International+Conference+on+Communications+and+Mobile+Computing&rft.atitle=Efficient+Round-Optimal+Secure+Two-Party+Computation+from+Sigma-protocol&rft.au=Yonglong+Tang&rft.au=Chunming+Tang&rft.date=2010-04-01&rft.pub=IEEE&rft.isbn=9781424463275&rft.volume=1&rft.spage=26&rft.epage=30&rft_id=info:doi/10.1109%2FCMC.2010.280&rft.externalDocID=5471389
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781424463275/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781424463275/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781424463275/sc.gif&client=summon&freeimage=true