{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:13:26Z","timestamp":1742976806557,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":19,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811375606"},{"type":"electronic","value":"9789811375613"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-981-13-7561-3_19","type":"book-chapter","created":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T02:12:18Z","timestamp":1556590338000},"page":"261-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Threshold Ring Signature with Message Block Sharing"],"prefix":"10.1007","author":[{"given":"Swati","family":"Rawal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sahadeo","family":"Padhye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,30]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: ACM Symposium on the Theory of Computing, pp. 1\u201332 (1996)","DOI":"10.1145\/237814.237838"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48523-6_1","volume-title":"Automata, Languages and Programming","author":"M Ajtai","year":"1999","unstructured":"Ajtai, M.: Generating hard instances of the short basis problem. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 1\u20139. Springer, Heidelberg (1999). \n                    https:\/\/doi.org\/10.1007\/3-540-48523-6_1"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-38980-1_14","volume-title":"Applied Cryptography and Network Security","author":"R Bendlin","year":"2013","unstructured":"Bendlin, R., Krehbiel, S., Peikert, C.: How to share a lattice trapdoor: threshold protocols for signatures and (H)IBE. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol. 7954, pp. 218\u2013236. Springer, Heidelberg (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-642-38980-1_14"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/3-540-45708-9_30","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"E Bresson","year":"2002","unstructured":"Bresson, E., Stern, J., Szydlo, M.: Threshold ring signatures and applications to ad-hoc groups. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 465\u2013480. Springer, Heidelberg (2002). \n                    https:\/\/doi.org\/10.1007\/3-540-45708-9_30"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-642-14712-8_16","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2010","author":"P-L Cayrel","year":"2010","unstructured":"Cayrel, P.-L., Lindner, R., R\u00fcckert, M., Silva, R.: A lattice-based threshold ring signature scheme. In: Abdalla, M., Barreto, P.S.L.M. (eds.) LATINCRYPT 2010. LNCS, vol. 6212, pp. 255\u2013272. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-14712-8_16"},{"key":"19_CR6","unstructured":"Choi, R., Kim, K.: Lattice-based threshold signature with message block sharing. In: Proceedings of Symposium on Cryptography and Information Security (2014)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Feng, T., Gao, Y., Ma, J.: Changeable threshold signature scheme based on lattice theory. In: Proceedings of International Conference on E-Business and E-Government(ICEE), pp. 1311\u20131315 (2010)","DOI":"10.1109\/ICEE.2010.335"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"3627","DOI":"10.1002\/sec.1567","volume":"9","author":"W Fenghe","year":"2016","unstructured":"Fenghe, W., Zhenhua, L.: Short and provable secure lattice-based signature scheme in the standard model. Secur. Commun. Netw. 9, 3627\u20133632 (2016)","journal-title":"Secur. Commun. Netw."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of ACM Symposium on Theory of Computing, pp. 197\u2013206 (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-642-17373-8_23","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"SD Gordon","year":"2010","unstructured":"Gordon, S.D., Katz, J., Vaikuntanathan, V.: A group signature scheme from lattice assumptions. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 395\u2013412. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-17373-8_23"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Jiang, Y., Kong, F., Ju, X.: Lattice-based proxy signature. In: Proceedings of International Conference on Computational Intelligence and Security, pp. 382\u2013385 (2010)","DOI":"10.1109\/CIS.2010.88"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-642-29011-4_43","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"V Lyubashevsky","year":"2012","unstructured":"Lyubashevsky, V.: Lattice signatures without trapdoors. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 738\u2013755. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-29011-4_43"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/3-540-45682-1_32","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"RL Rivest","year":"2001","unstructured":"Rivest, R.L., Shamir, A., Tauman, Y.: How to leak a secret. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 552\u2013565. Springer, Heidelberg (2001). \n                    https:\/\/doi.org\/10.1007\/3-540-45682-1_32"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-642-17373-8_24","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"M R\u00fcckert","year":"2010","unstructured":"R\u00fcckert, M.: Lattice-based blind signatures. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 413\u2013430. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-17373-8_24"},{"issue":"11","key":"19_CR15","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"Adi Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. In: Proceedings of ACM, pp. 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-25243-3_2","volume-title":"Information and Communications Security","author":"J Wang","year":"2011","unstructured":"Wang, J., Sun, B.: Ring signature schemes from lattice basis delegation. In: Qing, S., Susilo, W., Wang, G., Liu, D. (eds.) ICICS 2011. LNCS, vol. 7043, pp. 15\u201328. Springer, Heidelberg (2011). \n                    https:\/\/doi.org\/10.1007\/978-3-642-25243-3_2"},{"key":"19_CR17","unstructured":"Zhang, L., Sang, Y.: A lattice-based identity-based proxy signature from bonsai trees. Int. J. Adv. Comput. Technol. 4, 99\u2013144 (2012)"},{"key":"19_CR18","unstructured":"Alwen, J., Peikert, C.: Generating shorter bases for hard random lattices. In: Proceedings of STACS 2009, pp. 75\u201386 (2009)"},{"key":"19_CR19","unstructured":"Cash, D., Hofheinz, D., Kiltz, E.: How to delegate a lattice basis. Cryptology ePrint Archive, Report 2009\/351 (2009)"}],"container-title":["Communications in Computer and Information Science","Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-7561-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T00:21:25Z","timestamp":1558398085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-13-7561-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9789811375606","9789811375613"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-7561-3_19","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"30 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISEA-ISAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security & Privacy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jaipur","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 January 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 January 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iseaisap2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.isea-sp.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"88","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"21","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":"24% - 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-5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2","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"}}]}}