{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:01:11Z","timestamp":1742968871494,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031515828"},{"type":"electronic","value":"9783031515835"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-51583-5_8","type":"book-chapter","created":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T18:03:41Z","timestamp":1704391421000},"page":"117-138","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Generic Insider Secure Signcryption with\u00a0Non-Interactive Non-Repudiation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2010-6198","authenticated-orcid":false,"given":"Ngarenon","family":"Togde","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0691-1644","authenticated-orcid":false,"given":"Augustin P.","family":"Sarr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,5]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-89411-7_2","volume-title":"Practical Signcryption","author":"JH An","year":"2010","unstructured":"An, J.H., Rabin, T.: Security for signcryption: the two-user model. In: Dent, A., Zheng, Y. (eds.) Practical Signcryption, pp. 21\u201342. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-540-89411-7_2"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-31284-7_13","volume-title":"Applied Cryptography and Network Security","author":"A Arriaga","year":"2012","unstructured":"Arriaga, A., Barbosa, M., Farshim, P.: On the joint security of signature and encryption schemes under randomness reuse: efficiency and security amplification. In: Bao, F., Samarati, P., Zhou, J. (eds.) ACNS 2012. LNCS, vol. 7341, pp. 206\u2013223. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31284-7_13"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-319-98113-0_6","volume-title":"Security and Cryptography for Networks","author":"C Badertscher","year":"2018","unstructured":"Badertscher, C., Banfi, F., Maurer, U.: A constructive perspective on signcryption security. In: Catalano, D., De Prisco, R. (eds.) SCN 2018. LNCS, vol. 11035, pp. 102\u2013120. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_6"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-540-89411-7_3","volume-title":"Practical Signcryption","author":"J Baek","year":"2010","unstructured":"Baek, J., Steinfeld, R.: Security for signcryption: the multi-user model. In: Dent, A., Zheng, Y. (eds.) Practical Signcryption, pp. 43\u201353. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-540-89411-7_3"},{"issue":"2","key":"8_CR5","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s00145-007-0211-0","volume":"20","author":"J Baek","year":"2007","unstructured":"Baek, J., Steinfeld, R., Zheng, Y.: Formal proofs for the security of signcryption. J. Cryptol. 20(2), 203\u2013235 (2007)","journal-title":"J. Cryptol."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Barnes, R., Bhargavan, K., Lipp, B., Wood, C.: RFC 9180: Hybrid public key encryption (2022)","DOI":"10.17487\/RFC9180"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BFb0054014","volume-title":"Public Key Cryptography","author":"F Bao","year":"1998","unstructured":"Bao, F., Deng, R.H.: A signcryption scheme with signature directly verifiable by public key. In: Imai, H., Zheng, Y. (eds.) PKC 1998. LNCS, vol. 1431, pp. 55\u201359. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054014"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/11745853_32","volume-title":"Public Key Cryptography - PKC 2006","author":"TE Bj\u00f8rstad","year":"2006","unstructured":"Bj\u00f8rstad, T.E., Dent, A.W.: Building better signcryption schemes with tag-KEMs. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 491\u2013507. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11745853_32"},{"key":"8_CR9","unstructured":"Boneh, D., Shoup, V.: A graduate course in applied cryptography. Draft 0.6 (2023). https:\/\/toc.cryptobook.us\/"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-642-21554-4_13","volume-title":"Applied Cryptography and Network Security","author":"D Chiba","year":"2011","unstructured":"Chiba, D., Matsuda, T., Schuldt, J.C.N., Matsuura, K.: Efficient generic constructions of signcryption with insider security in the multi-user setting. In: Lopez, J., Tsudik, G. (eds.) ACNS 2011. LNCS, vol. 6715, pp. 220\u2013237. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21554-4_13"},{"key":"8_CR11","unstructured":"Ducklin, P.: Serious security: google finds fake but trusted SSL certificates for its domains, made in France. Naked Security-Award-Winning Computer Security, News, Opinion, Advice and Research from SOPHOS, pp. 09\u201312 (2013)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-17499-5_9","volume-title":"Transactions on Computational Science X","author":"J Fan","year":"2010","unstructured":"Fan, J., Zheng, Y., Tang, X.: Signcryption with non-interactive non-repudiation without random oracles. In: Gavrilova, M.L., Tan, C.J.K., Moreno, E.D. (eds.) Transactions on Computational Science X. LNCS, vol. 6340, pp. 202\u2013230. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17499-5_9"},{"key":"8_CR13","unstructured":"Fisher, D.: Final Report on DigiNotar Hack Shows Total Compromise of CA Servers. Threatpost, 10\/31\/12. https:\/\/threatpost.com\/final-report-diginotar-hack-shows-total-compromise-ca-servers-103112\/77170\/"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-642-29011-4_32","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"SA Kakvi","year":"2012","unstructured":"Kakvi, S.A., Kiltz, E.: Optimal security proofs for full domain hash, revisited. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 537\u2013553. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_32"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Kelsey, J., Chang, S.J., Perlner, R.: SHA-3 derived functions: cSHAKE, KMAC, TupleHash, and ParallelHash. NIST Special Publication, vol. 800, p. 185 (2016)","DOI":"10.6028\/NIST.SP.800-185"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Krawczyk, H., Bellare, M., Canetti, R.: RFC2104: HMAC: Keyed-hashing for message authentication (1997)","DOI":"10.17487\/rfc2104"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Krovetz, T. (Ed.): RFC 4418: UMAC: Message Authentication Code using Universal Hashing (2006)","DOI":"10.17487\/rfc4418"},{"issue":"1","key":"8_CR18","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s10623-004-3806-6","volume":"37","author":"J Malone-Lee","year":"2005","unstructured":"Malone-Lee, J.: Signcryption with non-interactive non-repudiation. Des. Codes Cryptogr. 37(1), 81\u2013109 (2005)","journal-title":"Des. Codes Cryptogr."},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-10628-6_22","volume-title":"Progress in Cryptology - INDOCRYPT 2009","author":"T Matsuda","year":"2009","unstructured":"Matsuda, T., Matsuura, K., Schuldt, J.C.N.: Efficient constructions of signcryption schemes and signcryption composability. In: Roy, B., Sendrier, N. (eds.) INDOCRYPT 2009. LNCS, vol. 5922, pp. 321\u2013342. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10628-6_22"},{"key":"8_CR20","unstructured":"Ngarenon, T., Sarr, A.P.: A Computational Diffie-Hellman based Insider Secure Signcryption with Non Interactive Non Repudiation (full version) (2022). https:\/\/hal.science\/hal-03628351\/document"},{"key":"8_CR21","series-title":"Springer Proceedings in Mathematics & Statistics","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-19-9307-7_8","volume-title":"ICMC 2022","author":"T Ngarenon","year":"2023","unstructured":"Ngarenon, T., Sarr, A.P.: A computational Diffie-Hellman based insider secure signcryption with non-interactive non-repudiation. In: Rushi Kumar, B., Ponnusamy, S., Giri, D., Thuraisingham, B., Clifton, C.W., Carminati, B. (eds.) ICMC 2022. Springer Proceedings in Mathematics & Statistics, vol. 415. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-981-19-9307-7_8"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-030-16458-4_24","volume-title":"Codes, Cryptology and Information Security","author":"AP Sarr","year":"2019","unstructured":"Sarr, A.P., Seye, P.B., Ngarenon, T.: A practical and insider secure signcryption with non-interactive non-repudiation. In: Carlet, C., Guilley, S., Nitaj, A., Souidi, E.M. (eds.) C2SI 2019. LNCS, vol. 11445, pp. 409\u2013429. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-16458-4_24"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-540-89598-5_5","volume-title":"Advances in Information and Computer Security","author":"CH Tan","year":"2008","unstructured":"Tan, C.H.: Signcryption scheme in multi-user setting without random oracles. In: Matsuura, K., Fujisaki, E. (eds.) IWSEC 2008. LNCS, vol. 5312, pp. 64\u201382. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89598-5_5"},{"key":"8_CR24","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BFb0052234","volume-title":"CRYPTO 1997","author":"Y Zheng","year":"1997","unstructured":"Zheng, Y.: Digital signcryption or how to achieve cost(signature & encryption) $$\\ll $$ cost(signature) + cost(encryption). In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 165\u2013179. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052234"}],"container-title":["Lecture Notes in Computer Science","Security, Privacy, and Applied Cryptography Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-51583-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T18:04:51Z","timestamp":1704391491000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-51583-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031515828","9783031515835"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-51583-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"5 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPACE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security, Privacy, and Applied Cryptography Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Roorkee","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"space2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iitr.ac.in\/space2023\/","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":"45","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":"14","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":"2.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)"}}]}}