{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:44:39Z","timestamp":1742953479366,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030354220"},{"type":"electronic","value":"9783030354237"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-35423-7_2","type":"book-chapter","created":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T00:02:46Z","timestamp":1575849766000},"page":"23-44","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Modification Tolerant Signature Schemes: Location and Correction"],"prefix":"10.1007","author":[{"given":"Tha\u00eds Bardini","family":"Idalino","sequence":"first","affiliation":[]},{"given":"Lucia","family":"Moura","sequence":"additional","affiliation":[]},{"given":"Carlisle","family":"Adams","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,19]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/11555827_10","volume-title":"Computer Security \u2013 ESORICS 2005","author":"G Ateniese","year":"2005","unstructured":"Ateniese, G., Chou, D.H., de Medeiros, B., Tsudik, G.: Sanitizable signatures. In: di Vimercati, S.C., Syverson, P., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol. 3679, pp. 159\u2013177. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11555827_10"},{"issue":"2","key":"2_CR2","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1049\/ip-vis:20020168","volume":"149","author":"PSLM Barreto","year":"2002","unstructured":"Barreto, P.S.L.M., Kim, H.Y., Rijmen, V.: Toward secure public-key blockwise fragile authentication watermarking. IEE Proc. Vis. Image Sig. Process. 149(2), 57\u201362 (2002)","journal-title":"IEE Proc. Vis. Image Sig. Process."},{"issue":"4","key":"2_CR3","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s10559-012-9428-5","volume":"48","author":"RG Biyashev","year":"2012","unstructured":"Biyashev, R.G., Nyssanbayeva, S.E.: Algorithm for creating a digital signature with error detection and correction. Cybernet. Syst. Anal. 48(4), 489\u2013497 (2012)","journal-title":"Cybernet. Syst. Anal."},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/978-3-642-22685-4_50","volume-title":"Computing and Combinatorics","author":"A De Bonis","year":"2011","unstructured":"De Bonis, A., Di Crescenzo, G.: Combinatorial group testing for corruption localizing hashing. In: Fu, B., Du, D.-Z. (eds.) COCOON 2011. LNCS, vol. 6842, pp. 579\u2013591. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22685-4_50"},{"key":"2_CR5","unstructured":"De Bonis, A., Di Crescenzo, G.: A group testing approach to improved corruption localizing hashing. Cryptology ePrint Archive, Report 2011\/562 (2011). https:\/\/eprint.iacr.org\/2011\/562"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-30840-1_1","volume-title":"Information Security and Cryptology - ICISC 2015","author":"D Derler","year":"2016","unstructured":"Derler, D., P\u00f6hls, H.C., Samelin, K., Slamanig, D.: A general framework for redactable signatures and new constructions. In: Kwon, S., Yun, A. (eds.) ICISC 2015. LNCS, vol. 9558, pp. 3\u201319. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30840-1_1"},{"key":"2_CR7","unstructured":"Di Crescenzo, G., Ge, R., Arce, G.R.: Design and analysis of dbmac, an error localizing message authentication code. In: IEEE Global Telecommunications Conference, GLOBECOM 2004, vol. 4, pp. 2224\u20132228 (2004)"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/3-540-36563-X_18","volume-title":"Topics in Cryptology \u2014 CT-RSA 2003","author":"P D\u2019Arco","year":"2003","unstructured":"D\u2019Arco, P., Stinson, D.R.: Fault tolerant and distributed broadcast encryption. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 263\u2013280. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36563-X_18"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF02772959","volume":"51","author":"P Erd\u00f6s","year":"1985","unstructured":"Erd\u00f6s, P., Frankl, P., F\u00fcredi, Z.: Families of finite sets in which no set is covered by the union of R others. Israel J. Math. 51, 79\u201389 (1985)","journal-title":"Israel J. Math."},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1006\/jcta.1996.0012","volume":"73","author":"Z F\u00fcredi","year":"1996","unstructured":"F\u00fcredi, Z.: On r-cover-free families. J. Comb. Theory 73, 172\u2013173 (1996)","journal-title":"J. Comb. Theory"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/11496137_15","volume-title":"Applied Cryptography and Network Security","author":"MT Goodrich","year":"2005","unstructured":"Goodrich, M.T., Atallah, M.J., Tamassia, R.: Indexing information for data forensics. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 206\u2013221. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11496137_15"},{"issue":"10","key":"2_CR12","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1016\/j.ipl.2015.02.014","volume":"115","author":"TB Idalino","year":"2015","unstructured":"Idalino, T.B., Moura, L., Cust\u00f3dio, R.F., Panario, D.: Locating modifications in signed data for partial data integrity. Inf. Process. Lett. 115(10), 731\u2013737 (2015)","journal-title":"Inf. Process. Lett."},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-45760-7_17","volume-title":"Topics in Cryptology \u2014 CT-RSA 2002","author":"R Johnson","year":"2002","unstructured":"Johnson, R., Molnar, D., Song, D., Wagner, D.: Homomorphic signature schemes. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol. 2271, pp. 244\u2013262. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45760-7_17"},{"key":"2_CR14","doi-asserted-by":"publisher","DOI":"10.1201\/9781420010756","volume-title":"Introduction to Modern Cryptography","author":"J Katz","year":"2007","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography. Chapman & Hall\/CRC, Washington (2007)"},{"key":"2_CR15","volume-title":"Handbook of Applied Cryptography","author":"AJ Menezes","year":"1996","unstructured":"Menezes, A.J., Vanstone, S.A., Van Oorschot, P.C.: Handbook of Applied Cryptography, 1st edn. CRC Press Inc., Boca Raton (1996)","edition":"1"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Niederreiter, H., Wang, H., Xing, C.: Function fields over finite fields and their applications to cryptography. In: Garcia, A., Stichtenoth, H. (eds.) Topics in Geometry, Coding Theory and Cryptography. Algebra and Applications, pp. 59\u2013104 (2006)","DOI":"10.1007\/1-4020-5334-4_2"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-44495-5_13","volume-title":"Progress in Cryptology \u2014INDOCRYPT 2000","author":"J Pastuszak","year":"2000","unstructured":"Pastuszak, J., Pieprzyk, J., Seberry, J.: Codes identifying bad signatures in batches. In: Roy, B., Okamoto, E. (eds.) INDOCRYPT 2000. LNCS, vol. 1977, pp. 143\u2013154. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44495-5_13"},{"key":"2_CR18","unstructured":"P\u00f6hls, H.C.: Increasing the Legal Probative Value of Cryptographically Private Malleable Signatures. Ph.D. Thesis, University of Passau (2018)"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"7982","DOI":"10.1109\/TIT.2011.2163296","volume":"57","author":"E Porat","year":"2011","unstructured":"Porat, E., Rothschild, A.: Explicit nonadaptive combinatorial group testing schemes. IEEE Trans. Inf. Theory 57, 7982\u20137989 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2_CR20","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":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/3-540-45861-1_22","volume-title":"Information Security and Cryptology \u2014 ICISC 2001","author":"R Steinfeld","year":"2002","unstructured":"Steinfeld, R., Bull, L., Zheng, Y.: Content extraction signatures. In: Kim, K. (ed.) ICISC 2001. LNCS, vol. 2288, pp. 285\u2013304. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45861-1_22"},{"key":"2_CR22","doi-asserted-by":"publisher","DOI":"10.1201\/9781315282497","volume-title":"Cryptography: Theory and Practice","author":"D Stinson","year":"2018","unstructured":"Stinson, D., Paterson, M.: Cryptography: Theory and Practice, 4th edn. CRC Press, Boca Raton (2018)","edition":"4"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-14496-7_12","volume-title":"Information Theoretic Security","author":"GM Zaverucha","year":"2010","unstructured":"Zaverucha, G.M., Stinson, D.R.: Group testing and batch verification. In: Kurosawa, K. (ed.) ICITS 2009. LNCS, vol. 5973, pp. 140\u2013157. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14496-7_12"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35423-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:44:54Z","timestamp":1709833494000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35423-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030354220","9783030354237"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35423-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"19 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hyderabad","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":"15 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.isical.ac.in\/~indocrypt2019\/#\/","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 (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":"90","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":"28","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":"0","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":"31% - 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.67","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":"6","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":"Please note that there were 110 submissions, but 20 were not peer-reviewed because they were withdrawn before the deadline or they violated the submission policy.","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)"}}]}}