by Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakaran
In Proc. 37th STOC
http://eprint.iacr.org/2005/036.ps.gz
Add To MetaCart
Abstract:
In the setting of secure multiparty computation, a set of parties wish to 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 if some of the parties maliciously collude and attack the other parties, certain security properties like privacy and correctness are preserved. Recently, broad impossibility results have been proven that show that unless an honest majority or trusted setup phase are assumed, it is impossible to obtain protocols that remain secure under concurrent composition (where many protocol executions take place simultaneously). These results hold both for the case of general composition (where a secure protocol is run many times concurrently with arbitrary other protocols) and self composition (where a single secure protocol is run many times concurrently). One approach for bypassing these impossibility results is to consider more limited settings of concurrency that still realistically model real-world networks. 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 multi-party functionality under concurrent general composition (as long as messages from the arbitrary other protocols are delayed for a specified amount of time).
Citations
|
693
|
The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract
– Goldwasser, Micali, et al.
- 1985
|
|
468
|
Completeness theorems for non-cryptographic fault-tolerant distributed computation
– Ben-Or, Goldwasser, et al.
- 1988
|
|
355
|
Nonmalleable cryptography
– Dolev, Dwork, et al.
|
|
328
|
A “HOW to Play Any Mental Game or A Completeness Theorem for Protocols with Honest Majority
– Goldreich, Micali, et al.
- 1987
|
|
306
|
Universally composable security: A new paradigm for cryptographic protocols
– Canetti
- 2001
|
|
304
|
Multiparty unconditionally secure protocols
– Chaum, Crépeau, et al.
- 1988
|
|
304
|
How to generate and exchange secrets
– Yao
- 1986
|
|
261
|
Security and Composition of Multiparty Cryptographic Protocols
– Canetti
- 2000
|
|
132
|
Witness indistinguishable and witness hiding protocols
– Feige, Shamir
|
|
122
|
Concurrent zero-knowledge
– Dwork, Naor, et al.
- 1998
|
|
113
|
How to go beyond the black-box simulation barrier
– Barak
- 2001
|
|
112
|
Foundations of Secure Interactive Computing
– Beaver
|
|
102
|
On defining proofs of knowledge
– Bellare, Goldreich
|
|
95
|
Composition and integrity preservation of secure reactive systems
– Pfitzmann, Waidner
- 2000
|
|
88
|
Universally composable commitments
– Canetti, Fischlin
- 2001
|
|
79
|
Zero knowledge proofs of knowledge in two rounds
– Feige, Shamir
|
|
77
|
On the concurrent composition of zero-knowledge proofs
– Richardson, Kilian
- 1999
|
|
73
|
Fair Computation of General Functions
– Goldwasser, Levin
- 1990
|
|
70
|
Universally composable two-party and multi-party secure computation
– Canetti, Lindell, et al.
- 2002
|
|
61
|
to Prove a Theorem So No One Else Can Claim It
– Blum, How
- 1986
|
|
53
|
Foundations of Cryptography – Volume 2: Basic Applications
– Goldreich
- 2004
|
|
52
|
A.Sahai: Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints
– Dwork
|
|
50
|
Foundations of Cryptography – Volume 1: Basic Tools
– Goldreich
- 2001
|
|
50
|
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
– Lindell
- 1977
|
|
44
|
On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions
– Canetti, Kushilevitz, et al.
- 2003
|
|
40
|
Secure Computation”, unpublished manuscript
– Micali, Rogaway
- 1992
|
|
40
|
Coin Flipping by Phone
– Blum
- 1982
|
|
39
|
Bit Commitment using Pseudorandom Generators
– Naor
- 1991
|
|
29
|
Secure computation without agreement
– Goldwasser, Lindell
- 2002
|
|
28
|
Zaps and Their Applications
– Dwork, Naor
|
|
27
|
Bounded-Concurrent Secure Two-Party Computation Without Setup Assumptions
– Lindell
- 2003
|
|
27
|
General Composition and Universal Composability in Secure Multi-Party Computation
– Lindell
- 2003
|
|
25
|
Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds
– Pass, Rosen
- 2003
|
|
24
|
Bounded-Concurrent Secure Multi-Party Computation with a Dishonest Majority
– Pass
- 2004
|
|
23
|
Lower Bounds for Concurrent Self Composition
– Lindell
- 2004
|
|
21
|
Achieving independence in a logarithmic number of rounds
– Chor, Rabin
- 1987
|
|
20
|
Simulation in Quasi-polynomial Time and its Application to Protocol Composition
– Pass
- 2003
|
|
19
|
Efficient and Non-Malleable Proofs of Plaintext Knowledge and Applications
– Katz
- 2003
|
|
18
|
Concurrent Zero-Knowledge With Timing Revisited
– Goldreich
- 2002
|
|
16
|
Lower Bounds for Non-Black-Box ZeroKnowledge
– Barak, Lindell, et al.
|
|
5
|
New Notions of Security: Universal Composability Without Trusted Setup
– Prabhakaran, Sahai
- 2004
|
