{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:49:27Z","timestamp":1757540967845,"version":"3.40.3"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030656096"},{"type":"electronic","value":"9783030656102"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-65610-2_11","type":"book-chapter","created":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T09:03:39Z","timestamp":1607159019000},"page":"169-184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Cheating Detectable Ramp Secret Sharing with Optimal Cheating Resiliency"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2189-4440","authenticated-orcid":false,"given":"Jyotirmoy","family":"Pramanik","sequence":"first","affiliation":[]},{"given":"Sabyasachi","family":"Dutta","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5788-5554","authenticated-orcid":false,"given":"Partha Sarathi","family":"Roy","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7768-4629","authenticated-orcid":false,"given":"Avishek","family":"Adhikari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,6]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-49175-2_1","volume":"2016","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. ICITS 2016, 3\u201323 (2016). https:\/\/doi.org\/10.1007\/978-3-319-49175-2_1","journal-title":"ICITS"},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"Adhikari, M.R., Adhikari, A.: Basic Modern Algebra with Applications. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-81-322-1599-8","DOI":"10.1007\/978-81-322-1599-8"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/CANDAR.2019.00009","volume":"2019","author":"T Agematsu","year":"2019","unstructured":"Agematsu, T., Obana, S.: Almost optimal cheating-detectable (2, 2, n) ramp secret sharing scheme. CANDAR 2019, 1\u20139 (2019). https:\/\/doi.org\/10.1109\/CANDAR.2019.00009","journal-title":"CANDAR"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-73458-1\\_11","volume":"2007","author":"T Araki","year":"2007","unstructured":"Araki, T.: Efficient (k, n) threshold secret sharing schemes secure against cheating from n-1 cheaters. ACISP 2007, 133\u2013142 (2007). https:\/\/doi.org\/10.1007\/978-3-540-73458-1_11","journal-title":"ACISP"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Beimel, A.: Secret-sharing schemes: a survey. In: Coding and Cryptology - Third International Workshop, IWCC 2011, Qingdao, China, May 30-June 3, 2011. Proceedings, pp. 11\u201346 (2011). https:\/\/doi.org\/10.1007\/978-3-642-20901-7_2","DOI":"10.1007\/978-3-642-20901-7_2"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-319-98113-0\\_17","volume":"2018","author":"A Beimel","year":"2018","unstructured":"Beimel, A., Othman, H.: Evolving ramp secret-sharing schemes. SCN 2018, 313\u2013332 (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_17","journal-title":"SCN"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Beimel, A., Othman, H.: Evolving ramp secret sharing with a small gap. In: EUROCRYPT 2020 Part I, pp. 529\u2013555 (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_19","DOI":"10.1007\/978-3-030-45721-1_19"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/62212.62213","volume":"1988","author":"M Ben-Or","year":"1988","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). STOC 1988, 1\u201310 (1988). https:\/\/doi.org\/10.1145\/62212.62213","journal-title":"STOC"},{"key":"11_CR9","doi-asserted-by":"publisher","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: International Workshop on Managing Requirements Knowledge (AFIPS), pp. 313\u2013317 (1979). https:\/\/doi.org\/10.1109\/AFIPS.1979.98","DOI":"10.1109\/AFIPS.1979.98"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-39568-7\\_20","volume":"1984","author":"GR Blakley","year":"1984","unstructured":"Blakley, G.R., Meadows, C.A.: Security of ramp schemes. CRYPTO 1984, 242\u2013268 (1984). https:\/\/doi.org\/10.1007\/3-540-39568-7_20","journal-title":"CRYPTO"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/3-540-48658-5\\_17","volume":"1994","author":"C Blundo","year":"1994","unstructured":"Blundo, C., Santis, A.D., Crescenzo, G.D., Gaggia, A.G., Vaccaro, U.: Multi-secret sharing schemes. CRYPTO 1994, 150\u2013163 (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_17","journal-title":"CRYPTO"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1007\/3-540-56503-5\\_68","volume":"1993","author":"C Blundo","year":"1993","unstructured":"Blundo, C., Santis, A.D., Vaccaro, U.: Efficient sharing of many secrets. STACS 1993, 692\u2013703 (1993). https:\/\/doi.org\/10.1007\/3-540-56503-5_68","journal-title":"STACS"},{"issue":"2","key":"11_CR13","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1023\/A:1013856431727","volume":"25","author":"S Cabello","year":"2002","unstructured":"Cabello, S., Padr\u00f3, C., S\u00e1ez, G.: Secret sharing schemes with detection of cheaters for a general access structure. Des. Codes Cryptography 25(2), 175\u2013188 (2002)","journal-title":"Des. Codes Cryptography"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/3-540-48285-7\\_10","volume":"1993","author":"M Carpentieri","year":"1993","unstructured":"Carpentieri, M., Santis, A.D., Vaccaro, U.: Size of shares and probability of cheating in threshold schemes. EUROCRYPT 1993, 118\u2013125 (1993). https:\/\/doi.org\/10.1007\/3-540-48285-7_10","journal-title":"EUROCRYPT"},{"issue":"7","key":"11_CR15","doi-asserted-by":"publisher","first-page":"4620","DOI":"10.1109\/TIT.2019.2902151","volume":"65","author":"I Cascudo","year":"2019","unstructured":"Cascudo, I., Gundersen, J.S., Ruano, D.: Improved bounds on the threshold gap in ramp secret sharing. IEEE Trans. Inf. Theory 65(7), 4620\u20134633 (2019). https:\/\/doi.org\/10.1109\/TIT.2019.2902151","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/62212.62214","volume":"1988","author":"D Chaum","year":"1988","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). STOC 1988, 11\u201319 (1988). https:\/\/doi.org\/10.1145\/62212.62214","journal-title":"STOC"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-78967-3\\_26","volume":"2008","author":"H Chen","year":"2008","unstructured":"Chen, H., Cramer, R., de Haan, R., Cascudo Pueyo, I.: Strongly multiplicative ramp schemes from high degree rational points on curves. EUROCRYPT 2008, 451\u2013470 (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_26","journal-title":"EUROCRYPT"},{"issue":"11\u201312","key":"11_CR18","doi-asserted-by":"publisher","first-page":"2695","DOI":"10.1016\/j.mcm.2011.07.024","volume":"57","author":"Q Chen","year":"2013","unstructured":"Chen, Q., Pei, D., Tang, C., Yue, Q., Ji, T.: A note on ramp secret sharing schemes from error-correcting codes. Math. Comput. Model. 57(11\u201312), 2695\u20132702 (2013). https:\/\/doi.org\/10.1016\/j.mcm.2011.07.024","journal-title":"Math. Comput. Model."},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/SFCS.1995.492461","volume":"1995","author":"B Chor","year":"1995","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. SFCS 1995, 41\u201350 (1995). https:\/\/doi.org\/10.1109\/SFCS.1995.492461","journal-title":"SFCS"},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Crescenzo, G.D.: Sharing one secret vs. sharing many secrets. Theor. Comput. Sci. 295, 123\u2013140 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(02)00399-7","DOI":"10.1016\/S0304-3975(02)00399-7"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/3-540-57220-1\\_47","volume":"1992","author":"Y Desmedt","year":"1992","unstructured":"Desmedt, Y.: Treshold cryptosystems (invited talk). AUSCRYPT 1992, 3\u201314 (1992). https:\/\/doi.org\/10.1007\/3-540-57220-1_47","journal-title":"AUSCRYPT"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Desmedt, Y., Dutta, S., Morozov, K.: Evolving perfect hash families: a combinatorial viewpoint of evolving secret sharing. In: CANS 2019, Proceedings, pp. 291\u2013307 (2019)","DOI":"10.1007\/978-3-030-31578-8_16"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Dutta, S., Roy, P.S., Adhikari, A., Sakurai, K.: On the robustness of visual cryptographic schemes. In: IWDW 2016, Revised Selected Papers, pp. 251\u2013262 (2016)","DOI":"10.1007\/978-3-319-53465-7_19"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Dutta, S., Roy, P.S., Fukushima, K., Kiyomoto, S., Sakurai, K.: Secret sharing on evolving multi-level access structure. In: WISA 2019, Revised Selected Papers, pp. 180\u2013191 (2019)","DOI":"10.1007\/978-3-030-39303-8_14"},{"key":"11_CR25","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-47555-9\\_2","volume":"1992","author":"Y Frankel","year":"1992","unstructured":"Frankel, Y., Desmedt, Y.: Classification of ideal homomorphic threshold schemes over finite abelian groups (extended abstract). EUROCRYPT 1992, 25\u201334 (1992). https:\/\/doi.org\/10.1007\/3-540-47555-9_2","journal-title":"EUROCRYPT"},{"key":"11_CR26","doi-asserted-by":"publisher","unstructured":"Geil, O., Martin, S., Mart\u00ednez-Pe\u00f1as, U., Matsumoto, R., Ruano, D.: On asymptotically good ramp secret sharing schemes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(12), 2699\u20132708 (2017). https:\/\/doi.org\/10.1587\/transfun.E100.A.2699","DOI":"10.1587\/transfun.E100.A.2699"},{"key":"11_CR27","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1145\/28395.28420","volume":"1987","author":"O Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. STOC 1987, 218\u2013229 (1987). https:\/\/doi.org\/10.1145\/28395.28420","journal-title":"STOC"},{"issue":"4","key":"11_CR28","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1515\/popets-2016-0036","volume":"2016","author":"R Henry","year":"2016","unstructured":"Henry, R.: Polynomial batch codes for efficient IT-PIR. PoPETs 2016(4), 202\u2013218 (2016). https:\/\/doi.org\/10.1515\/popets-2016-0036","journal-title":"PoPETs"},{"key":"11_CR29","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1109\/ISIT.2005.1523536","volume":"2005","author":"M Iwamoto","year":"2005","unstructured":"Iwamoto, M., Yamamoto, H.: Strongly secure ramp secret sharing schemes. IEEE ISIT 2005, 1221\u20131225 (2005). https:\/\/doi.org\/10.1109\/ISIT.2005.1523536","journal-title":"IEEE ISIT"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Komargodski, I., Naor, M., Yogev, E.: How to share a secret, infinitely. In: TCC 2016-B, Proceedings, Part II, pp. 485\u2013514 (2016)","DOI":"10.1007\/978-3-662-53644-5_19"},{"key":"11_CR31","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-030-31578-8\\_17","volume":"2019","author":"F Lin","year":"2019","unstructured":"Lin, F., Ling, S., Wang, H., Zeng, N.: Threshold changeable ramp secret sharing. CANS 2019, 308\u2013327 (2019). https:\/\/doi.org\/10.1007\/978-3-030-31578-8_17","journal-title":"CANS"},{"key":"11_CR32","doi-asserted-by":"publisher","unstructured":"Matsumoto, R.: Strong security of the strongly multiplicative ramp secret sharing based on algebraic curves. IEICE Transactions 98-A(7), 1576\u20131578 (2015). https:\/\/doi.org\/10.1587\/transfun.E98.A.1576","DOI":"10.1587\/transfun.E98.A.1576"},{"issue":"9","key":"11_CR33","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). https:\/\/doi.org\/10.1145\/358746.358762","journal-title":"Commun. ACM"},{"key":"11_CR34","first-page":"247","volume":"2020","author":"I Meraouche","year":"2020","unstructured":"Meraouche, I., Dutta, S., Sakurai, K.: 3-party adversarial cryptography. EIDWT 2020, 247\u2013258 (2020)","journal-title":"EIDWT"},{"key":"11_CR35","first-page":"340","volume":"2016","author":"W Nakamura","year":"2016","unstructured":"Nakamura, W., Yamamoto, H., Chan, T.: A ramp threshold secret sharing scheme against cheating by substitution attacks. ISITA 2016, 340\u2013344 (2016)","journal-title":"ISITA"},{"key":"11_CR36","doi-asserted-by":"publisher","unstructured":"Nakamura, W., Yamamoto, H., Chan, T.: A cheating-detectable (k, L, n) ramp secret sharing scheme. In: IEICE Transactions 100-A(12), 2709\u20132719 (2017). https:\/\/doi.org\/10.1587\/transfun.E100.A.2709","DOI":"10.1587\/transfun.E100.A.2709"},{"key":"11_CR37","unstructured":"Nishiara, M., Takizawa, K.: Strongly secure secret sharing scheme with ramp threshold based on shamir\u2019s polynomial interpolation scheme. The IEICE Trans. on Fund. of Electr., Comm. and Comp. Sc. (Jp. ed.) A 92(12), 1009\u20131013 (2009). https:\/\/ci.nii.ac.jp\/naid\/110007483234\/en\/"},{"key":"11_CR38","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-319-09843-2\\_7","volume":"2014","author":"S Obana","year":"2014","unstructured":"Obana, S., Tsuchida, K.: Cheating detectable secret sharing schemes supporting an arbitrary finite field. IWSEC 2014, 88\u201397 (2014). https:\/\/doi.org\/10.1007\/978-3-319-09843-2_7","journal-title":"IWSEC"},{"issue":"3","key":"11_CR39","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 Cryptography 71(3), 527\u2013539 (2014). https:\/\/doi.org\/10.1007\/s10623-012-9756-5","journal-title":"Des. Codes Cryptography"},{"issue":"8","key":"11_CR40","doi-asserted-by":"publisher","first-page":"690","DOI":"10.3217\/jucs-004-08-0690","volume":"4","author":"W Ogata","year":"1998","unstructured":"Ogata, W., Kurosawa, K.: Some basic properties of general nonperfect secret sharing schemes. J. UCS 4(8), 690\u2013704 (1998). https:\/\/doi.org\/10.3217\/jucs-004-08-0690","journal-title":"J. UCS"},{"issue":"1","key":"11_CR41","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. Discrete Math. 20(1), 79\u201395 (2006). https:\/\/doi.org\/10.1137\/S0895480100378689","journal-title":"SIAM J. Discrete Math."},{"key":"11_CR42","doi-asserted-by":"publisher","unstructured":"Ogata, W., Kurosawa, K., Tsujii, S.: Nonperfect secret sharing schemes. AUSCRYPT 1992, 56\u201366 (1992). https:\/\/doi.org\/10.1007\/3-540-57220-1_52","DOI":"10.1007\/3-540-57220-1_52"},{"key":"11_CR43","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BFb0000422","volume":"1994","author":"K Okada","year":"1994","unstructured":"Okada, K., Kurosawa, K.: Lower bound on the size of shares of nonperfect secret sharing schemes. ASIACRYPT 1994, 33\u201341 (1994). https:\/\/doi.org\/10.1007\/BFb0000422","journal-title":"ASIACRYPT"},{"issue":"2","key":"11_CR44","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1515\/gcc-2019-2006","volume":"11","author":"J Pramanik","year":"2019","unstructured":"Pramanik, J., Adhikari, A.: Ramp secret sharing with cheater identification in presence of rushing cheaters. Groups Complexity Cryptol. 11(2), 103\u2013113 (2019). https:\/\/doi.org\/10.1515\/gcc-2019-2006","journal-title":"Groups Complexity Cryptol."},{"key":"11_CR45","doi-asserted-by":"crossref","unstructured":"Pramanik, J., Adhikari, A.: Evolving secret sharing with essential participants. Cryptology ePrint Archive, Report 2020\/1035 (2020)","DOI":"10.1007\/978-981-15-7834-2_64"},{"key":"11_CR46","doi-asserted-by":"crossref","unstructured":"Pramanik, J., Roy, P.S., Dutta, S., Adhikari, A., Sakurai, K.: Secret sharing schemes on compartmental access structure in presence of cheaters. In: ICISS 2018, Proceedings, pp. 171\u2013188 (2018)","DOI":"10.1007\/978-3-030-05171-6_9"},{"key":"11_CR47","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/73007.73014","volume":"1989","author":"T Rabin","year":"1989","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). ACM STC 1989, 73\u201385 (1989). https:\/\/doi.org\/10.1145\/73007.73014","journal-title":"ACM STC"},{"key":"11_CR48","doi-asserted-by":"crossref","unstructured":"Roy, P.S., Adhikari, A., Xu, R., Morozov, K., Sakurai, K.: An efficient robust secret sharing scheme with optimal cheater resiliency. In: SPACE 2014, Proceedings, pp. 47\u201358 (2014)","DOI":"10.1007\/978-3-319-12060-7_4"},{"key":"11_CR49","doi-asserted-by":"crossref","unstructured":"Roy, P.S., Das, A., Adhikari, A.: Computationally secure cheating identifiable multi-secret sharing for general access structure. In: ICDCIT 2015, Proceedings, pp. 278\u2013287 (2015)","DOI":"10.1007\/978-3-319-14977-6_27"},{"issue":"11","key":"11_CR50","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. Commun. ACM 22(11), 612\u2013613 (1979). https:\/\/doi.org\/10.1145\/359168.359176","journal-title":"Commun. ACM"},{"issue":"2","key":"11_CR51","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF02252871","volume":"1","author":"M Tompa","year":"1988","unstructured":"Tompa, M., Woll, H.: How to share a secret with cheaters. J. Cryptology 1(2), 133\u2013138 (1988). https:\/\/doi.org\/10.1007\/BF02252871","journal-title":"J. Cryptology"},{"key":"11_CR52","doi-asserted-by":"crossref","unstructured":"Waring, E.: Problems concerning interpolations. Phil. Trans. R. Soc. Lond. 69, 59\u201367 (1779)","DOI":"10.1098\/rstl.1779.0008"},{"key":"11_CR53","unstructured":"Yamamoto, H.: On secret sharing systems using (k, l, n) threshold scheme. IEICE Trans. Fundamentals (Japanese Edition), A 68(9), 945\u2013952 (1985)"},{"key":"11_CR54","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1109\/ISIT.2007.4557361","volume":"2007","author":"M Yoshida","year":"2007","unstructured":"Yoshida, M., Fujiwara, T.: Secure construction for nonlinear function threshold ramp secret sharing. IEEE ISIT 2007, 1041\u20131045 (2007). https:\/\/doi.org\/10.1109\/ISIT.2007.4557361","journal-title":"IEEE ISIT"},{"issue":"2","key":"11_CR55","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s11128-014-0863-2","volume":"14","author":"P Zhang","year":"2015","unstructured":"Zhang, P., Matsumoto, R.: Quantum strongly secure ramp secret sharing. Quantum Information Process. 14(2), 715\u2013729 (2015). https:\/\/doi.org\/10.1007\/s11128-014-0863-2","journal-title":"Quantum Information Process."}],"container-title":["Lecture Notes in Computer Science","Information Systems Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65610-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:47:15Z","timestamp":1710269235000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-65610-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030656096","9783030656102"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65610-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Jammu","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iciss2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/isrdc.iitb.ac.in\/iciss2020\/","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 (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21% - 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 (provided by the conference organizers)"}},{"value":"3,5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"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 (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"In addition, 3 work-in-progress papers were published.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}