{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T12:13:51Z","timestamp":1725711231294},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642357947"},{"type":"electronic","value":"9783642357954"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35795-4_9","type":"book-chapter","created":{"date-parts":[[2013,1,4]],"date-time":"2013-01-04T09:49:42Z","timestamp":1357292982000},"page":"69-77","source":"Crossref","is-referenced-by-count":0,"title":["A Trustworthy Storage Framework on the Cloud"],"prefix":"10.1007","author":[{"given":"Xiang","family":"Yao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenbin","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"11","key":"9_CR1","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Communications of the ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/3-540-48405-1_10","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"B. Schoenmakers","year":"1999","unstructured":"Schoenmakers, B.: A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic Voting. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 148\u2013784. Springer, Heidelberg (1999)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","first-page":"341","volume-title":"Financial Cryptography","author":"H. Kikuchi","year":"2002","unstructured":"Kikuchi, H. (M+1)st-Price Auction Protocol. In: Syverson, P.F. (ed.) FC 2001. LNCS, vol.\u00a02339, pp. 341\u2013363. Springer, Heidelberg (2002)"},{"key":"9_CR4","unstructured":"Lal, S., Kumar, M.: A Directed-Threshold Multi-Signature Scheme. Cryptography and Security ACM-class (2004)"},{"key":"9_CR5","first-page":"1","volume-title":"Proceedings of the USENIX Annual Technical Conference","author":"M.W. Storer","year":"2007","unstructured":"Storer, M.W., Greenan, K.M., et al.: POTSHARDS: secure long-term storage without encryption. In: Proceedings of the USENIX Annual Technical Conference, pp. 1\u201314. USENIX Association, Santa Clara (2007)"},{"issue":"4","key":"9_CR6","first-page":"89","volume":"7","author":"Z. Chen","year":"2010","unstructured":"Chen, Z., Yao, W.-B., Xiao, D., Wu, C.-H., Liu, J.-Y., Wang, C.: ESSA: An Efficient and Secure Splitting Algorithm for Distributed Storage Systems. China Communications\u00a07(4), 89\u201395 (2010)","journal-title":"China Communications"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/TIT.1964.1053661","volume":"10","author":"R. Singleton","year":"1964","unstructured":"Singleton, R.: Maximum distance q-nary codes. IEEE Transactions on Information Theory\u00a010(2), 116\u2013118 (1964)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"9_CR8","doi-asserted-by":"crossref","first-page":"5","DOI":"10.37236\/1229","volume":"3","author":"M. L\u00f6bbing","year":"1996","unstructured":"L\u00f6bbing, M., Wegener, I.: The Number of Knight\u2019s Tours Equals 33,439,123,484,294 - Counting with Binary Decision Diagrams. The Electronic Journal of Combinatorics\u00a03(1), 5 (1996)","journal-title":"The Electronic Journal of Combinatorics"},{"issue":"2","key":"9_CR9","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0166-218X(96)00031-5","volume":"74","author":"O. Kyek","year":"1997","unstructured":"Kyek, O., Parberry, I., et al.: Bounds on the number of knight\u2019s tours. Discrete Applied Mathematics\u00a074(2), 171\u2013181 (1997)","journal-title":"Discrete Applied Mathematics"},{"issue":"24","key":"9_CR10","first-page":"3","volume":"38","author":"S. Bu","year":"2002","unstructured":"Bu, S., Xu, X., et al.: Analysis on Security of NTRU Public Key Cryptosystem. Computer Engineering and Applications\u00a038(24), 3 (2002)","journal-title":"Computer Engineering and Applications"}],"container-title":["Communications in Computer and Information Science","Trustworthy Computing and Services"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35795-4_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:31:31Z","timestamp":1620135091000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35795-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642357947","9783642357954"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35795-4_9","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2013]]}}}