On the Composition of Two-Prover Commitments, and Applications to Multi-round Relativistic Commitments
We consider the related notions of two-prover and of relativistic commitment schemes. In recent work, Lunghi et al. proposed a new relativistic commitment scheme with a multi-round sustain phase that keeps the binding property alive as long as the sustain phase is running. They prove security of their scheme against classical attacks; however, the proven bound on the error parameter is very weak: it blows up double exponentially in the number of rounds.
In this work, we give a new analysis of the multi-round scheme of Lunghi et al., and we show a linear growth of the error parameter instead (also considering classical attacks only). Our analysis is based on a new composition theorem for two-prover commitment schemes. The proof of our composition theorem is based on a better understanding of the binding property of two-prover commitments that we provide in the form of new definitions and relations among them. As an additional consequence of these new insights, our analysis is actually with respect to a strictly stronger notion of security than considered by Lunghi et al.
We would like to thank Jędrzej Kaniewski for helpful discussions regarding , and for commenting on an earlier version of our work.
- 1.Bavarian, M., Shor, P.W.: Information Causality, Szemerédi-Trotter and Algebraic Variants of CHSH. In: Roughgarden, T. (ed.) ITCS 2015, pp. 123–132. ACM (2015)Google Scholar
- 2.Ben-Or, M., Goldwasser, S., Kilian, J., Wigderson, A.: Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions. In: Simon, J. (ed.) STOC 1988, pp. 113–131. ACM (1988)Google Scholar
- 3.Chakraborty, K., Chailloux, A., Leverrier, A : Arbitrarily Long Relativistic Bit Commitment. ArXiv e-prints (2015). http://arxiv.org/abs/1507.00239