{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:26:20Z","timestamp":1725495980751},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401117"},{"type":"electronic","value":"9783540448280"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44828-4_11","type":"book-chapter","created":{"date-parts":[[2007,11,18]],"date-time":"2007-11-18T06:09:54Z","timestamp":1195366194000},"page":"87-97","source":"Crossref","is-referenced-by-count":3,"title":["Unconditionally Secure Homomorphic Pre-distributed Commitments"],"prefix":"10.1007","author":[{"given":"Anderson C. A.","family":"Nascimento","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Otsuka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hideki","family":"Imai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joern","family":"Mueller-Quade","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,4,30]]},"reference":[{"key":"11_CR1","series-title":"Lect Notes Comput Sci","volume-title":"On the Key Predistribution Systems: A Practical Solution to the Key Distribution Problem, Advances in Cryptology \u2014 CRYPTO\u2019 87, Santa Barbara, California, USA, 1987","author":"T. Matsumoto","year":"1988","unstructured":"T. Matsumoto and H. Imai, On the Key Predistribution Systems: A Practical Solution to the Key Distribution Problem, Advances in Cryptology \u2014 CRYPTO\u2019 87, Santa Barbara, California, USA, 1987, LNCS 293 Springer 1988"},{"key":"11_CR2","unstructured":"B. Pfitzmann and M. Waidner. Information theoretic pseudosignatures and byzantine agreement for t >= n\/3, Reserach Report IBM Reserach, Nov. 1996"},{"key":"11_CR3","unstructured":"R.L. Rivest, Unconditionally secure commitment and oblivious transfer schemes using concealing channels and a trusted initializer, pre-print available from http:\/\/theory.lcs.mit.edu\/~{}rivest\/Rivest-commitment.pdf ."},{"key":"11_CR4","first-page":"97","volume":"26","author":"C. Blundo","year":"2002","unstructured":"C. Blundo, B. Masucci, D. R. Stinson, and R. Wei, Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes, Designs, Codes, and Cryptography, (special issue in honour of Ron Mullin), Vol. 26, pp. 97\u2013110, 2002.","journal-title":"Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes, Designs, Codes, and Cryptography, (special issue in honour of Ron Mullin)"},{"key":"11_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44448-3_11","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2000, Kyoto, Japan 2000","author":"G. Hanaoka","year":"2000","unstructured":"G. Hanaoka, J. Shikata, Y. Zheng, H. Imai: Unconditionally Secure Digital Signature Schemes Admitting Transferability. Advances in Cryptology \u2014 ASIACRYPT 2000, Kyoto, Japan 2000, LNCS 1976, Springer 2000"},{"issue":"4","key":"11_CR6","doi-asserted-by":"publisher","first-page":"1350","DOI":"10.1109\/18.850674","volume":"46","author":"U. Maurer","year":"2000","unstructured":"U. Maurer, Authentication Theory and Hypothesis Testing, IEEE Transaction on Information Theory, vol. 46 No. 4, pp. 1350\u20131356, 2000.","journal-title":"IEEE Transaction on Information Theory"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"J. Kilian, A Note on Efficient zero-knowledge Proofs and Arguments, 24th ACM Symposium on Theory of Computation, 1992, pp. 723\u2013732","DOI":"10.1145\/129712.129782"},{"key":"11_CR8","unstructured":"R. Blahut. Principles and Practice of Information Theory, Addison-Wesley Publishing Company, 1987."}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44828-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T17:47:01Z","timestamp":1556992021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44828-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401117","9783540448280"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-44828-4_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}