{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:29:59Z","timestamp":1757543399530,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T00:00:00Z","timestamp":1684972800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T00:00:00Z","timestamp":1684972800000},"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":["Multimed Tools Appl"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s11042-023-15435-5","type":"journal-article","created":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T06:02:23Z","timestamp":1684994543000},"page":"4519-4531","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Post-quantum secure recipient revocable broadcast encryption supporting anonymity"],"prefix":"10.1007","volume":"83","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0797-7255","authenticated-orcid":false,"given":"Amit Kumar","family":"Singh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kamalesh","family":"Acharya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sourav","family":"Mukhopadhyay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,25]]},"reference":[{"key":"15435_CR1","first-page":"102436","volume":"51","author":"K Acharya","year":"2020","unstructured":"Acharya K (2020) Secure and efficient public key multi-channel broadcast encryption schemes. J Inf Secur Appl 51:102436","journal-title":"J Inf Secur Appl"},{"key":"15435_CR2","doi-asserted-by":"crossref","unstructured":"Acharya K, Dutta R (2017) Provable secure constructions for broadcast encryption with personalized messages. In: International conference on provable security, pp 329\u2013348. Springer","DOI":"10.1007\/978-3-319-68637-0_20"},{"key":"15435_CR3","doi-asserted-by":"crossref","unstructured":"Acharya K, Dutta R (2017) Recipient revocable broadcast encryption schemes without random oracles. In: International conference on information security and cryptology, pp 191\u2013213. Springer","DOI":"10.1007\/978-3-319-78556-1_11"},{"key":"15435_CR4","doi-asserted-by":"crossref","unstructured":"Ajtai M (1996) Generating hard instances of lattice problems (extended abstract). In: Proceedings of the 28th annual ACM Symposium on theory of computing, STOC \u201996, pp 99\u2013108, New York, NY, USA. Association for computing machinery","DOI":"10.1145\/237814.237838"},{"key":"15435_CR5","doi-asserted-by":"crossref","unstructured":"Alwen J, Peikert C (2009) Generating shorter bases for hard random lattices","DOI":"10.1007\/s00224-010-9278-3"},{"key":"15435_CR6","doi-asserted-by":"crossref","unstructured":"Barth A, Boneh D, Waters B (2006) Privacy in encrypted content distribution using private broadcast encryption. In: International conference on financial cryptography and data security, pp 52\u201364. Springer","DOI":"10.1007\/11889663_4"},{"key":"15435_CR7","doi-asserted-by":"crossref","unstructured":"Boneh D, Gentry C, Waters B (2005) Collusion resistant broadcast encryption with short ciphertexts and private keys. In: Annual international cryptology conference, pp 258\u2013275. Springer","DOI":"10.1007\/11535218_16"},{"key":"15435_CR8","doi-asserted-by":"crossref","unstructured":"Boneh D, Waters B, Zhandry M (2014) Low overhead broadcast encryption from multilinear maps. In: Annual cryptology conference, pp 206\u2013223. Springer","DOI":"10.1007\/978-3-662-44371-2_12"},{"issue":"4","key":"15435_CR9","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.1007\/s00453-016-0242-8","volume":"79","author":"D Boneh","year":"2017","unstructured":"Boneh D, Zhandry M (2017) Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. Algorithmica 79(4):1233\u20131285","journal-title":"Algorithmica"},{"key":"15435_CR10","unstructured":"De Meyer L (2015) Security of lwe-based cryptosystems. Full Version: https:\/\/www.esat.kuleuven.be\/cosic\/publications\/thesis-267.pdf"},{"key":"15435_CR11","doi-asserted-by":"crossref","unstructured":"Delerabl\u00e9e C (2007) Identity-based broadcast encryption with constant size ciphertexts and private keys. In: International Conference on the Theory and Application of Cryptology and Information Security, pp 200\u2013215. Springer","DOI":"10.1007\/978-3-540-76900-2_12"},{"key":"15435_CR12","doi-asserted-by":"crossref","unstructured":"Do XT, Phan DH, Yung M (2020) A concise bounded anonymous broadcast yielding combinatorial trace-and-revoke schemes. In: International conference on applied cryptography and network security, pp 145\u2013164. Springer","DOI":"10.1007\/978-3-030-57878-7_8"},{"key":"15435_CR13","doi-asserted-by":"crossref","unstructured":"Fazio N, Perera IM (2012) Outsider-anonymous broadcast encryption with sublinear ciphertexts. In: International workshop on public key cryptography, pp 225\u2013242. Springer","DOI":"10.1007\/978-3-642-30057-8_14"},{"key":"15435_CR14","doi-asserted-by":"crossref","unstructured":"Fiat A, Naor M (1993) Broadcast encryption. In: Annual international cryptology conference, pp 480\u2013491. Springer","DOI":"10.1007\/3-540-48329-2_40"},{"key":"15435_CR15","doi-asserted-by":"crossref","unstructured":"Gentry C, Peikert C, Vaikuntanathan V (2008) Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the 48th Annual ACM Symposium on theory of computing, STOC \u201908, pp 197\u2013206, New York, NY, USA, Association for Computing Machinery","DOI":"10.1145\/1374376.1374407"},{"issue":"12","key":"15435_CR16","doi-asserted-by":"publisher","first-page":"1809","DOI":"10.1093\/comjnl\/bxx060","volume":"60","author":"J Lai","year":"2017","unstructured":"Lai J, Mu Y, Guo F, Chen R (2017) Fully privacy-preserving id-based broadcast encryption with authorization. Comput J 60(12):1809\u20131821","journal-title":"Comput J"},{"key":"15435_CR17","doi-asserted-by":"crossref","unstructured":"Lai J, Mu Y, Guo F, Susilo W, Chen R (2016) Anonymous identity-based broadcast encryption with revocation for file sharing. In: Australasian conference on information security and privacy, pp 223\u2013239. Springer","DOI":"10.1007\/978-3-319-40367-0_14"},{"issue":"5","key":"15435_CR18","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1007\/s00779-017-1045-x","volume":"21","author":"J Lai","year":"2017","unstructured":"Lai J, Mu Y, Guo F, Susilo W, Chen R (2017) Fully privacy-preserving and revocable id-based broadcast encryption for data access control in smart city. Pers Ubiquit Comput 21(5):855\u2013868","journal-title":"Pers Ubiquit Comput"},{"key":"15435_CR19","doi-asserted-by":"crossref","unstructured":"Libert B, Paterson KG, Quaglia EA (2012) Anonymous broadcast encryption: Adaptive security and efficient constructions in the standard model. In: International workshop on public key cryptography, pp 206\u2013224. Springer","DOI":"10.1007\/978-3-642-30057-8_13"},{"key":"15435_CR20","doi-asserted-by":"crossref","unstructured":"Ling S, Phan DH, Stehl\u00e9 D, Steinfeld R (2014) Hardness of k-lwe and applications in traitor tracing. In: Garay JA , Gennaro R (eds) Advances in Cryptology \u2013 CRYPTO 2014, pages 315\u2013334, Berlin, Heidelberg. Springer Berlin Heidelberg","DOI":"10.1007\/978-3-662-44371-2_18"},{"key":"15435_CR21","doi-asserted-by":"crossref","unstructured":"Regev O (2005) On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the 37th Annual ACM Symposium on theory of computing, STOC \u201905, pages 84\u201393, New York, NY, USA, Association for computing machinery","DOI":"10.1145\/1060590.1060603"},{"key":"15435_CR22","doi-asserted-by":"crossref","unstructured":"Shor PW (1994) Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp 124\u2013134","DOI":"10.1109\/SFCS.1994.365700"},{"key":"15435_CR23","doi-asserted-by":"crossref","unstructured":"Susilo W, Chen R, Guo F, Yang G, Mu Y, Chow Y-W (2016) Recipient revocable identity-based broadcast encryption: How to revoke some recipients in ibbe without knowledge of the plaintext. In: Proceedings of the 11th ACM on Asia conference on computer and communications security, ASIA CCS \u201916, pp 201\u2013210, New York, NY, USA, ACM","DOI":"10.1145\/2897845.2897848"},{"key":"15435_CR24","doi-asserted-by":"crossref","unstructured":"Zhao XW, Li H (2013) Improvement on a multi-channel broadcast encryption scheme. In: Applied mechanics and materials, vol 427, pp 2163\u20132169. Trans Tech Publ","DOI":"10.4028\/www.scientific.net\/AMM.427-429.2163"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-023-15435-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-023-15435-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-023-15435-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,6]],"date-time":"2024-01-06T05:25:13Z","timestamp":1704518713000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-023-15435-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,25]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["15435"],"URL":"https:\/\/doi.org\/10.1007\/s11042-023-15435-5","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"type":"print","value":"1380-7501"},{"type":"electronic","value":"1573-7721"}],"subject":[],"published":{"date-parts":[[2023,5,25]]},"assertion":[{"value":"6 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We acknowledge that no other people or organization are involved in this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}