{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T20:56:48Z","timestamp":1725656208368},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540537212"},{"type":"electronic","value":"9783642764622"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/978-3-642-76462-2_22","type":"book-chapter","created":{"date-parts":[[2012,1,28]],"date-time":"2012-01-28T15:43:46Z","timestamp":1327765426000},"page":"305-319","source":"Crossref","is-referenced-by-count":2,"title":["A Consistency Condition Supporting Design and Verification of Byzantine Adaptive Agreement Protocols"],"prefix":"10.1007","author":[{"given":"Birgit","family":"Baum-Waidner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"B. Baum-Waidner: Byzantine Agreement Protocols with a Minimum Number of Messages in the Faultless Case; Internal Report 06\/89, Universit\u00e4t Karlsruhe."},{"key":"22_CR2","volume-title":"Cryptography and data security","author":"D Denning","year":"1982","unstructured":"D. Denning: Cryptography and data security, Addison-Wesley Publishing Company, London. 1982."},{"issue":"6","key":"22_CR3","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Whitfield Diffie, Martin E. Hellman: New Directions in Cryptography; IEEE Transactions on Information Theory 22 \/6 (1976) 644\u2013654.","journal-title":"New Directions in Cryptography; IEEE Transactions on Information Theory"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D Dolev","year":"1983","unstructured":"D. Dolev, H. R. Strong: Authenticated algorithms for Byzantine Agreement; SIAM J. Comp. 12 (1983), pp. 656\u2013666.","journal-title":"SIAM. J. Comp"},{"key":"22_CR5","first-page":"196","volume-title":"23th IEEE Symposium on Fundations of Computation Theory (FOCS)","author":"D Dolev","year":"1982","unstructured":"D. Dolev, R. Reischuk, H. Raymond Strong: \u2018Eventual\u2019 is earlier than \u2018Immediate\u2019; 23th IEEE Symposium on Fundations of Computation Theory (FOCS), 1982, 196\u2013203."},{"key":"22_CR6","first-page":"149","volume-title":"6th symposium on reliability in distributed software and database systems, conf. proc., IEEE","author":"K Echtle","year":"1987","unstructured":"K. Echtle: Fault masking and sequence agreement by a voting protocol with low message number; 6th symposium on reliability in distributed software and database systems, conf. proc., IEEE, 1987, S. 149\u2013160."},{"key":"22_CR7","first-page":"191","volume-title":"Distance Agreement Protocols; FTCS-19, conf. proc., IEEE","author":"K Echtle","year":"1989","unstructured":"K. Echtle: Distance Agreement Protocols; FTCS-19, conf. proc., IEEE, 1989, S.191\u2013198."},{"key":"22_CR8","first-page":"201","volume-title":"6th symposium on reliabiliby software and database systems, conf. proc., IEEE","author":"P Ezhilchelvan","year":"1987","unstructured":"P. Ezhilchelvan: Early stopping algorithms for distributed agreement under fail-stop, omission, and timing fault types; 6th symposium on reliabiliby software and database systems, conf. proc., IEEE, 1987, pp. 201\u2013212."},{"key":"22_CR9","first-page":"188","volume-title":"6th symposium on reliability in distributed software and database systems, conf. proc. IEEE","author":"F DiGiandomenica","year":"1987","unstructured":"F. DiGiandomenica, M. L. Guidotti, F. Grandoni, L. Simoncini: A graceful degradable algorithm for byzantine agreement; 6th symposium on reliability in distributed software and database systems, conf. proc. IEEE, 1987, S. 188\u2013200."},{"issue":"2","key":"22_CR10","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali, R. L. Rivest: A Digital Signature Scheme Secure Against Adaptive Chosen- Message Attacks; SIAM J. Comput. 17 \/2 (1988) 281\u2013308.","journal-title":"SIAM. J. Comput"},{"key":"22_CR11","first-page":"382","volume-title":"Transactions on programming languages and systems","author":"L Lamport","year":"1982","unstructured":"L. Lamport, R. Shostak, M. Pease: The byzantine generals problem; Transactions on programming languages and systems, vol. 4, no. 3, acm, 1982, S. 382\u2013401","edition":"3"},{"key":"22_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems; LNCS","author":"R Milner","year":"1980","unstructured":"R. Milner: A Calculus of Communicating Systems; LNCS 92, Springer-Verlag, Berlin 1980."},{"key":"22_CR13","first-page":"267","volume-title":"Theoretical Computer Science","author":"R Milner","year":"1983","unstructured":"R. Milner: Calculi for synchrony and asynchrony; Theoretical Computer Science 25, 1983, pp. 267\u2013310."},{"issue":"2","key":"22_CR14","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"M. Pease, R. Shostak, L. Lamport: Reaching agreement in the presence of faults; Journal of the acm, vol. 27, no. 2, 1980, S. 228\u2013234.","journal-title":"Journal of the acm"},{"issue":"2","key":"22_CR15","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"R. L. Rivest, A. Shamir, L. Adelman: A Method For Obtaining Digital Signatures and Public Key Cryptosystems; Communications of the ACM, vol. 21, no. 2, Feb. 1978, pp. 120\u2013126.","journal-title":"Communications of the ACM"},{"key":"22_CR16","first-page":"80","volume-title":"Simulating authenticated broadcasts to derive simple fault-tolerant algorithms","author":"TK Srikanth","year":"1987","unstructured":"T. K. Srikanth, Sam Toueg: Simulating authenticated broadcasts to derive simple fault-tolerant algorithms; Distributed Computing, Springer-Verlag, 1987 (2), S. 80\u201394."},{"key":"22_CR17","first-page":"77","volume-title":"Byzantine agreement; Compcon 83, conf. proc., IEEE","author":"HR Strong","year":"1983","unstructured":"H. R. Strong, D. Dolev: Byzantine agreement; Compcon 83, conf. proc., IEEE, 1983, S. 77\u201381."}],"container-title":["Informatik-Fachberichte","Kommunikation in verteilten Systemen"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-76462-2_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,25]],"date-time":"2020-11-25T03:03:32Z","timestamp":1606273412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-76462-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540537212","9783642764622"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-76462-2_22","relation":{},"ISSN":["0343-3005"],"issn-type":[{"type":"print","value":"0343-3005"}],"subject":[],"published":{"date-parts":[[1991]]}}}