{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T07:47:03Z","timestamp":1746517623358,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540222170"},{"type":"electronic","value":"9783540248521"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24852-1_26","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T18:37:21Z","timestamp":1284143841000},"page":"355-368","source":"Crossref","is-referenced-by-count":8,"title":["Unconditionally Non-interactive Verifiable Secret Sharing Secure against Faulty Majorities in the Commodity Based Model"],"prefix":"10.1007","author":[{"given":"Anderson C. A.","family":"Nascimento","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joern","family":"Mueller-Quade","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Otsuka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Goichiro","family":"Hanaoka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hideki","family":"Imai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Beaver, D., Goldwasser, S.: Multiparty Computation with Faulty Majority. In: Proc. of FOCS, pp. 468\u2013473 (1989)","DOI":"10.1109\/SFCS.1989.63520"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1007\/0-387-34805-0_51","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"D. Beaver","year":"1990","unstructured":"Beaver, D., Goldwasser, S.: Multiparty Computation with Faulty Majority. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 589\u2013590. Springer, Heidelberg (1990)"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Beaver, D.: Commodity-Based Cryptography. In: STOC 1997, pp. 446\u2013455 (1997) (Extended Abstract)","DOI":"10.1145\/258533.258637"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non- Cryptographic Fault-Tolerant Distributed Computation. In: 20th STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"26_CR5","first-page":"313","volume":"48","author":"G. Blakely","year":"1979","unstructured":"Blakely, G.: Safeguarding Cryptographic Keys. Proc. AFIPS\u00a048, 313\u2013317 (1979)","journal-title":"Proc. AFIPS"},{"key":"26_CR6","unstructured":"Blundo, C., Masucci, B., Stinson, D.R., Wei, R.: Constructions and Bounds for Unconditionally Secure Non-interactive Commitment Schemes (2001) (manuscript)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"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\u2013395 (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Chaum, D., Crepeau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: Proc. 20th ACM Symposium on the Theory of Computing (STOC), pp. 11\u201319 (1988) (extended abstract)","DOI":"10.1145\/62212.62214"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/0-387-34805-0_50","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"R. Cleve","year":"1990","unstructured":"Cleve, R.: Controlled Gradual Disclosure Schemes for Random Bits and Their Applications. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 573\u2013588. Springer, Heidelberg (1990)"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/3-540-44750-4_9","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"C. Crepeau","year":"1995","unstructured":"Crepeau, C., van de Graaf, J., Tapp, A.: Committed Oblivious Transfer and Private multiparty Computations. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 110\u2013123. Springer, Heidelberg (1995)"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/3-540-48910-X_22","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Cramer","year":"1999","unstructured":"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.\u00a01592, pp. 311\u2013326. Springer, Heidelberg (1999)"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: 28th IEEE Symp. on Foundations of Computer Science, pp. 427\u2013437 (1987)","DOI":"10.1109\/SFCS.1987.4"},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-38424-3_6","volume-title":"Advances in Cryptology - CRYPTO \u201990","author":"S. Goldwasser","year":"1991","unstructured":"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.\u00a0537, pp. 77\u201393. Springer, Heidelberg (1991)"},{"key":"26_CR14","unstructured":"Goldreich, O.: Secure multiparty Computation, lecture notes, available from \n                    \n                      http:\/\/www.wisdom.weizmann.ac.il\/~oded\/pp.html"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"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\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/3-540-44448-3_11","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"G. Hanaoka","year":"2000","unstructured":"Hanaoka, G., Shikata, G.J., Zheng, Y.: Unconditionally Secure Digital Signature Schemes Admitting Transferability. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 130\u2013142. Springer, Heidelberg (2000)"},{"issue":"3","key":"26_CR17","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Trans. on Programming Languages and Systems\u00a04(3), 382\u2013401 (1982)","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/3-540-48184-2_14","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"T. Matsumoto","year":"1988","unstructured":"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.\u00a0293, pp. 185\u2013193. Springer, Heidelberg (1988)"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/3-540-46766-1_32","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"S. Micali","year":"1992","unstructured":"Micali, S., Rogaway, P.: Secure Computation. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 392\u2013404. Springer, Heidelberg (1992)"},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"R.J. McEliece","year":"1981","unstructured":"McEliece, R.J., Sarwate, D.V.: On sharing secrets and Reed-Solomon codes. Communications of the ACM\u00a024, 583\u2013584 (1981)","journal-title":"Communications of the ACM"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1109\/ISIT.2003.1228323"},{"key":"26_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"T. Pedersen","year":"1992","unstructured":"Pedersen, T.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 129\u2013140. Springer, Heidelberg (1992)"},{"key":"26_CR23","first-page":"73","volume-title":"Proc. ACM STOC 1989","author":"T. Rabin","year":"1989","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proc. ACM STOC 1989, pp. 73\u201385. ACM Press, New York (1989)"},{"key":"26_CR24","unstructured":"Rivest, R.L.: Unconditionally secure commitment and oblivious transfer schemes using concealing channels and a trusted initializer (1999) (manuscript)"},{"key":"26_CR25","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to Share a Secret. Communications of the ACM\u00a022, 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"26_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/3-540-46035-7_29","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"J. Shikata","year":"2002","unstructured":"Shikata, J., Hanaoka, G., Zheng, Y., Imai, H.: Security Notions for Unconditionally Secure Signature Schemes. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 434\u2013449. Springer, Heidelberg (2002)"},{"key":"26_CR27","doi-asserted-by":"crossref","unstructured":"Stinson, D.R., Wei, R.: Unconditionally Secure Proactive Secret Sharing Scheme with Combinatorial Structures. In: Selected Areas in Cryptography, pp. 200\u2013214 (1999)","DOI":"10.1007\/3-540-46513-8_15"},{"key":"26_CR28","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1006\/inco.1998.2769","volume":"151","author":"R. Safavi-Naini","year":"1999","unstructured":"Safavi-Naini, R., Wang, H.: Multireceiver authentication codes: models, bounds, constructions and extensions. Information and Computation\u00a0151, 148\u2013172 (1999)","journal-title":"Information and Computation"},{"issue":"2","key":"26_CR29","first-page":"133","volume":"1","author":"M. Tompa","year":"1988","unstructured":"Tompa, M., Wolf, H.: How to share a secret with cheaters. Journal of Cryptology\u00a01(2), 133\u2013138 (1988)","journal-title":"Journal of Cryptology"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24852-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:04:43Z","timestamp":1558289083000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24852-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540222170","9783540248521"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24852-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}