{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T13:40:03Z","timestamp":1736084403388,"version":"3.32.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":18,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540537090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0020806","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:07:52Z","timestamp":1131862072000},"page":"285-295","source":"Crossref","is-referenced-by-count":8,"title":["Unconditional Byzantine Agreement with good majority"],"prefix":"10.1007","author":[{"given":"Birgit","family":"Baum-Waidner","sequence":"first","affiliation":[]},{"given":"Birgit","family":"Pfitzmann","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Waidner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","first-page":"1","volume-title":"Completeness theorems for non-cryptographic fault-tolerant distributed computation; 20th STOC","author":"M. Ben-Or","year":"1988","unstructured":"Michael Ben-Or, Shafi Goldwasser, Avi Wigderson: Completeness theorems for non-cryptographic fault-tolerant distributed computation; 20th STOC, ACM, New York 1988, 1\u201310."},{"key":"24_CR2","first-page":"313","volume":"48","author":"G. R. Blakley","year":"1979","unstructured":"G. R. Blakley: Safeguarding cryptographic keys; AFIPS Conference Proceedings Vol. 48, National Computer Conference (NCC) 1979, 313\u2013317.","journal-title":"AFIPS Conference Proceedings"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Andrei Z. Broder, Danny Dolev: Flipping coins in many pockets (Byzantine agreement on uniformly random values); 25th FOCS, IEEE Computer Society, 1984, 157\u2013170.","DOI":"10.1109\/SFCS.1984.715912"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Benny Chor, Shafi Goldwasser, Silvio Micali, Baruch Awerbuch: Verifiable secret sharing and achieving simultaneity in the presence of faults; 26th FOCS, IEEE Computer Society, 1985, 383\u2013395.","DOI":"10.1109\/SFCS.1985.64"},{"key":"24_CR5","first-page":"11","volume-title":"Multiparty unconditional secure protocols; 20th STOC","author":"D. Chaum","year":"1988","unstructured":"David Chaum, Claude Cr\u00e9peau, Ivan Damg\u00e5rd: Multiparty unconditional secure protocols; 20th STOC, ACM, New York 1988, 11\u201319."},{"key":"24_CR6","unstructured":"David Chaum, Sandra Roijakkers: Unconditionally Secure Digital Signatures; Crypto '90 \u2014 Abstracts, Santa Barbara, August 1990, 209\u2013217."},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0019-9958(82)90776-8","volume":"52","author":"D. Dolev","year":"1982","unstructured":"Danny Dolev, Michael. J. Fischer, Rob Fowler, Nancy A. Lynch, H. Raymond Strong: An Efficient Algorithm for Byzantine Agreement without Authentication; Information and Control 52 (1982) 257\u2013274.","journal-title":"Information and Control"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/0212045","volume":"12\/4","author":"D. Dolev","year":"1983","unstructured":"Danny Dolev, H. Raymond Strong: Authenticated Algorithms for Byzantine Agreement; SIAM J. Comput. 12\/4 (1983) 656\u2013666.","journal-title":"SIAM J. Comput."},{"key":"24_CR9","first-page":"148","volume-title":"Optimal algorithms for byzantine agreement; 20th STOC","author":"P. Feldman","year":"1988","unstructured":"Paul Feldman, Silvio Micali: Optimal algorithms for byzantine agreement; 20th STOC, ACM, New York 1988, 148\u2013161."},{"key":"24_CR10","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1002\/j.1538-7305.1974.tb02751.x","volume":"53\/3","author":"E. N. Gilbert","year":"1974","unstructured":"E. N. Gilbert, F. J. Mac Williams, N. J. A. Sloane: Codes which detect deception; The Bell System Technical Journal BSTJ 53\/3 (1974) 405\u2013424.","journal-title":"The Bell System Technical Journal BSTJ"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0020-0190(90)90185-Z","volume":"36","author":"O. Goldreich","year":"1990","unstructured":"Oded Goldreich, Erez Petrank: The Best of Both Worlds: Guaranteeing Termination in Fast Randomized Byzantine Agreement Protocols; Information Processing Letters 36 (1990) 45\u201349.","journal-title":"Information Processing Letters"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27\/2","author":"M. Pease","year":"1980","unstructured":"Marshall Pease, Robert Shostak, Leslie Lamport: Reaching Reaching Agreement in the Presence of Faults; Journal of the ACM 27\/2 (1980) 228\u2013234.","journal-title":"Journal of the ACM"},{"key":"24_CR13","first-page":"73","volume-title":"Verifiable Secret Sharing and Multiparty Protocols with Honest Majority; 21st STOC","author":"T. Rabin","year":"1989","unstructured":"Tal Rabin, Michael Ben-Or: Verifiable Secret Sharing and Multiparty Protocols with Honest Majority; 21st STOC, ACM, New York 1989, 73\u201385."},{"key":"24_CR14","first-page":"155","volume-title":"Foundations of Secure Computation","author":"M. O. Rabin","year":"1978","unstructured":"Michael O. Rabin: Digitalized Signatures; Foundations of Secure Computation, ed. by R.A. DeMillo, D.P. Dobkin, A.K. Jones, R.J. Lipton; Academic Press, N.Y. 1978, 155\u2013166."},{"key":"24_CR15","series-title":"Technical Report","volume-title":"Roubust Sharing of Secrets when the Dealer is Honest or Cheating","author":"T. Rabin","year":"1988","unstructured":"Tal Rabin: Roubust Sharing of Secrets when the Dealer is Honest or Cheating; Technical Report 1 1988, Computer Science Department, Hebrew University, Jerusalem, Israel."},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22\/11","author":"A. Shamir","year":"1979","unstructured":"Adi Shamir: How to Share a Secret; Communications of the ACM 22\/11 (1979) 612\u2013613.","journal-title":"Communications of the ACM"},{"key":"24_CR17","unstructured":"Michael Waidner, Birgit Pfitzmann: Unconditional Sender and Recipient Untraceability in spite of active Attacks\u2014Some Remarks; Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe, Interner Bericht 5\/89, M\u00e4rz 1989."},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M. N. Wegman","year":"1981","unstructured":"M. N. Wegman, J. L. Carter: New Hash Functions and Their Use in Authentication and Set Equality; Journal of Computer and System Sciences 22 (1981) 265\u2013279.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","STACS 91"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0020806.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T13:00:20Z","timestamp":1736082020000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0020806"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540537090"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0020806","relation":{},"subject":[]}}