{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:55:44Z","timestamp":1725486944043},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540009122"},{"type":"electronic","value":"9783540377955"}],"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_10","type":"book-chapter","created":{"date-parts":[[2007,6,24]],"date-time":"2007-06-24T17:20:40Z","timestamp":1182705640000},"page":"51-56","source":"Crossref","is-referenced-by-count":2,"title":["Towards a Practical Approach to Confidential Byzantine Fault Tolerance"],"prefix":"10.1007","author":[{"given":"Jian","family":"Yin","sequence":"first","affiliation":[]},{"given":"Jean-Philippe","family":"Martin","sequence":"additional","affiliation":[]},{"given":"Arun","family":"Venkataramani","sequence":"additional","affiliation":[]},{"given":"Lorenzo","family":"Alvisi","sequence":"additional","affiliation":[]},{"given":"Mike","family":"Dahlin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,3,14]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. In Journal of the Association for Computing Machinery, October 1985.","DOI":"10.1145\/4221.214134"},{"key":"10_CR2","unstructured":"Ran Canetti. Studies in Secure Multiparty Computation and Applications. Ph.d. thesis, Weizmann Institiute of Science, Israel, 1995."},{"key":"10_CR3","unstructured":"M. Castro and B. Liskov. Practical Byzantine fault tolerance. In Proceedings of the Third Symposium on Operating Systems Design and Implementation, February 1999."},{"issue":"4","key":"10_CR4","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1002\/ett.4460050407","volume":"5","author":"Y. G. Desmedt","year":"1994","unstructured":"Y. G. Desmedt. Threshold cryptography. European Trans. on Telecommunications, 5(4), pages 449\u2013457, July-August 1994.","journal-title":"European Trans. on Telecommunications"},{"issue":"1\u20132","key":"10_CR5","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0304-3975(98)00263-1","volume":"243","author":"J. Garay","year":"2000","unstructured":"Juan Garay, Rosario Gennaro, Charanjit Jutla, and Tal Rabin. Secure distributed storage and retrieval. In Theoretical Computer Science TCS 243(1\u20132), pages 363\u2013389, 2000.","journal-title":"Theoretical Computer Science TCS"},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s001459910011","volume":"13","author":"R. Gennaro","year":"2000","unstructured":"R. Gennaro, T. Rabin, S. Jarecki, and H. Krawczyk. Robust and efficient sharing of RSA functions. Journal of Cryptology, 13(2):273\u2013300, Spring 2000.","journal-title":"Journal of Cryptology"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"D. Malkhi and M. Reiter. Byzantine quorum systems. In Distributed Computing, 1998.","DOI":"10.1007\/s004460050050"},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/98163.98167","volume":"22","author":"F. Schneider","year":"1990","unstructured":"F. Schneider. Implementing Fault-tolerant Services Using the State Machine Approach: A tutorial. Computing Surveys, 22(3):299\u2013319, September 1990.","journal-title":"Computing Surveys"},{"key":"10_CR9","unstructured":"L. Zhou, F. Schneider, and R. Renesse. COCA: A secure distributed on-line certification authority. In Technical Report TR2000-1828, Computer Science Department, Cornell Univesity, 2000."}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T07:18:05Z","timestamp":1550387885000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-37795-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540009122","9783540377955"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-37795-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}