Secure two-party computation with low communication

Ivan Damgård; Sebastian Faust; Carmit Hazay

doi:10.1007/978-3-642-28914-9_4

Secure two-party computation with low communication

Ivan Damgård, Sebastian Faust, Carmit Hazay

Aarhus University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

67 Scopus citations

Abstract

We propose a 2-party UC-secure protocol that can compute any function securely. The protocol requires only two messages, communication that is poly-logarithmic in the size of the circuit description of the function, and the workload for one of the parties is also only poly-logarithmic in the size of the circuit. This implies, for instance, delegatable computation that requires no expensive off-line phase and remains secure even if the server learns whether the client accepts its results. To achieve this, we define two new notions of extractable hash functions, propose an instantiation based on the knowledge of exponent in an RSA group, and build succinct zero-knowledge arguments in the CRS model.

Original language	English
Title of host publication	Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, Proceedings
Pages	54-74
Number of pages	21
DOIs	https://doi.org/10.1007/978-3-642-28914-9_4
State	Published - 2012
Externally published	Yes
Event	9th Theory of Cryptography Conference, TCC 2012 - Taormina, Sicily, Italy Duration: 19 Mar 2012 → 21 Mar 2012

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7194 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	9th Theory of Cryptography Conference, TCC 2012
Country/Territory	Italy
City	Taormina, Sicily
Period	19/03/12 → 21/03/12

Bibliographical note

Funding Information:
The authors acknowledge support from the Danish National Research Foundation and The National Science Foundation of China (under the grant 61061130540) for the Sino-Danish Center for the Theory of Interactive Computation, within part of this work was performed; and from the CFEM research center, supported by the Danish Strategic Research Council.

Funding

The authors acknowledge support from the Danish National Research Foundation and The National Science Foundation of China (under the grant 61061130540) for the Sino-Danish Center for the Theory of Interactive Computation, within part of this work was performed; and from the CFEM research center, supported by the Danish Strategic Research Council.

Funders	Funder number
CFEM
Sino-Danish Center for the Theory of Interactive Computation
Strategiske Forskningsråd
Danmarks Grundforskningsfond
National Natural Science Foundation of China	61061130540

Access to Document

10.1007/978-3-642-28914-9_4

Cite this

Damgård, I., Faust, S., & Hazay, C. (2012). Secure two-party computation with low communication. In Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, Proceedings (pp. 54-74). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7194 LNCS). https://doi.org/10.1007/978-3-642-28914-9_4

@inproceedings{6a211a83a06b472b8cd2d2f71317536a,

title = "Secure two-party computation with low communication",

abstract = "We propose a 2-party UC-secure protocol that can compute any function securely. The protocol requires only two messages, communication that is poly-logarithmic in the size of the circuit description of the function, and the workload for one of the parties is also only poly-logarithmic in the size of the circuit. This implies, for instance, delegatable computation that requires no expensive off-line phase and remains secure even if the server learns whether the client accepts its results. To achieve this, we define two new notions of extractable hash functions, propose an instantiation based on the knowledge of exponent in an RSA group, and build succinct zero-knowledge arguments in the CRS model.",

author = "Ivan Damg{\aa}rd and Sebastian Faust and Carmit Hazay",

note = "Funding Information: The authors acknowledge support from the Danish National Research Foundation and The National Science Foundation of China (under the grant 61061130540) for the Sino-Danish Center for the Theory of Interactive Computation, within part of this work was performed; and from the CFEM research center, supported by the Danish Strategic Research Council.; 9th Theory of Cryptography Conference, TCC 2012 ; Conference date: 19-03-2012 Through 21-03-2012",

year = "2012",

doi = "10.1007/978-3-642-28914-9_4",

language = "אנגלית",

isbn = "9783642289132",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "54--74",

booktitle = "Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, Proceedings",

}

Damgård, I, Faust, S & Hazay, C 2012, Secure two-party computation with low communication. in Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7194 LNCS, pp. 54-74, 9th Theory of Cryptography Conference, TCC 2012, Taormina, Sicily, Italy, 19/03/12. https://doi.org/10.1007/978-3-642-28914-9_4

Secure two-party computation with low communication. / Damgård, Ivan; Faust, Sebastian; Hazay, Carmit.
Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, Proceedings. 2012. p. 54-74 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7194 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Secure two-party computation with low communication

AU - Damgård, Ivan

AU - Faust, Sebastian

AU - Hazay, Carmit

N1 - Funding Information: The authors acknowledge support from the Danish National Research Foundation and The National Science Foundation of China (under the grant 61061130540) for the Sino-Danish Center for the Theory of Interactive Computation, within part of this work was performed; and from the CFEM research center, supported by the Danish Strategic Research Council.

PY - 2012

Y1 - 2012

N2 - We propose a 2-party UC-secure protocol that can compute any function securely. The protocol requires only two messages, communication that is poly-logarithmic in the size of the circuit description of the function, and the workload for one of the parties is also only poly-logarithmic in the size of the circuit. This implies, for instance, delegatable computation that requires no expensive off-line phase and remains secure even if the server learns whether the client accepts its results. To achieve this, we define two new notions of extractable hash functions, propose an instantiation based on the knowledge of exponent in an RSA group, and build succinct zero-knowledge arguments in the CRS model.

AB - We propose a 2-party UC-secure protocol that can compute any function securely. The protocol requires only two messages, communication that is poly-logarithmic in the size of the circuit description of the function, and the workload for one of the parties is also only poly-logarithmic in the size of the circuit. This implies, for instance, delegatable computation that requires no expensive off-line phase and remains secure even if the server learns whether the client accepts its results. To achieve this, we define two new notions of extractable hash functions, propose an instantiation based on the knowledge of exponent in an RSA group, and build succinct zero-knowledge arguments in the CRS model.

UR - http://www.scopus.com/inward/record.url?scp=84858313411&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-28914-9_4

DO - 10.1007/978-3-642-28914-9_4

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84858313411

SN - 9783642289132

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 54

EP - 74

BT - Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, Proceedings

T2 - 9th Theory of Cryptography Conference, TCC 2012

Y2 - 19 March 2012 through 21 March 2012

ER -

Secure two-party computation with low communication

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this