Article

LEGO for Two-Party Secure Computation

Authors:

Jesper Buus Nielsen,

Claudio OrlandiAuthors Info & Claims

TCC '09: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography

Pages 368 - 386

https://doi.org/10.1007/978-3-642-00457-5_22

Published: 20 February 2009 Publication History

Abstract

This paper continues the recent line of work of making Yao's garbled circuit approach to two-party computation secure against an active adversary. We propose a new cut-and-choose based approach called LEGO (Large Efficient Garbled-circuit Optimization): It is specifically aimed at large circuits. Asymptotically it obtains a factor $\log\vert\mathcal{C}\vert$ improvement in computation and communication over previous cut-and-choose based solutions, where $\vert\mathcal{C}\vert$ is the size of the circuit being computed. The protocol is universally composable (UC) in the OT-hybrid model against a static, active adversary.

References

[1]

Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity and a methodology of cryptographic protocol design (extended abstract). In: FOCS (1986).

Crossref

Google Scholar

[2]

Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145- 161. Springer, Heidelberg (2003).

Google Scholar

[3]

Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer - efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 572-591. Springer, Heidelberg (2008).

Crossref

Google Scholar

[4]

Jarecki, S., Shmatikov, V.: Efficient two-party secure computation on committed inputs. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 97-114. Springer, Heidelberg (2007).

Crossref

Google Scholar

[5]

Kolesnikov, V., Schneider, T.: Improved garbled circuit: Free XOR gates and applications. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 486-498. Springer, Heidelberg (2008).

Crossref

Google Scholar

[6]

Lindell, Y., Pinkas, B.: A proof of Yao's protocol for secure two-party computation. Electronic Colloquium on Computational Complexity (2004).

Google Scholar

[7]

Lindell, Y., Pinkas, B.: An efficient protocol for secure two-party computation in the presence of malicious adversaries. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 52-78. Springer, Heidelberg (2007).

Crossref

Google Scholar

[8]

Lindell, Y., Pinkas, B., Smart, N.P.: Implementing two-party computation efficiently with security against malicious adversaries. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol. 5229, pp. 2-20. Springer, Heidelberg (2008).

Crossref

Google Scholar

[9]

Mohassel, P., Franklin, M.K.: Efficiency tradeoffs for malicious two-party computation. In: Yung,M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol. 3958, pp. 458-473. Springer, Heidelberg (2006).

Crossref

Google Scholar

[10]

Naor, M., Nissim, K.: Communication preserving protocols for secure function evaluation. In: STOC (2001).

Crossref

Google Scholar

[11]

Nielsen, J.B., Orlandi, C.: Lego for two party secure computation. Cryptology ePrint Archive, Report 2008/427 (2008), http://eprint.iacr.org/

Google Scholar

[12]

Woodruff, D.P.: Revisiting the efficiency of malicious two-party computation. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 79-96. Springer, Heidelberg (2007).

Crossref

Google Scholar

[13]

Yao, A.C.: Protocols for secure computations (extended abstract). In: FOCS (1982).

Crossref

Google Scholar

[14]

Yao, A.C.: How to generate and exchange secrets (extended abstract). In: FOCS (1986).

Crossref

Google Scholar

Cited By

View all

Jin CYin Cvan Dijk MDuan SMassacci FReiter MZhang HLuo BLiao XXu JKirda ELie D(2024)PG: Byzantine Fault-Tolerant and Privacy-Preserving Sensor Fusion with Guaranteed Output DeliveryProceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security10.1145/3658644.3670343(3272-3286)Online publication date: 2-Dec-2024
https://dl.acm.org/doi/10.1145/3658644.3670343
Frederiksen TLindstrøm JMadsen MSpangsberg A(2024)A New Approach to Efficient and Secure Fixed-Point ComputationApplied Cryptography and Network Security10.1007/978-3-031-54770-6_3(58-87)Online publication date: 5-Mar-2024
https://dl.acm.org/doi/10.1007/978-3-031-54770-6_3
Baum CDittmer SScholl PWang X(2023)Sok: vector OLE-based zero-knowledge protocolsDesigns, Codes and Cryptography10.1007/s10623-023-01292-891:11(3527-3561)Online publication date: 1-Oct-2023
https://dl.acm.org/doi/10.1007/s10623-023-01292-8
Show More Cited By

Recommendations

Efficient Fair Secure Two-Party Computation
APSCC '12: Proceedings of the 2012 IEEE Asia-Pacific Services Computing Conference)

Yao first introduced a constant-round protocol for secure two-party computation (2PC) withstanding semi-honest adversaries by using a tool called """"garbled circuit"""". Later, many protocols based on garbled circuit approach have been presented, most ...
An efficient fair UC-secure protocol for two-party computation

With the development of modern Internet and mobile networks, there is an increasing need for collaborative privacy-preserving applications. Secure multi-party computation SMPC gives a general solution to these applications and has become a hot topic. ...
Complete fairness in secure two-party computation
STOC '08: Proceedings of the fortieth annual ACM symposium on Theory of computing

In the setting of secure two-party computation, two mutually distrusting parties wish to compute some function of their inputs while preserving, to the extent possible, various security properties such as privacy, correctness, and more. One desirable ...

Comments

Information & Contributors

Information

Published In

TCC '09: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography

February 2009

613 pages

ISBN:9783642004568

Editor:
Omer Reingold
Faculty of Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, Israel 76100

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 20 February 2009

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

49
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Jin CYin Cvan Dijk MDuan SMassacci FReiter MZhang HLuo BLiao XXu JKirda ELie D(2024)PG: Byzantine Fault-Tolerant and Privacy-Preserving Sensor Fusion with Guaranteed Output DeliveryProceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security10.1145/3658644.3670343(3272-3286)Online publication date: 2-Dec-2024
https://dl.acm.org/doi/10.1145/3658644.3670343
Frederiksen TLindstrøm JMadsen MSpangsberg A(2024)A New Approach to Efficient and Secure Fixed-Point ComputationApplied Cryptography and Network Security10.1007/978-3-031-54770-6_3(58-87)Online publication date: 5-Mar-2024
https://dl.acm.org/doi/10.1007/978-3-031-54770-6_3
Baum CDittmer SScholl PWang X(2023)Sok: vector OLE-based zero-knowledge protocolsDesigns, Codes and Cryptography10.1007/s10623-023-01292-891:11(3527-3561)Online publication date: 1-Oct-2023
https://dl.acm.org/doi/10.1007/s10623-023-01292-8
Blass EKerschbaum F(2022)Mixed-Technique Multi-Party Computations Composed of Two-Party ComputationsComputer Security – ESORICS 202210.1007/978-3-031-17143-7_15(295-319)Online publication date: 26-Sep-2022
https://dl.acm.org/doi/10.1007/978-3-031-17143-7_15
Green MKaptchuk GVan Laer G(2021)Abuse Resistant Law Enforcement Access SystemsAdvances in Cryptology – EUROCRYPT 202110.1007/978-3-030-77883-5_19(553-583)Online publication date: 17-Oct-2021
https://dl.acm.org/doi/10.1007/978-3-030-77883-5_19
Hazay CLilintal M(2020)Gradual GRAM and Secure Computation for RAM ProgramsSecurity and Cryptography for Networks10.1007/978-3-030-57990-6_12(233-252)Online publication date: 14-Sep-2020
https://dl.acm.org/doi/10.1007/978-3-030-57990-6_12
Hazay CVenkitasubramaniam MWeiss M(2020)The Price of Active Security in Cryptographic ProtocolsAdvances in Cryptology – EUROCRYPT 202010.1007/978-3-030-45724-2_7(184-215)Online publication date: 10-May-2020
https://dl.acm.org/doi/10.1007/978-3-030-45724-2_7
Hazay CShelat AVenkitasubramaniam M(2020)Going Beyond Dual Execution: MPC for Functions with Efficient VerificationPublic-Key Cryptography – PKC 202010.1007/978-3-030-45388-6_12(328-356)Online publication date: 4-May-2020
https://dl.acm.org/doi/10.1007/978-3-030-45388-6_12
Miao P(2020)Cut-and-Choose for Garbled RAMTopics in Cryptology – CT-RSA 202010.1007/978-3-030-40186-3_26(610-637)Online publication date: 24-Feb-2020
https://dl.acm.org/doi/10.1007/978-3-030-40186-3_26
Choi JButler K(2019)Secure Multiparty Computation and Trusted HardwareSecurity and Communication Networks10.1155/2019/13689052019Online publication date: 2-Apr-2019
https://dl.acm.org/doi/10.1155/2019/1368905
Show More Cited By

Abstract

References

Cited By

Recommendations

Efficient Fair Secure Two-Party Computation

An efficient fair UC-secure protocol for two-party computation

Complete fairness in secure two-party computation

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations