{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T23:10:44Z","timestamp":1740265844419,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540266563"},{"type":"electronic","value":"9783540316800"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11507840_2","type":"book-chapter","created":{"date-parts":[[2010,7,15]],"date-time":"2010-07-15T12:35:59Z","timestamp":1279197359000},"page":"16-30","source":"Crossref","is-referenced-by-count":11,"title":["Protecting Secret Data from Insider Attacks"],"prefix":"10.1007","author":[{"given":"David","family":"Dagon","sequence":"first","affiliation":[]},{"given":"Wenke","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Richard","family":"Lipton","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/3-540-57155-8_238","volume-title":"Algorithms and Data Structures","author":"L. Arge","year":"1993","unstructured":"Arge, L., Knudseni, M., Larsent, K.: A general lower bound on the complexity of comparison-based algorithm. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1993. LNCS, vol.\u00a0709, pp. 83\u201394. Springer, Heidelberg (1993)"},{"doi-asserted-by":"crossref","unstructured":"Aggarwal, A., Vitter, J.S.: The i\/o complexity of sorting and related problems. In: Proc. 14th ICALP (1987)","key":"2_CR2","DOI":"10.1007\/3-540-18088-5_40"},{"key":"2_CR3","volume-title":"Computer Security: Art and Science","author":"M. Bishop","year":"2003","unstructured":"Bishop, M.: Computer Security: Art and Science. Addison-Wesley, Longman (2003)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/3-540-49116-3_47","volume-title":"STACS 99","author":"G. Crescenzo Di","year":"1999","unstructured":"Di Crescenzo, G., Ferguson, N., Impagliazzo, R., Jakobsson, M.: How to forget a secret. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, p. 500. Springer, Heidelberg (1999)"},{"unstructured":"Cheswick, B.: The design of a secure internet gateway. In: Proc. of Usenix Summer Conference (1990)","key":"2_CR5"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/3-540-46766-1_7","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"R.M. Capocelli","year":"1992","unstructured":"Capocelli, R.M., De Santis, A., Gargano, L., Vaccaro, U.: On the size of shares for secret sharing schemes. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 101\u2013113. Springer, Heidelberg (1992)"},{"doi-asserted-by":"crossref","unstructured":"Deswarte, Y., Fabre, J.C., Fray, J.M., Powell, D., Ranea, P.G.: Saturne: a distributed computing system which tolerates faults and intrusions. In: Workshop on the Future Trends of Distributed Computing Systems in the 1990s, September 1988, pp. 329\u2013338 (1988)","key":"2_CR7","DOI":"10.1109\/FTDCS.1988.26714"},{"doi-asserted-by":"crossref","unstructured":"Fray, J.-M., Deswarte, Y., Powell, D.: Intrusion tolerance using fine-grain fragmentation-scattering. In: Proc. IEEE Symp. on Security and Privacy, pp. 194\u2013201 (1991)","key":"2_CR8","DOI":"10.1109\/SP.1986.10019"},{"unstructured":"Fabre, J.-C., Deswarte, Y., Randall, B.: Designing secure and reliable applications using fragmentation-redundancy-scattering: an object-oriented approach. In: PDCS 1992 (1992)","key":"2_CR9"},{"unstructured":"Frost, H., Martz, A.: The storage performance dilemma (2003), http:\/\/www.texmemsys.com\/files\/f000160.pdf","key":"2_CR10"},{"key":"2_CR11","volume-title":"Computer Organization and Design","author":"J.L. Hennessy","year":"2003","unstructured":"Hennessy, J.L., Patterson, D.A.: Computer Organization and Design. Morgan Kaufman Publishers, San Francisco (2003)"},{"doi-asserted-by":"crossref","unstructured":"Katzenbeisser, S., Petitcolas, F.A.P. (eds.): Information Hiding Techniques for Steganography and Digital Watermarking. Artech House Books (2000)","key":"2_CR12","DOI":"10.1201\/1079\/43263.28.6.20001201\/30373.5"},{"doi-asserted-by":"crossref","unstructured":"Lakshmanan, S., Ahamad, M., Venkateswaran, H.: A secure and highly available distributed store for meeting diverse data storage needs. In: Proceedings of the International Conference on Dependable Systems and Networks, DSN 2001 (2001)","key":"2_CR13","DOI":"10.1109\/DSN.2001.941410"},{"doi-asserted-by":"crossref","unstructured":"Maurer, U.M.: Conditionally-perfect secrecy and a provably-secure randomized cipher (1992)","key":"2_CR14","DOI":"10.1007\/BF00191321"},{"key":"2_CR15","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, 203\u2013213 (1998)","journal-title":"Distributed Computing"},{"doi-asserted-by":"crossref","unstructured":"Patt, N.P.: The I\/O subsystem: A candidate for improvement. IEEE Computer: Special Issue\u00a024 (1994)","key":"2_CR16","DOI":"10.1109\/2.268880"},{"unstructured":"Provos, N., Mazieres, D.: A future-adaptable password scheme (1999), http:\/\/www.openbsd.org\/papers\/bcrypt-paper.ps","key":"2_CR17"},{"doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of the ACM\u00a036 (April 1989)","key":"2_CR18","DOI":"10.1145\/62044.62050"},{"issue":"7","key":"2_CR19","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"A. Shamir","year":"1970","unstructured":"Shamir, A.: How to share a secret. Comm. of ACM\u00a013(7), 422\u2013426 (1970)","journal-title":"Comm. of ACM"},{"doi-asserted-by":"crossref","unstructured":"Wylie, J., Bigrigg, M., Strunk, J., Ganger, G., Kiliccote, H., KhoslaComputer, P.: Survivable information storage systems. In: IEEE Computer, August 2000, vol.\u00a033, pp. 61\u201368 (2000)","key":"2_CR20","DOI":"10.1109\/2.863969"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11507840_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T22:51:21Z","timestamp":1740264681000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11507840_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540266563","9783540316800"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11507840_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}