{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:38:58Z","timestamp":1742931538358,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030109691"},{"type":"electronic","value":"9783030109707"}],"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-10970-7_3","type":"book-chapter","created":{"date-parts":[[2019,1,12]],"date-time":"2019-01-12T10:12:15Z","timestamp":1547287935000},"page":"50-70","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Analysis and Improvement of an Authentication Scheme in Incremental Cryptography"],"prefix":"10.1007","author":[{"given":"Louiza","family":"Khati","sequence":"first","affiliation":[]},{"given":"Damien","family":"Vergnaud","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,13]]},"reference":[{"key":"3_CR1","unstructured":"Atighehchi, K.: Space-efficient, byte-wise incremental and perfectly private encryption schemes. Cryptology ePrint Archive, Report 2014\/104 (2014). http:\/\/eprint.iacr.org\/2014\/104"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Atighehchi, K., Muntean, T.: Towards fully incremental cryptographic schemes. In: Chen, K., Xie, Q., Qiu, W., Li, N., Tzeng, W.G. (eds.) ASIACCS 2013, 8\u201310 May 2013, pp. 505\u2013510. ACM Press, Hangzhou (2013)","DOI":"10.1145\/2484313.2484380"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-48658-5_22","volume-title":"Advances in Cryptology \u2014 CRYPTO 1994","author":"M Bellare","year":"1994","unstructured":"Bellare, M., Goldreich, O., Goldwasser, S.: Incremental cryptography: the case of hashing and Signing. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 216\u2013233. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_22"},{"key":"3_CR4","unstructured":"Bellare, M., Goldreich, O., Goldwasser, S.: Incremental cryptography and application to virus protection. In: 27th ACM STOC, 29 May\u20131 June 1995, pp. 45\u201356. ACM Press, Las Vegas (1995)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/3-540-44750-4_2","volume-title":"Advances in Cryptology \u2014 CRYPT0 1995","author":"M Bellare","year":"1995","unstructured":"Bellare, M., Gu\u00e9rin, R., Rogaway, P.: XOR MACs: new methods for message authentication using finite pseudorandom functions. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 15\u201328. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-44750-4_2"},{"key":"3_CR6","unstructured":"Bellare, M., Micciancio, D.: A new paradigm for collision-free hashing: incrementality at reduced cost. Cryptology ePrint Archive, Report 1997\/001 (1997). http:\/\/eprint.iacr.org\/1997\/001"},{"key":"3_CR7","unstructured":"Bershad, B.N., Mogul, J.C. (eds.): 7th Symposium on Operating Systems Design and Implementation (OSDI 2006), 6\u20138 November, Seattle, WA, USA. USENIX Association (2006). https:\/\/www.usenix.org\/publications\/proceedings\/?f[0]=im$_$group$_$audience3A137"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/3-540-45473-X_9","volume-title":"Fast Software Encryption","author":"E Buonanno","year":"2002","unstructured":"Buonanno, E., Katz, J., Yung, M.: Incremental unforgeable encryption. In: Matsui, M. (ed.) FSE 2001. LNCS, vol. 2355, pp. 109\u2013124. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45473-X_9"},{"key":"3_CR9","unstructured":"Fischlin, M.: Lower bounds for the signature size of incremental schemes. In: 38th FOCS, 19\u201322 October 1997, pp. 438\u2013447. IEEE Computer Society Press, Miami Beach (1997)"},{"key":"3_CR10","unstructured":"Gantz, J., Reinsel, D.: The digital universe in 2010: big data, bigger digital shadows, and biggest growth in the far east. EMC report (2013). https:\/\/www.emc.com\/collateral\/analyst-reports\/idc-the-digital-universe-in-2020.pdf"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/3-540-45311-3_5","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2001","author":"BM Goi","year":"2001","unstructured":"Goi, B.M., Siddiqi, M.U., Chuah, H.T.: Incremental hash function based on pair chaining & modular arithmetic combining. In: Rangan, C.P., Ding, C. (eds.) Progress in Cryptology \u2013 INDOCRYPT 2001, vol. 2247, pp. 50\u201361. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45311-3_5"},{"issue":"3-4","key":"3_CR12","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.earscirev.2006.05.001","volume":"78","author":"Jane K. Hart","year":"2006","unstructured":"Hart, J.K., Martinez, K.: Environmental sensor networks: a revolution in the earth system science? Earth-Sci. Rev. 78(3), 177\u2013191 (2006). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0012825206000511","journal-title":"Earth-Science Reviews"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Itani, W., Kayssi, A.I., Chehab, A.: Energy-efficient incremental integrity for securing storage in mobile cloud computing. In: 2010 International Conference on Energy Aware Computing, pp. 1\u20132 (2010)","DOI":"10.1109\/ICEAC.2010.5702296"},{"key":"3_CR14","unstructured":"Micciancio, D.: Oblivious data structures: applications to cryptography. In: 29th ACM STOC, 4\u20136 May 1997, pp. 456\u2013464. ACM Press, El Paso (1997)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Mihajloska, H., Gligoroski, D., Samardjiska, S.: Reviving the idea of incremental cryptography for the zettabyte era use case: incremental hash functions based on SHA-3. Cryptology ePrint Archive, Report 2015\/1028 (2015). http:\/\/eprint.iacr.org\/2015\/1028","DOI":"10.1007\/978-3-319-39028-4_8"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/978-3-642-29011-4_37","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"I Mironov","year":"2012","unstructured":"Mironov, I., Pandey, O., Reingold, O., Segev, G.: Incremental deterministic public-key encryption. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 628\u2013644. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_37"},{"issue":"2","key":"3_CR17","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.cose.2005.12.006","volume":"25","author":"Raphael C.-W. Phan","year":"2006","unstructured":"Phan, R.C., Wagner, D.A.: Security considerations for incremental hash functions based on pair block chaining. Comput. Secur. 25(2), 131\u2013136 (2006). https:\/\/doi.org\/10.1016\/j.cose.2005.12.006","journal-title":"Computers & Security"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-319-31301-6_23","volume-title":"Selected Areas in Cryptography \u2013 SAC 2015","author":"Y Sasaki","year":"2016","unstructured":"Sasaki, Y., Yasuda, K.: A new mode of operation for incremental authenticated encryption with associated data. In: Dunkelman, O., Keliher, L. (eds.) SAC 2015. LNCS, vol. 9566, pp. 397\u2013416. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31301-6_23"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography \u2013 SAC 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10970-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T01:03:18Z","timestamp":1673485398000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10970-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030109691","9783030109707"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10970-7_3","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":"13 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Selected Areas in Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Calgary, AB","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"15 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ucalgary.ca\/cpsc\/selected-areas-cryptography\/","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":"57","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":"22","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":"39% - 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","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":"4","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}