Abstract
This paper presents a non-interactive verifiable secret sharing scheme (VSS) tolerating a dishonest majority based on data predistributed by a trusted authority. As an application of this VSS scheme we present very efficient unconditionally secure multiparty protocols based on predistributed data which generalize two-party computations based on linear predistributed bit commitments. The main results of this paper are a non-interactive VSS where the amount of data which needs to be predistributed to each player depends on the number of tolerable cheaters only, a simplified multiplication protocol for shared values based on predistributed random products, a protocol for fair exchange of secrets based on predistributed data, and non-interactive zero knowledge proofs for arbitrary polynomial relations.
Chapter PDF
Similar content being viewed by others
References
Beaver, D., Goldwasser, S.: Multiparty Computation with Faulty Majority. In: Proc. of FOCS, pp. 468–473 (1989)
Beaver, D., Goldwasser, S.: Multiparty Computation with Faulty Majority. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 589–590. Springer, Heidelberg (1990)
Beaver, D.: Commodity-Based Cryptography. In: STOC 1997, pp. 446–455 (1997) (Extended Abstract)
Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non- Cryptographic Fault-Tolerant Distributed Computation. In: 20th STOC, pp. 1–10 (1988)
Blakely, G.: Safeguarding Cryptographic Keys. Proc. AFIPS 48, 313–317 (1979)
Blundo, C., Masucci, B., Stinson, D.R., Wei, R.: Constructions and Bounds for Unconditionally Secure Non-interactive Commitment Schemes (2001) (manuscript)
Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults. In: 26th IEEE Symp. on Foundations of Computer Science, pp. 383–395 (1985)
Chaum, D., Crepeau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: Proc. 20th ACM Symposium on the Theory of Computing (STOC), pp. 11–19 (1988) (extended abstract)
Cleve, R.: Controlled Gradual Disclosure Schemes for Random Bits and Their Applications. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 573–588. Springer, Heidelberg (1990)
Crepeau, C., van de Graaf, J., Tapp, A.: Committed Oblivious Transfer and Private multiparty Computations. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 110–123. Springer, Heidelberg (1995)
Cramer, R., Damgard, I., Dziembowski, S., Hirt, M., Rabin, T.: Efficient Multiparty Computations Secure Against an Adaptive Adversary. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 311–326. Springer, Heidelberg (1999)
Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: 28th IEEE Symp. on Foundations of Computer Science, pp. 427–437 (1987)
Goldwasser, S., Levin, L.A.: Fair Computation of General Functions in Presence of Immoral Majority. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 77–93. Springer, Heidelberg (1991)
Goldreich, O.: Secure multiparty Computation, lecture notes, available from http://www.wisdom.weizmann.ac.il/~oded/pp.html
Goldreich, O., Micali, S., Wigderson, A.: How to Play Any Mental Game or a Completeness Theorem for Protocols with Honest Majority. In: STOC 1987, pp. 218–229 (1987)
Hanaoka, G., Shikata, G.J., Zheng, Y.: Unconditionally Secure Digital Signature Schemes Admitting Transferability. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 130–142. Springer, Heidelberg (2000)
Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Trans. on Programming Languages and Systems 4(3), 382–401 (1982)
Matsumoto, T., Imai, H.: On the Key Pre-distribution Systems: A Practical Solution to the Key Distribution Problem. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 185–193. Springer, Heidelberg (1988)
Micali, S., Rogaway, P.: Secure Computation. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 392–404. Springer, Heidelberg (1992)
McEliece, R.J., Sarwate, D.V.: On sharing secrets and Reed-Solomon codes. Communications of the ACM 24, 583–584 (1981)
Nascimento, A., Mueller-Quade, J., Otsuka, A., Hanaoka, G., Imai, H.: Unconditionally Secure Homomorphic Pre-distributed Bit Commitment and Secure Two-Party Computations. In: ISC 2003 (2003)
Pedersen, T.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129–140. Springer, Heidelberg (1992)
Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proc. ACM STOC 1989, pp. 73–85. ACM Press, New York (1989)
Rivest, R.L.: Unconditionally secure commitment and oblivious transfer schemes using concealing channels and a trusted initializer (1999) (manuscript)
Shamir, A.: How to Share a Secret. Communications of the ACM 22, 612–613 (1979)
Shikata, J., Hanaoka, G., Zheng, Y., Imai, H.: Security Notions for Unconditionally Secure Signature Schemes. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 434–449. Springer, Heidelberg (2002)
Stinson, D.R., Wei, R.: Unconditionally Secure Proactive Secret Sharing Scheme with Combinatorial Structures. In: Selected Areas in Cryptography, pp. 200–214 (1999)
Safavi-Naini, R., Wang, H.: Multireceiver authentication codes: models, bounds, constructions and extensions. Information and Computation 151, 148–172 (1999)
Tompa, M., Wolf, H.: How to share a secret with cheaters. Journal of Cryptology 1(2), 133–138 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nascimento, A.C.A., Mueller-Quade, J., Otsuka, A., Hanaoka, G., Imai, H. (2004). Unconditionally Non-interactive Verifiable Secret Sharing Secure against Faulty Majorities in the Commodity Based Model. In: Jakobsson, M., Yung, M., Zhou, J. (eds) Applied Cryptography and Network Security. ACNS 2004. Lecture Notes in Computer Science, vol 3089. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24852-1_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-24852-1_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22217-0
Online ISBN: 978-3-540-24852-1
eBook Packages: Springer Book Archive