{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T21:04:17Z","timestamp":1726002257438},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030051709"},{"type":"electronic","value":"9783030051716"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-05171-6_9","type":"book-chapter","created":{"date-parts":[[2018,12,5]],"date-time":"2018-12-05T10:52:06Z","timestamp":1544007126000},"page":"171-188","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Secret Sharing Schemes on Compartmental Access Structure in Presence of Cheaters"],"prefix":"10.1007","author":[{"given":"Jyotirmoy","family":"Pramanik","sequence":"first","affiliation":[]},{"given":"Partha Sarathi","family":"Roy","sequence":"additional","affiliation":[]},{"given":"Sabyasachi","family":"Dutta","sequence":"additional","affiliation":[]},{"given":"Avishek","family":"Adhikari","sequence":"additional","affiliation":[]},{"given":"Kouichi","family":"Sakurai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,5]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Adhikari, A., Morozov, K., Obana, S., Roy, P.S., Sakurai, K., Xu, R.: Efficient threshold secret sharing schemes secure against rushing cheaters. IACR Cryptology ePrint Archive 2015, 23 (2015)","DOI":"10.1007\/978-3-319-49175-2_1"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-49175-2_1","volume-title":"Information Theoretic Security","author":"A Adhikari","year":"2016","unstructured":"Adhikari, A., Morozov, K., Obana, S., Roy, P.S., Sakurai, K., Xu, R.: Efficient threshold secret sharing schemes secure against rushing cheaters. In: Nascimento, A.C.A., Barreto, P. (eds.) ICITS 2016. LNCS, vol. 10015, pp. 3\u201323. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49175-2_1"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-73458-1_11","volume-title":"Information Security and Privacy","author":"T Araki","year":"2007","unstructured":"Araki, T.: Efficient $$(k, n)$$ threshold secret sharing schemes secure against cheating from $$ n-1 $$ cheaters. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol. 4586, pp. 133\u2013142. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73458-1_11"},{"issue":"6","key":"9_CR4","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1587\/transfun.E94.A.1338","volume":"94","author":"T Araki","year":"2011","unstructured":"Araki, T., Ogata, W.: A simple and efficient secret sharing scheme secure against cheating. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94(6), 1338\u20131345 (2011)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/3-540-46885-4_45","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 89","author":"EF Brickell","year":"1990","unstructured":"Brickell, E.F.: Some ideal secret sharing schemes. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 468\u2013475. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-46885-4_45"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-29011-4_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Cevallos","year":"2012","unstructured":"Cevallos, A., Fehr, S., Ostrovsky, R., Rabani, Y.: Unconditionally-secure robust secret sharing with compact shares. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 195\u2013208. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_13"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Choudhury, A.: Brief announcement: optimal amortized secret sharing with cheater identification. In: Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, pp. 101\u2013102. ACM (2012)","DOI":"10.1145\/2332432.2332453"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/3-540-44647-8_30","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"R Cramer","year":"2001","unstructured":"Cramer, R., Damg\u00e5rd, I., Fehr, S.: On the cost of reconstructing a secret, or VSS with optimal reconstruction phase. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 503\u2013523. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_30"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Desmedt, Y., Frankel, Y., Yung, M.: Multi-receiver\/multi-sender network security: efficient authenticated multicast\/feedback. In: Eleventh Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 1992, pp. 2045\u20132054. IEEE (1992)","DOI":"10.1109\/INFCOM.1992.263476"},{"issue":"3","key":"9_CR10","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/s00145-011-9101-6","volume":"25","author":"O Farr\u00e0s","year":"2012","unstructured":"Farr\u00e0s, O., Mart\u00ed-Farr\u00e9, J., Padr\u00f3, C.: Ideal multipartite secret sharing schemes. J. Cryptol. 25(3), 434\u2013463 (2012)","journal-title":"J. Cryptol."},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BFb0053748","volume-title":"Information Security and Privacy","author":"H Ghodosi","year":"1998","unstructured":"Ghodosi, H., Pieprzyk, J., Safavi-Naini, R.: Secret sharing in multilevel and compartmented groups. In: Boyd, C., Dawson, E. (eds.) ACISP 1998. LNCS, vol. 1438, pp. 367\u2013378. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0053748"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/3-540-44750-4_33","volume-title":"Advances in Cryptology \u2014 CRYPT0 95","author":"K Kurosawa","year":"1995","unstructured":"Kurosawa, K., Obana, S., Ogata, W.: t-Cheater identifiable $$(k, n)$$ threshold secret sharing schemes. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 410\u2013423. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-44750-4_33"},{"issue":"9","key":"9_CR13","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"RJ McEliece","year":"1981","unstructured":"McEliece, R.J., Sarwate, D.V.: On sharing secrets and reed-solomon codes. Commun. ACM 24(9), 583\u2013584 (1981)","journal-title":"Commun. ACM"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-319-09843-2_7","volume-title":"Advances in Information and Computer Security","author":"S Obana","year":"2014","unstructured":"Obana, S., Tsuchida, K.: Cheating detectable secret sharing schemes supporting an arbitrary finite field. In: Yoshida, M., Mouri, K. (eds.) IWSEC 2014. LNCS, vol. 8639, pp. 88\u201397. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09843-2_7"},{"issue":"11","key":"9_CR15","doi-asserted-by":"publisher","first-page":"2230","DOI":"10.1587\/transfun.E96.A.2230","volume":"96","author":"W Ogata","year":"2013","unstructured":"Ogata, W., Araki, T.: Cheating detectable secret sharing schemes for random bit strings. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96(11), 2230\u20132234 (2013)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"3","key":"9_CR16","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s10623-012-9756-5","volume":"71","author":"W Ogata","year":"2014","unstructured":"Ogata, W., Eguchi, H.: Cheating detectable threshold scheme against most powerful cheaters for long secrets. Des. Codes Cryptogr. 71(3), 527\u2013539 (2014)","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1137\/S0895480100378689","volume":"20","author":"W Ogata","year":"2006","unstructured":"Ogata, W., Kurosawa, K., Stinson, D.R.: Optimum secret sharing scheme secure against cheating. SIAM J. Discret. Math. 20(1), 79\u201395 (2006)","journal-title":"SIAM J. Discret. Math."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, pp. 73\u201385. ACM (1989)","DOI":"10.1145\/73007.73014"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-319-12060-7_4","volume-title":"Security, Privacy, and Applied Cryptography Engineering","author":"PS Roy","year":"2014","unstructured":"Roy, P.S., Adhikari, A., Xu, R., Morozov, K., Sakurai, K.: An efficient robust secret sharing scheme with optimal cheater resiliency. In: Chakraborty, R.S., Matyas, V., Schaumont, P. (eds.) SPACE 2014. LNCS, vol. 8804, pp. 47\u201358. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12060-7_4"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Roy, P.S., Adhikari, A., Xu, R., Morozov, K., Sakurai, K.: An efficient t-cheater identifiable secret sharing scheme with optimal cheater resiliency. IACR Cryptology ePrint Archive 2014, 628 (2014)","DOI":"10.1007\/978-3-319-12060-7_4"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/BFb0054151","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"R Safavi-Naini","year":"1998","unstructured":"Safavi-Naini, R., Wang, H.: New results on multi-receiver authentication codes. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 527\u2013541. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054151"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/0-387-34799-2_30","volume-title":"Advances in Cryptology \u2014 CRYPTO 88","author":"GJ Simmons","year":"1990","unstructured":"Simmons, G.J.: How to (really) share a secret. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 390\u2013448. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_30"},{"issue":"2","key":"9_CR23","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00145-008-9027-9","volume":"22","author":"T Tassa","year":"2009","unstructured":"Tassa, T., Dyn, N.: Multipartite secret sharing by bivariate interpolation. J. Cryptol. 22(2), 227\u2013258 (2009)","journal-title":"J. Cryptol."},{"issue":"4","key":"9_CR24","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1587\/transfun.E99.A.856","volume":"99","author":"X Wang","year":"2016","unstructured":"Wang, X., Fu, F.W., Guang, X.: Probabilistic secret sharing schemes for multipartite access structures. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99(4), 856\u2013862 (2016)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"7","key":"9_CR25","first-page":"1","volume":"58","author":"Y Wang","year":"2015","unstructured":"Wang, Y., Wu, Q., Wong, D.S., Qin, B., Mu, Y., Liu, J.: Further ideal multipartite access structures from integer polymatroids. Sci. China Inf. Sci. 58(7), 1\u201313 (2015)","journal-title":"Sci. China Inf. Sci."},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-319-09843-2_6","volume-title":"Advances in Information and Computer Security","author":"R Xu","year":"2014","unstructured":"Xu, R., Morozov, K., Takagi, T.: Cheater identifiable secret sharing schemes via multi-receiver authentication. In: Yoshida, M., Mouri, K. (eds.) IWSEC 2014. LNCS, vol. 8639, pp. 72\u201387. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09843-2_6"},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-642-25243-3_11","volume-title":"Information and Communications Security","author":"Y Yu","year":"2011","unstructured":"Yu, Y., Wang, M.: A probabilistic secret sharing scheme for a compartmented access structure. In: Qing, S., Susilo, W., Wang, G., Liu, D. (eds.) ICICS 2011. LNCS, vol. 7043, pp. 136\u2013142. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25243-3_11"}],"container-title":["Lecture Notes in Computer Science","Information Systems Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05171-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T15:25:37Z","timestamp":1573053937000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05171-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030051709","9783030051716"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05171-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ICISS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Systems Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangalore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iciss2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iciss.org.in","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"51","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}