{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T04:08:50Z","timestamp":1747541330217,"version":"3.40.5"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319149769"},{"type":"electronic","value":"9783319149776"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-14977-6_27","type":"book-chapter","created":{"date-parts":[[2015,1,28]],"date-time":"2015-01-28T09:23:24Z","timestamp":1422437004000},"page":"278-287","source":"Crossref","is-referenced-by-count":1,"title":["Computationally Secure Cheating Identifiable Multi-Secret Sharing for General Access Structure"],"prefix":"10.1007","author":[{"given":"Partha Sarathi","family":"Roy","sequence":"first","affiliation":[]},{"given":"Angsuman","family":"Das","sequence":"additional","affiliation":[]},{"given":"Avishek","family":"Adhikari","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Robust computational secret sharing and a unified account of classical secret-sharing goals. In: Proceedings of the 14th ACM Conference on Computer and Communications Security, pp. 172\u2013184 (2007)","DOI":"10.1145\/1315245.1315268"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: The National Computer Conference 1979. AFIPS, vol.\u00a048, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-642-45239-0_16","volume-title":"Cryptography and Coding","author":"I. Damg\u00e5rd","year":"2013","unstructured":"Damg\u00e5rd, I., Jakobsen, T.P., Nielsen, J.B., Pagter, J.I.: Secure key management in the cloud. In: Stam, M. (ed.) IMACC 2013. LNCS, vol.\u00a08308, pp. 270\u2013289. Springer, Heidelberg (2013)"},{"issue":"9","key":"27_CR4","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1016\/j.aml.2010.04.024","volume":"23","author":"A. Das","year":"2010","unstructured":"Das, A., Adhikari, A.: An efficient multi-use multi-secret sharing scheme based on hash function. Applied Mathematics Letters\u00a023(9), 993\u2013996 (2010)","journal-title":"Applied Mathematics Letters"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.csi.2007.08.004","volume":"30","author":"M.H. Dehkordi","year":"2008","unstructured":"Dehkordi, M.H., Mashhadi, S.: An efficient threshold verifiable multi-secret sharing. Computer Standards and Interfaces\u00a030, 187\u2013190 (2008)","journal-title":"Computer Standards and Interfaces"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Geng, Y.J., Fan, X.H., Hong, F.: A new multi-secret sharing scheme with multi-policy. In: The 9th International Conference on Advanced Communication Technology, vol.\u00a03, pp. 1515\u20131517 (2007)","DOI":"10.1109\/ICACT.2007.358655"},{"issue":"2","key":"27_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1049\/el:19950073","volume":"31","author":"J. He","year":"1994","unstructured":"He, J., Dawson, E.: Multi-secret sharing scheme based on one-way function. Electronic Letters\u00a031(2), 93\u201395 (1994)","journal-title":"Electronic Letters"},{"issue":"19","key":"27_CR8","doi-asserted-by":"publisher","first-page":"1591","DOI":"10.1049\/el:19941076","volume":"30","author":"J. He","year":"1994","unstructured":"He, J., Dawson, E.: Multi-stage secret sharing based on one-way function. Electronic Letters\u00a030(19), 1591\u20131592 (1994)","journal-title":"Electronic Letters"},{"key":"27_CR9","unstructured":"Herranz, J., Ruiz, A., Saez, G.: New results and applications for multi-secret sharing schemes. In: Design, Codes and Cryptography, pp. 1\u201324. Springer (2013)"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1016\/j.ipl.2013.05.003","volume":"113","author":"J. Herranz","year":"2013","unstructured":"Herranz, J., Ruiz, A., Saez, G.: Sharing many secrets with computational provable security. Information Processing Letters\u00a0113, 572\u2013579 (2013)","journal-title":"Information Processing Letters"},{"key":"27_CR11","unstructured":"Huang, Z., Li, Q., Wei, R., Li, Z.: A Generalized Multi-secret Sharing Scheme to Identify Cheaters. Journal of the China Railway Society (July 2006)"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-28914-9_2","volume-title":"Theory of Cryptography","author":"Y. Ishai","year":"2012","unstructured":"Ishai, Y., Ostrovsky, R., Seyalioglu, H.: Identifying cheaters without an honest majority. In: Cramer, R. (ed.) TCC 2012. LNCS, vol.\u00a07194, pp. 21\u201338. Springer, Heidelberg (2012)"},{"key":"27_CR13","unstructured":"Martin, K.M.: Challenging the adversary model in secret sharing schemes. Coding and Cryptography II. In: Proceedings of the Royal Flemish Academy of Belgium for Science and the Arts, pp. 45\u201363 (2008)"},{"issue":"9","key":"27_CR14","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"R. McEliece","year":"1981","unstructured":"McEliece, R., Sarwate, D.: On sharing secrets and reed-solomon codes. Communications of the ACM\u00a024(9), 583\u2013584 (1981)","journal-title":"Communications of the ACM"},{"issue":"4","key":"27_CR15","first-page":"50","volume":"37","author":"P.S. Roy","year":"2010","unstructured":"Roy, P.S., Adhikari, A.: Multi-Use Multi-Secret Sharing Scheme for General Access Structure. Annals of the University of Craiova, Mathematics and Computer Science Series\u00a037(4), 50\u201357 (2010)","journal-title":"Annals of the University of Craiova, Mathematics and Computer Science Series"},{"key":"27_CR16","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, 612\u2013613 (1979)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Internet Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14977-6_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T22:08:14Z","timestamp":1747519694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14977-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319149769","9783319149776"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14977-6_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}