{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:49:58Z","timestamp":1725652198581},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540539117"},{"type":"electronic","value":"9783642765629"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/978-3-642-76562-9_19","type":"book-chapter","created":{"date-parts":[[2012,1,16]],"date-time":"2012-01-16T09:47:41Z","timestamp":1326707261000},"page":"302-320","source":"Crossref","is-referenced-by-count":0,"title":["Unbedingte Unbeobachtbarkeit mit kryptographischer Robustheit"],"prefix":"10.1007","author":[{"given":"Birgit","family":"Pfitzmann","sequence":"first","affiliation":[]},{"given":"Michael","family":"Waidner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"B. Baum-Waidner, B. Pfitzmann, M. Waidner: Unconditional Byzantine Agreement with Good Majority; Symp. on Theoretical Aspects of Computer Science (STACS), Hamburg 1991; LNCS, Springer-Verlag, Berlin 1991."},{"key":"19_CR2","first-page":"1","volume-title":"A. Wigderson: Completeness theorems for non-cryptographic fault-tolerant distributed computation","author":"M Ben-Or","year":"1988","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson: Completeness theorems for non-cryptographic fault-tolerant distributed computation; 20th Symposium on Theory of Computing (STOC \u201988), ACM, New York 1988, 1\u201310."},{"key":"19_CR3","first-page":"289","volume-title":"An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information","author":"M Blum","year":"1985","unstructured":"M. Blum, S. Goldwasser: An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information; Crypto \u201984, LNCS 196, Springer-Verlag, Berlin 1985, 289\u2013299."},{"key":"19_CR4","first-page":"320","volume-title":"Detection of Disrupters in the DC Protocol","author":"J Bos","year":"1990","unstructured":"J. Bos, B. den Boer: Detection of Disrupters in the DC Protocol; Eurocrypt \u201989, LNCS 434, Springer-Verlag, Berlin 1990, 320\u2013327."},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G Brassard","year":"1988","unstructured":"G. Brassard, D. Chaum, C. Cr\u00e9peau: Minimum Disclosure Proofs of Knowledge; Journal of Computer and System Sciences 37 (1988) 156\u2013189.","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR6","first-page":"383","volume-title":"Verifiable secret sharing and achieving simultaneity in the presence of faults","author":"B Chor","year":"1985","unstructured":"B. Chor, S. Goldwasser, S. Micali, B. Awerbuch: Verifiable secret sharing and achieving simultaneity in the presence of faults; 26th Symposium on Foundations of Computer Science (FOCS) 1985, IEEE, 1985, 383\u2013395."},{"issue":"10","key":"19_CR7","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1145\/4372.4373","volume":"28","author":"D Chaum","year":"1985","unstructured":"D. Chaum: Security without Identification: Transaction Systems to make Big Brother Obsolete; Communications of the ACM 28\/10 (1985) 1030\u20131044.","journal-title":"Communications of the ACM"},{"issue":"1","key":"19_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D Chaum","year":"1988","unstructured":"D. Chaum: The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability; Amsterdam 1985; Journal of Cryptology 1\/1 (1988) 65\u201375.","journal-title":"Journal of Cryptology"},{"key":"19_CR9","first-page":"87","volume-title":"Multiparty Computations ensuring privacy of each party\u2019s input and correctness of the result","author":"D Chaum","year":"1988","unstructured":"D. Chaum, I. Damg\u00e5rd, J. van de Graaf: Multiparty Computations ensuring privacy of each party\u2019s input and correctness of the result; Crypto \u201987, LNCS 293, Springer-Verlag, Berlin 1988, 87\u2013119."},{"key":"19_CR10","series-title":"Advances in Computing Research","first-page":"443","volume-title":"Randomization in Byzantine Agreement","author":"B Chor","year":"1989","unstructured":"B. Chor, C. Dwork: Randomization in Byzantine Agreement; JAI Press, Advances in Computing Research Vol. 5, Greenwich (Connecticut) 1989, 443\u2013497."},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0019-9958(82)90776-8","volume":"52","author":"D Dolev","year":"1982","unstructured":"D. Dolev, M. Fischer, R. Fowler, N. Lynch, H. Strong: An Efficient Algorithm for Byzantine Agreement without Authentication; Information and Control 52 (1982) 257\u2013274.","journal-title":"Information and Control"},{"issue":"6","key":"19_CR12","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"W. Diffie, M. Heilman: New Directions in Cryptography; IEEE Tr. on Information Theory 22\/6 (1976) 644\u2013654.","journal-title":"IEEE Tr. on Information Theory"},{"issue":"4","key":"19_CR13","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D Dolev","year":"1983","unstructured":"D. Dolev, H. Strong: Authenticated Algorithms for Byzantine Agreement; SIAM J. Comput. 12\/4 (1983) 656\u2013666.","journal-title":"SIAM J. Comput."},{"key":"19_CR14","first-page":"148","volume-title":"Optimal algorithms for byzantine agreement","author":"P Feldman","year":"1988","unstructured":"P. Feldman, S. Micali: Optimal algorithms for byzantine agreement; 20th Symposium on Theory of Computing (STOC) 1988, ACM, New York 1988, 148\u2013161."},{"key":"19_CR15","first-page":"127","volume-title":"The Consensus Problem in Unreliable Distributed Systems (A Brief Survey)","author":"M Fischer","year":"1983","unstructured":"M. Fischer: The Consensus Problem in Unreliable Distributed Systems (A Brief Survey); 4th Conference on Foundations of Computation Theory, 1983, 127\u2013140."},{"key":"19_CR16","first-page":"218","volume-title":"How to play any mental game - or - a completeness theorem for protocols with honest majority","author":"O Goldreich","year":"1987","unstructured":"O. Goldreich, S. Micali, A. Wigderson: How to play any mental game - or - a completeness theorem for protocols with honest majority; 19th STOC 1987, ACM, New York 1987, 218\u2013229."},{"key":"19_CR17","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, S. Micali: Probabilistic Encryption; J. of Computer and System Sciences 28 (1984) 270\u2013299.","journal-title":"J. of Computer and System Sciences"},{"issue":"2","key":"19_CR18","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali, R. 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":"19_CR19","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0020-0190(90)90185-Z","volume":"36","author":"O Goldreich","year":"1990","unstructured":"O. Goldreich, E. 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":"19_CR20","series-title":"Datenschutz und Datensicherung DuD","volume-title":"Effizientere fail-stop Schl\u00fcsselerzeugung f\u00fcr das DC-Netz","author":"J Lukat","year":"1991","unstructured":"J. Lukat, A. Pfitzmann, M. Waidner: Effizientere fail-stop Schl\u00fcsselerzeugung f\u00fcr das DC-Netz; Datenschutz und Datensicherung DuD 15\/2 (1991)."},{"issue":"2","key":"19_CR21","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; JACM 27\/2 (1980) 228\u2013234.","journal-title":"JACM"},{"key":"19_CR22","unstructured":"A. Pfitzmann: How to implement ISDNs without user observability - Some remarks; Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe, Interner Bericht 14\/85."},{"key":"19_CR23","volume-title":"F\u00fcr den Unterzeichner sichere digitale Signaturen und ihre Anwendung","author":"B Pfitzmann","year":"1989","unstructured":"B. Pfitzmann: F\u00fcr den Unterzeichner sichere digitale Signaturen und ihre Anwendung; Diplomarbeit am Institut f\u00fcr Rechnerentwurf und Fehlertoleranz der Universit\u00e4t Karlsruhe, 1989."},{"key":"19_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-75544-6","volume-title":"Diensteintegrierende Kommunikationsnetze mit teilnehmer\u00fcberpr\u00fcfbarem Datenschutz","author":"A Pfitzmann","year":"1990","unstructured":"A. Pfitzmann: Diensteintegrierende Kommunikationsnetze mit teilnehmer\u00fcberpr\u00fcfbarem Datenschutz; IFB 234, Springer-Verlag, Heidelberg 1990."},{"issue":"3","key":"19_CR25","first-page":"118","volume":"11","author":"A Pfitzmann","year":"1988","unstructured":"A. Pfitzmann, B. Pfitzmann, M. Waidner: Datenschutz garantierende offene Kommunikationsnetze; Informatik- Spektrum 11\/3 (1988) 118\u2013142.","journal-title":"Informatik- Spektrum"},{"key":"19_CR26","series-title":"Interner Bericht","volume-title":"Formal Aspects of Fail-stop Signatures","author":"B Pfitzmann","year":"1990","unstructured":"B. Pfitzmann, M. Waidner: Formal Aspects of Fail-stop Signatures; Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe, Interner Bericht 22\/90, Dezember 1990."},{"key":"19_CR27","unstructured":"B. Pfitzmann, M. Waidner: Fail-stop-Signaturen und ihre Anwendung; VIS 91; in diesem Tagungsband."},{"key":"19_CR28","series-title":"Datenschutz und Datensicherung DuD","first-page":"243","volume-title":"Rechtssicherheit trotz Anonymit\u00e4t in offenen digitalen Systemen","author":"B Pfitzmann","year":"1990","unstructured":"B. Pfitzmann, M. Waidner, A. Pfitzmann: Rechtssicherheit trotz Anonymit\u00e4t in offenen digitalen Systemen; Datenschutz und Datensicherung DuD 14\/5\u20136 (1990) 243\u2013253, 305\u2013315."},{"key":"19_CR29","first-page":"73","volume-title":"Verifiable Secret Sharing and Multiparty Protocols with Honest Majority","author":"T Rabin","year":"1989","unstructured":"T. Rabin, M. Ben-Or: Verifiable Secret Sharing and Multiparty Protocols with Honest Majority; 21st Symposium on Theory of Computing (STOC) 1989, ACM, New York 1989, 73\u201385."},{"issue":"2","key":"19_CR30","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1137\/0209024","volume":"9","author":"M Rabin","year":"1980","unstructured":"M. Rabin: Probabilistic Algorithms in Finite Fields; SIAM J. Comput. 9\/2 (1980) 273\u2013280.","journal-title":"SIAM J. Comput."},{"key":"19_CR31","first-page":"65","volume-title":"Konsistenz und Fehlertoleranz in Verteilten Systemen - Das Problem der Byzantinischen Gener\u00e4le","author":"R Reischuk","year":"1987","unstructured":"R. Reischuk: Konsistenz und Fehlertoleranz in Verteilten Systemen - Das Problem der Byzantinischen Gener\u00e4le; 17. Gl Jahrestagung, IFB 156, Springer-Verlag, Berlin 1987, 65\u201381."},{"key":"19_CR32","first-page":"302","volume-title":"Unconditional Sender and Recipient Untraceability in spite of Active Attacks","author":"M Waidner","year":"1990","unstructured":"M. Waidner: Unconditional Sender and Recipient Untraceability in spite of Active Attacks; Eurocrypt\u201989, LNCS 434, Springer-Verlag, Berlin 1990, 302\u2013319."},{"key":"19_CR33","series-title":"Interner Bericht","volume-title":"Unconditional Sender and Recipient Untraceability in spite of Active Attacks - Some Remarks","author":"M Waidner","year":"1989","unstructured":"M. Waidner, Birgit Pfitzmann: Unconditional Sender and Recipient Untraceability in spite of Active Attacks - Some Remarks; Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe, Interner Bericht 5\/89, M\u00e4rz 1989."}],"container-title":["Informatik-Fachberichte","VIS \u201991 Verl\u00e4\u00dfliche Informationssysteme"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-76562-9_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,25]],"date-time":"2020-11-25T03:10:18Z","timestamp":1606273818000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-76562-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540539117","9783642765629"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-76562-9_19","relation":{},"ISSN":["0343-3005"],"issn-type":[{"type":"print","value":"0343-3005"}],"subject":[],"published":{"date-parts":[[1987]]}}}