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 the random string honestly. We demonstrate the use of this model for two fundamental cryptographic taks. We define non-interactive zero-knowledge in the multi-string model and construct NIZK proofs in the multi-string model. We also consider multi-party computation and show that any functionality can be securely realized in the multi-string model.
Category / Keywords: foundations / Common random string model, multi-string model, non-interactive zero-knowledge, multi-party computation Date: received 12 Nov 2006 Contact author: jg at cs ucla edu Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation Version: 20061113:110151 (All versions of this report) Short URL: ia.cr/2006/407 Discussion forum: Show discussion | Start new discussion