Cryptography in the Multi-string Model
- 744 Downloads
The common random string model introduced by Blum, Feldman, and Micali permits the construction of cryptographic protocols that are provably impossible to realize in the standard model. We can think of this model as a trusted party generating a random string and giving it to all parties in the protocol. However, the introduction of such a third party should set alarm bells going off: Who is this trusted party? Why should we trust that the string is random? Even if the string is uniformly random, how do we know it does not leak private information to the trusted party? The very point of doing cryptography in the first place is to prevent us from trusting the wrong people with our secrets.
In this paper, we propose the more realistic multi-string model. Instead of having one trusted authority, we have several authorities that generate random strings. We do not trust any single authority; we only assume a majority of them generate random strings honestly. Our results also hold even if different subsets of these strings are used in different instances, as long as a majority of the strings used at any particular invocation is honestly generated. This security model is reasonable and at the same time very easy to implement. We could for instance imagine random strings being provided on the Internet, and any set of parties that want to execute a protocol just need to agree on which authorities’ strings they want to use.
We demonstrate the use of the multi-string model in several fundamental cryptographic tasks. We define multi-string non-interactive zero-knowledge proofs and prove that they exist under general cryptographic assumptions. Our multi-string NIZK proofs have very strong security properties such as simulation-extractability and extraction zero-knowledge, which makes it possible to compose them with arbitrary other protocols and to reuse the random strings. We also build efficient simulation-sound multi-string NIZK proofs for circuit satisfiability based on groups with a bilinear map. The sizes of these proofs match the best constructions in the single common random string model.
We also suggest a universally composable commitment scheme in the multi-string model. It has been proven that UC commitment does not exist in the plain model without setup assumptions. Prior to this work, constructions were only known in the common reference string model and the registered public key model. The UC commitment scheme can be used in a simple coin-flipping protocol to create a uniform random string, which in turn enables the secure realization of any multi-party computation protocol.
Key wordsCommon random string model Multi-string model Non-interactive zero-knowledge Universally composable commitment Multi-party computation
We thank Silvio Micali and Eyal Kushilevitz for an inspiring discussion in February 2004 that motivated us to explore this setting.
- B. Barak, R. Pass, On the possibility of one-message weak zero-knowledge, in TCC. Lecture Notes in Computer Science, vol. 2951 (2004), pp. 121–132 Google Scholar
- B. Barak, R. Canetti, J.B. Nielsen, R. Pass, Universally composable protocols with relaxed set-up assumptions, in FOCS (2004), pp. 186–195 Google Scholar
- D. Beaver, Server-assisted cryptography, in Workshop on New Security Paradigms (1998), pp. 92–106 Google Scholar
- M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation, in STOC (1988), pp. 1–10 Google Scholar
- M. Blum, P. Feldman, S. Micali, Non-interactive zero-knowledge and its applications, in STOC (1988), pp. 103–112 Google Scholar
- D. Boneh, X. Boyen, H. Shacham, Short group signatures, in CRYPTO. Lecture Notes in Computer Science, vol. 3152 (2004), pp. 41–55 Google Scholar
- R. Canetti, Universally composable security: a new paradigm for cryptographic protocols, in FOCS (2001), pp. 136–145 Google Scholar
- R. Canetti, M. Fischlin, Universally composable commitments, in CRYPTO. Lecture Notes in Computer Science, vol. 2139 (2001), pp. 19–40 Google Scholar
- R. Canetti, U. Feige, O. Goldreich, M. Naor, Adaptively secure multi-party computation, in STOC (1996), pp. 639–648 Google Scholar
- R. Canetti, Y. Lindell, R. Ostrovsky, A. Sahai, Universally composable two-party and multi-party secure computation, in STOC (2002), pp. 494–503 Google Scholar
- R. Canetti, Y. Dodis, R. Pass, S. Walfish, Universally composable security with pre-existing setup, in TCC. Lecture Notes in Computer Science, vol. 4392 (2007), pp. 61–85 Google Scholar
- D. Chaum, C. Crépeau, I. Damgård, Multiparty unconditionally secure protocols (extended abstract), in STOC (1988), pp. 11–19 Google Scholar
- R. Cramer, V. Shoup, Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack, in CRYPTO. Lecture Notes in Computer Science, vol. 1462 (1998), pp. 13–25 Google Scholar
- I. Damgård, Non-interactive circuit based proofs and non-interactive perfect zero-knowledge with preprocessing, in EUROCRYPT. Lecture Notes in Computer Science, vol. 658 (1992), pp. 341–355 Google Scholar
- I. Damgård, J.B. Nielsen, Improved non-committing encryption schemes based on a general complexity assumption, in CRYPTO. Lecture Notes in Computer Science, vol. 1880 (2000), pp. 432–450 Google Scholar
- I. Damgård, J.B. Nielsen, Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor, in CRYPTO. Lecture Notes in Computer Science, vol. 2442 (2002), pp. 581–596 Google Scholar
- A. De Santis, G. Persiano, Zero-knowledge proofs of knowledge without interaction, in FOCS (1992), pp. 427–436 Google Scholar
- A. De Santis, G. Di Crescenzo, G. Persiano, Non-interactive zero-knowledge: a low-randomness characterization of NP, in ICALP. Lecture Notes in Computer Science, vol. 1644 (1999), pp. 271–280 Google Scholar
- A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano, A. Sahai, Robust non-interactive zero knowledge, in CRYPTO. Lecture Notes in Computer Science, vol. 2139 (2002), pp. 566–598 Google Scholar
- A. De Santis, G. Di Crescenzo, G. Persiano, Randomness-optimal characterization of two NP proof systems, in RANDOM. Lecture Notes in Computer Science, vol. 2483 (2002), pp. 179–193 Google Scholar
- G. Di Crescenzo, Y. Ishai, R. Ostrovsky, Non-interactive and non-malleable commitment, in STOC (1998), pp. 141–150 Google Scholar
- S. Garg, V. Goyal, A. Jain, A. Sahai, Bringing people of different beliefs together to do UC, in TCC. Lecture Notes in Computer Science, vol. 6597 (2011), pp. 311–328 Google Scholar
- O. Goldreich, L.A. Levin, A hard-core predicate for all one-way functions, in STOC (1989), pp. 25–32 Google Scholar
- O. Goldreich, S. Micali, A. Wigderson, How to play ANY mental game, or A completeness theorem for protocols with honest majority, in STOC (1987), pp. 218–229 Google Scholar
- V. Goyal, J. Katz, Universally composable multi-party computation with an unreliable common reference string, in TCC. Lecture Notes in Computer Science, vol. 4948 (2008), pp. 142–154 Google Scholar
- J. Groth, Simulation-sound NIZK proofs for a practical language and constant size group signatures, in ASIACRYPT. Lecture Notes in Computer Science, vol. 4248 (2006), pp. 444–459 Google Scholar
- J. Groth, R. Ostrovsky, Cryptography in the multi-string model, in CRYPTO. Lecture Notes in Computer Science, vol. 4622 (2007), pp. 323–341 Google Scholar
- P.D. MacKenzie, K. Yang, On simulation-sound trapdoor commitments, in EUROCRYPT. Lecture Notes in Computer Science, vol. 3027 (2004), pp. 382–400 Google Scholar
- R. Ostrovsky, One-way functions, hard on average problems, and statistical zero-knowledge proofs, in Structure in Complexity Theory Conference (1991), pp. 133–138 Google Scholar
- R. Ostrovsky, A. Wigderson, One-way functions are essential for non-trivial zero-knowledge, in ISTCS (1993), pp. 3–17 Google Scholar