{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,24]],"date-time":"2026-10-24T19:02:07Z","timestamp":1792868527151,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540009122","type":"print"},{"value":"9783540377955","type":"electronic"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-37795-6_11","type":"book-chapter","created":{"date-parts":[[2007,6,24]],"date-time":"2007-06-24T17:20:40Z","timestamp":1182705640000},"page":"57-61","source":"Crossref","is-referenced-by-count":1,"title":["Modeling Complexity in Secure Distributed Computing"],"prefix":"10.1007","author":[{"given":"Christian","family":"Cachin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2003,3,14]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"C. Cachin, K. Kursawe, A. Lysyanskaya, and R. Strobl, \u201cAsynchronous verifiable secret sharing and proactive cryptosystems,\u201d in Proc. 9th ACM Conference on Computer and Communications Security (CCS), 2002.","DOI":"10.1145\/586110.586124"},{"key":"11_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/3-540-44647-8_31","volume-title":"Advances in Cryptology: CRYPTO 2001","author":"C. Cachin","year":"2001","unstructured":"C. Cachin, K. Kursawe, F. Petzold, and V. Shoup, \u201cSecure and efficient asynchronous broadcast protocols (extended abstract),\u201d in Advances in Cryptology: CRYPTO 2001 (J. Kilian, ed.), vol. 2139 of Lecture Notes in Computer Science, pp. 524\u2013541, Springer, 2001."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"C. Cachin, K. Kursawe, and V. Shoup, \u201cRandom oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography,\u201d in Proc. 19th ACM Symposium on Principles of Distributed Computing (PODC), pp. 123\u2013132, 2000.","DOI":"10.1145\/343477.343531"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"R. Canetti and T. Rabin, \u201cFast asynchronous Byzantine agreement with optimal resilience,\u201d in Proc. 25th Annual ACM Symposium on Theory of Computing (STOC), pp. 42\u201351, 1993. Updated version available from http:\/\/www.research.ibm.com\/security\/ .","DOI":"10.1145\/167088.167105"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"W. Diffie and M. E. Hellman, \u201cNew directions in cryptography,\u201d IEEE Transactions on Information Theory, vol. 22, pp. 644\u2013654, Nov. 1976.","DOI":"10.1109\/TIT.1976.1055638"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"M. J. Fischer, N. A. Lynch, and M. S. Paterson, \u201cImpossibility of distributed consensus with one faulty process,\u201d Journal of the ACM, vol. 32, pp. 374\u2013382, Apr. 1985.","DOI":"10.1145\/3149.214121"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"O. Goldreich, Foundations of Cryptography: Basic Tools. Cambridge University Press, 2001.","DOI":"10.1017\/CBO9780511546891"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser and S. Micali, \u201cProbabilistic encryption,\u201d Journal of Computer and System Sciences, vol. 28, pp. 270\u2013299, 1984.","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff, \u201cThe knowledge complexity of interactive proof systems,\u201d SIAM Journal on Computing, vol. 18, pp. 186\u2013208, Feb. 1989.","DOI":"10.1137\/0218012"},{"key":"11_CR10","unstructured":"K. Kursawe and V. Shoup, \u201cOptimistic asynchronous atomic broadcast.\u201d Cryptology ePrint Archive, Report 2001\/022, Mar. 2001. http:\/\/eprint.iacr.org\/ ."},{"key":"11_CR11","unstructured":"N. A. Lynch, Distributed Algorithms. San Francisco: Morgan Kaufmann, 1996."},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"M. Pease, R. Shostak, and L. Lamport, \u201cReaching agreement in the presence of faults,\u201d Journal of the ACM, vol. 27, pp. 228\u2013234, Apr. 1980.","DOI":"10.1145\/322186.322188"}],"container-title":["Lecture Notes in Computer Science","Future Directions in Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-37795-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T05:35:53Z","timestamp":1556516153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-37795-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540009122","9783540377955"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-37795-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}