{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:08:41Z","timestamp":1725491321954},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540751410"},{"type":"electronic","value":"9783540751427"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75142-7_31","type":"book-chapter","created":{"date-parts":[[2007,9,5]],"date-time":"2007-09-05T14:00:46Z","timestamp":1189000846000},"page":"403-419","source":"Crossref","is-referenced-by-count":7,"title":["Probabilistic Opaque Quorum Systems"],"prefix":"10.1007","author":[{"given":"Michael G.","family":"Merideth","sequence":"first","affiliation":[]},{"given":"Michael K.","family":"Reiter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Abd-El-Malek, M., Ganger, G.R., Goodson, G.R., Reiter, M.K., Wylie, J.J.: Fault-scalable Byzantine fault-tolerant services. In: Symposium on Operating Systems Principles (October 2005)","key":"31_CR1","DOI":"10.1145\/1095810.1095817"},{"issue":"4","key":"31_CR2","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/98163.98167","volume":"22","author":"F.B. Schneider","year":"1990","unstructured":"Schneider, F.B.: Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Computing Surveys\u00a022(4), 299\u2013319 (1990)","journal-title":"ACM Computing Surveys"},{"issue":"3","key":"31_CR3","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1109\/TDSC.2006.35","volume":"3","author":"J.P. Martin","year":"2006","unstructured":"Martin, J.P., Alvisi, L.: Fast Byzantine consensus. IEEE Transactions on Dependable and Secure Computing\u00a03(3), 202\u2013215 (2006)","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"issue":"4","key":"31_CR4","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s004460050050","volume":"11","author":"D. Malkhi","year":"1998","unstructured":"Malkhi, D., Reiter, M.: Byzantine quorum systems. Distributed Computing\u00a011(4), 203\u2013213 (1998)","journal-title":"Distributed Computing"},{"issue":"4","key":"31_CR5","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/571637.571640","volume":"20","author":"M. Castro","year":"2002","unstructured":"Castro, M., Liskov, B.: Practical Byzantine fault tolerance and proactive recovery. ACM Transactions on Computer Systems\u00a020(4), 398\u2013461 (2002)","journal-title":"ACM Transactions on Computer Systems"},{"issue":"2","key":"31_CR6","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1006\/inco.2001.3054","volume":"170","author":"D. Malkhi","year":"2001","unstructured":"Malkhi, D., Reiter, M.K., Wool, A., Wright, R.N.: Probabilistic quorum systems. Information and Computation\u00a0170(2), 184\u2013206 (2001)","journal-title":"Information and Computation"},{"issue":"1","key":"31_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/PL00008925","volume":"14","author":"R.A. Bazzi","year":"2001","unstructured":"Bazzi, R.A.: Access cost for asynchronous Byzantine quorum systems. Distributed Computing\u00a014(1), 41\u201348 (2001)","journal-title":"Distributed Computing"},{"issue":"2","key":"31_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1017\/S0963548301005089","volume":"11","author":"C. McDiarmid","year":"2002","unstructured":"McDiarmid, C.: Concentration for independent permutations. Combinatorics, Probability and Computing\u00a011(2), 163\u2013178 (2002)","journal-title":"Combinatorics, Probability and Computing"},{"unstructured":"Merideth, M.G., Reiter, M.K.: Probabilistic opaque quorum systems. Technical Report CMU-CS-07-117, CMU School of Computer Science (March 2007)","key":"31_CR9"},{"issue":"4","key":"31_CR10","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s00446-005-0133-8","volume":"18","author":"H. Yu","year":"2006","unstructured":"Yu, H.: Signed quorum systems. Distributed Computing\u00a018(4), 307\u2013323 (2006)","journal-title":"Distributed Computing"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/11561927_6","volume-title":"Distributed Computing","author":"A.S. Aiyer","year":"2005","unstructured":"Aiyer, A.S., Alvisi, L., Bazzi, R.A.: On the availability of non-strict quorum systems. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, pp. 48\u201362. Springer, Heidelberg (2005)"},{"key":"31_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/11864219_31","volume-title":"Distributed Computing","author":"A.S. Aiyer","year":"2006","unstructured":"Aiyer, A.S., Alvisi, L., Bazzi, R.A.: Byzantine and multi-writer k-quorums. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 443\u2013458. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Liskov, B., Rodrigues, R.: Tolerating Byzantine faulty clients in a quorum system. In: International Conference on Distributed Computing Systems (2006)","key":"31_CR13","DOI":"10.1109\/ICDCS.2006.83"},{"doi-asserted-by":"crossref","unstructured":"Cachin, C., Tessaro, S.: Optimal resilience for erasure-coded Byzantine distributed storage. In: International Conference on Dependable Systems and Networks (2006)","key":"31_CR14","DOI":"10.1109\/DSN.2006.56"},{"issue":"3","key":"31_CR15","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Transactions on Programming Languages and Systems\u00a04(3), 382\u2013401 (1982)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"31_CR16","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.: Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"unstructured":"Juels, A., Brainard, J.: Client puzzles: A cryptographic countermeasure against connection depletion attacks. In: Network and Distributed Systems Security Symposium, pp. 151\u2013165 (1999)","key":"31_CR17"},{"issue":"2","key":"31_CR18","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s00145-001-0020-9","volume":"15","author":"V. Shoup","year":"2002","unstructured":"Shoup, V., Gennaro, R.: Securing threshold cryptosystems against chosen ciphertext attack. Journal of Cryptology\u00a015(2), 75\u201396 (2002)","journal-title":"Journal of Cryptology"},{"key":"31_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/3-540-46035-7_6","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"J.H. An","year":"2002","unstructured":"An, J.H., Dodis, Y., Rabin, T.: On the security of joint signature and encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 83\u2013107. Springer, Heidelberg (2002)"},{"doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: Conference on Computer and Communications Security, pp. 62\u201373 (1993)","key":"31_CR20","DOI":"10.1145\/168588.168596"},{"doi-asserted-by":"crossref","unstructured":"Jakobsson, M., Juels, A.: Proofs of work and bread pudding protocols. In: Communications and Multimedia Security, pp. 258\u2013272 (1999)","key":"31_CR21","DOI":"10.1007\/978-0-387-35568-9_18"},{"issue":"1\u20133","key":"31_CR22","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0304-3975(02)00325-0","volume":"299","author":"D. Malkhi","year":"2003","unstructured":"Malkhi, D., Mansour, Y., Reiter, M.K.: Diffusion without false rumors: On propagating updates in a Byzantine environment. Theoretical Computer Science\u00a0299(1\u20133), 289\u2013306 (2003)","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: Principles of Distributed Computing, pp. 1\u201312 (August 1987)","key":"31_CR23","DOI":"10.1145\/41840.41841"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75142-7_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:52:41Z","timestamp":1619520761000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75142-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540751410","9783540751427"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75142-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}