Article

Concurrent general composition of secure protocols in the timing model

Authors:

Yael Tauman Kalai,

Yehuda Lindell,

Manoj PrabhakaranAuthors Info & Claims

STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

Pages 644 - 653

https://doi.org/10.1145/1060590.1060687

Published: 22 May 2005 Publication History

Abstract

In the setting of secure multiparty computation, a set of mutually distrustful parties wish to jointly compute some function of their input (i.e., they wish to securely carry out some distributed task). %The joint computation should be such that even In the stand-alone case, it has been shown that every efficient function can be securely computed. However, in the setting of concurrent composition, broad impossibility results have been proven for the case where there is no honest majority (or trusted setup).In this paper, we investigate the feasibility of obtaining secure multiparty protocols in a network where certain time bounds are assumed. Specifically, the security of our protocols rely on the very reasonable assumption that local clocks do not "drift" too much (i.e., it is assumed that they proceed at approximately the same rate). We show that under this mild timing assumption, it is possible to securely compute any functionality under concurrent general composition (as long as messages from the arbitrary other protocols are delayed for a specified amount of time).

References

[1]

B. Barak, Y. Lindell and S. Vadhan. Lower Bounds for Non-Black-Box Zero-Knowledge. In 44th FOCS, pages 384--393, 2003.]]

Digital Library

[2]

M. Ben-Or, S. Goldwasser and A. Wigderson. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In 20th STOC, pages 1--10, 1988.]]

Digital Library

[3]

Coin Flipping by Phone. IEEE Spring COMPCOM, pages 133--137, 1982.]]

[4]

R. Canetti. Security and Composition of Multiparty Cryptographic Protocols. Journal of Cryptology, 13(1):143--202, 2000.]]

Digital Library

[5]

R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In 42nd FOCS, pages 136--145, 2001.]]

Digital Library

[6]

R. Canetti and M. Fischlin. Universally Composable Commitments. In CRYPTO 2001, Springer-Verlag (LNCS 2139), pages 19--40, 2001.]]

Digital Library

[7]

R. Canetti, E. Kushilevitz and Y. Lindell. On the Limitations of Universal Composable Two-Party Computation Without Set-Up Assumptions. In EUROCRYPT'03, Springer-Verlag (LNCS 2656), pages 68--86, 2003.]]

Digital Library

[8]

R. Canetti, Y. Lindell, R. Ostrovsky and A. Sahai. Universally Composable Two-Party and Multi-Party Computation. In 34th STOC, pages 494--503, 2002.]]

Digital Library

[9]

D. Chaum, C. Crepeau and I. Damgard. Multi-party Unconditionally Secure Protocols. In 20th STOC, pages 11--19, 1988.]]

Digital Library

[10]

B. Chor and M. Rabin. Achieving Independence in Logarithmic Number of Rounds. In 6th PODC, pages 260--268, 1987.]]

Digital Library

[11]

D. Dolev, C. Dwork and M. Naor. Non-Malleable Cryptography. SIAM Journal on Computing, 30(2):391--437, 2000.]]

Digital Library

[12]

C. Dwork, M. Naor, and A. Sahai. Concurrent Zero-Knowledge. Journal of the ACM, 51(6):851--898, 2004.]]

Digital Library

[13]

C. Dwork and M. Naor. Zaps and Their Applications. In 41st FOCS, pages 283--293, 2000.]]

Digital Library

[14]

C. Dwork and A. Sahai. Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints. In CRYPTO'98, Springer-Verlag (LNCS 1462), pages 442--457, 1998.]]

Digital Library

[15]

U. Feige and A. Shamir. Zero-Knowledge Proofs of Knowledge in Two Rounds. In CRYPTO'89, Springer-Verlag (LNCS 435), pages 526--544, 1989.]]

Digital Library

[16]

U. Feige and A. Shamir. Witness Indistinguishability and Witness Hiding Protocols. In 22nd STOC, pages 416--426, 1990.]]

Digital Library

[17]

O. Goldreich. Foundations of Cryptography: Volume 1 -- Basic Tools. Cambridge University Press, 2001.]]

Digital Library

[18]

O. Goldreich. Foundations of Cryptography: Volume 2 -- Basic Applications. Cambridge University Press, 2004.]]

Digital Library

[19]

O. Goldreich. Concurrent Zero-Knowledge With Timing Revisited. In 34th STOC, pages 332--340, 2002.]]

Digital Library

[20]

O. Goldreich, S. Micali and A. Wigderson. How to Play any Mental Game -- A Completeness Theorem for Protocols with Honest Majority. In 19th STOC, pages 218--229, 1987.]]

Digital Library

[21]

S. Goldwasser and Y. Lindell. Secure Computation Without Agreement. In 16th DISC, Springer-Verlag (LNCS 2508), pages 17--32 2002.]]

Digital Library

[22]

S. Goldwasser, S. Micali and C. Rackoff The Knowledge Complexity of Interactive Proof Systems. SIAM Journal on Computing, 18(1):186--208, 1989.]]

Digital Library

[23]

Y. Kalai, Y. Lindell and M. Prabhakharan. Concurrent General Composition of Secure Protocols in the Timing Model (full version). Cryptology ePrint Archive, report 2005/036.]]

Digital Library

[24]

J. Katz. Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications. In EUROCRYPT 2003, Springer-Verlag (LNCS 2656), pages 211--228, 2003.]]

Digital Library

[25]

Y. Lindell. Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. Journal of Cryptology, 16(3):143--184, 2003.]]

[26]

Y. Lindell. Bounded-Concurrent Secure Two-Party Computation Without Setup Assumptions. In 35th STOC, pages 683--692, 2003.]]

Digital Library

[27]

Y. Lindell. General Composition and Universal Composability in Secure Multi-Party Computation. In 44th FOCS, pages 394--403, 2003.]]

Digital Library

[28]

Y. Lindell. Lower Bounds for Concurrent Self Composition. In the 1st Theory of Cryptography Conference (TCC), Springer-Verlag (LNCS 2951), pages 203--222, 2004.]]

[29]

M. Naor. Bit Commitment using Pseudorandom Generators. Journal of Cryptology, 4(2):151--158, 1991.]]

Digital Library

[30]

R. Pass. Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition. In Eurocrypt 2003, Springer-Verlag (LNCS 2656), pages 160--176, 2003.]]

Digital Library

[31]

R. Pass. Bounded-Concurrent Secure Multi-Party Computation with a Dishonest Majority. In the 36th STOC, pages 232--241, 2004.]]

Digital Library

[32]

R. Pass and A. Rosen Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds. In 44th FOCS, pages 404--413, 2003.]]

Digital Library

[33]

B. Pfitzmann and M. Waidner. Composition and Integrity Preservation of Secure Reactive Systems. In 7th ACM Conference on Computer and Communication Security, pages 245--254, 2000.]]

Digital Library

[34]

M. Prabhakaran and A. Sahai. New Notions of Security: Universal Composability Without Trusted Setup. In 36th STOC, pages 242--251, 2004.]]

Digital Library

[35]

R. Richardson and J. Kilian. On the Concurrent Composition of Zero-Knowledge Proofs. In EUROCRYPT'99, Springer-Verlag (LNCS 1592), pages 415--431, 1999.]]

Digital Library

[36]

A. Yao. How to Generate and Exchange Secrets. In 27th FOCS, pages 162--167, 1986.]]

Digital Library

Cited By

Chan BPass R(2023)Simplex Consensus: A Simple and Fast Consensus ProtocolTheory of Cryptography10.1007/978-3-031-48624-1_17(452-479)Online publication date: 27-Nov-2023
https://doi.org/10.1007/978-3-031-48624-1_17
Broadnax BMechler JMüller-Quade J(2021)Environmentally Friendly Composable Multi-party Computation in the Plain Model from Standard (Timed) AssumptionsTheory of Cryptography10.1007/978-3-030-90459-3_25(750-781)Online publication date: 4-Nov-2021
https://doi.org/10.1007/978-3-030-90459-3_25
Baum CDavid BDowsley RNielsen JOechsner S(2021)TARDIS: A Foundation of Time-Lock Puzzles in UCAdvances in Cryptology – EUROCRYPT 202110.1007/978-3-030-77883-5_15(429-459)Online publication date: 16-Jun-2021
https://doi.org/10.1007/978-3-030-77883-5_15
Show More Cited By

Index Terms

Concurrent general composition of secure protocols in the timing model
1. Theory of computation
  1. Models of computation
    1. Interactive computation

Recommendations

Optimizing Semi-Honest Secure Multiparty Computation for the Internet
CCS '16: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security

In the setting of secure multiparty computation, a set of parties with private inputs wish to compute some function of their inputs without revealing anything but their output. Over the last decade, the efficiency of secure two-party computation has ...
Unconditionally secure disjointness tests for private datasets

We present two unconditional secure protocols for private set disjointness tests. In order to provide intuition of our protocols, we give a naive example that applies Sylvester matrices. Unfortunately, this simple construction is insecure as it reveals ...
Bounded-concurrent secure two-party computation without setup assumptions
STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

In this paper we study the feasibility of obtaining protocols for general two-party computation that remain secure under concurrent composition. (A general protocol can be used for obtaining secure computation of any functionality.) We consider a ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

May 2005

778 pages

ISBN:1581139608

DOI:10.1145/1060590

General Chair:
Hal Gabow
University of Colorado
,
Program Chair:
Ronald Fagin
IBM Almaden Research Center

Copyright © 2005 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 May 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

STOC05

Sponsor:

STOC05: Symposium on Theory of Computing

May 22 - 24, 2005

MD, Baltimore, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

25
Total Citations
View Citations
314
Total Downloads

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

Reflects downloads up to 10 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Chan BPass R(2023)Simplex Consensus: A Simple and Fast Consensus ProtocolTheory of Cryptography10.1007/978-3-031-48624-1_17(452-479)Online publication date: 27-Nov-2023
https://doi.org/10.1007/978-3-031-48624-1_17
Broadnax BMechler JMüller-Quade J(2021)Environmentally Friendly Composable Multi-party Computation in the Plain Model from Standard (Timed) AssumptionsTheory of Cryptography10.1007/978-3-030-90459-3_25(750-781)Online publication date: 4-Nov-2021
https://doi.org/10.1007/978-3-030-90459-3_25
Baum CDavid BDowsley RNielsen JOechsner S(2021)TARDIS: A Foundation of Time-Lock Puzzles in UCAdvances in Cryptology – EUROCRYPT 202110.1007/978-3-030-77883-5_15(429-459)Online publication date: 16-Jun-2021
https://doi.org/10.1007/978-3-030-77883-5_15
Canetti R(2020)Universally Composable SecurityJournal of the ACM10.1145/340245767:5(1-94)Online publication date: 16-Sep-2020
https://dl.acm.org/doi/10.1145/3402457
Liu-Zhang CMaurer U(2020)Synchronous Constructive CryptographyTheory of Cryptography10.1007/978-3-030-64378-2_16(439-472)Online publication date: 9-Dec-2020
https://doi.org/10.1007/978-3-030-64378-2_16
Choudhuri AGoyal VJain A(2019)Founding Secure Computation on BlockchainsAdvances in Cryptology – EUROCRYPT 201910.1007/978-3-030-17656-3_13(351-380)Online publication date: 24-Apr-2019
https://doi.org/10.1007/978-3-030-17656-3_13
Canetti RHogan KMalhotra AVaria M(2017)A Universally Composable Treatment of Network Time2017 IEEE 30th Computer Security Foundations Symposium (CSF)10.1109/CSF.2017.38(360-375)Online publication date: Aug-2017
https://doi.org/10.1109/CSF.2017.38
Achenbach DMüller-Quade JRill J(2016)Synchronous Universally Composable Computer NetworksCryptography and Information Security in the Balkans10.1007/978-3-319-29172-7_7(95-111)Online publication date: 9-Jan-2016
https://doi.org/10.1007/978-3-319-29172-7_7
Boureanu IVaudenay S(2013)Input-Aware Equivocable Commitments and UC-secure Commitments with Atomic ExchangesProceedings of the 7th International Conference on Provable Security - Volume 820910.1007/978-3-642-41227-1_7(121-138)Online publication date: 23-Oct-2013
https://dl.acm.org/doi/10.1007/978-3-642-41227-1_7
Ostrovsky RScafuro AVisconti IWadia A(2013)Universally Composable Secure Computation with (Malicious) Physically Uncloneable FunctionsAdvances in Cryptology – EUROCRYPT 201310.1007/978-3-642-38348-9_41(702-718)Online publication date: 2013
https://doi.org/10.1007/978-3-642-38348-9_41
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents