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
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
Online AccessGet full text
ISBN9781424463275
1424463270
DOI10.1109/CMC.2010.280

Cover

More Information
Summary: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.
ISBN:9781424463275
1424463270
DOI:10.1109/CMC.2010.280