乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T05:27:58Z","timestamp":1733894878449,"version":"3.30.1"},"publisher-location":"Singapore","reference-count":34,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819608874","type":"print"},{"value":"9789819608881","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T00:00:00Z","timestamp":1733875200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T00:00:00Z","timestamp":1733875200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T00:00:00Z","timestamp":1733875200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T00:00:00Z","timestamp":1733875200000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-0888-1_12","type":"book-chapter","created":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T09:12:59Z","timestamp":1733821979000},"page":"361-393","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Interval Key-Encapsulation Mechanism"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7640-4974","authenticated-orcid":false,"given":"Alexander","family":"Bienstock","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1013-6318","authenticated-orcid":false,"given":"Yevgeniy","family":"Dodis","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2324-5671","authenticated-orcid":false,"given":"Paul","family":"R\u00f6sler","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4981-1643","authenticated-orcid":false,"given":"Daniel","family":"Wichs","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,11]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","unstructured":"Alwen, J., Auerbach, B., Baig, M.A., Noval, M.C., Klein, K., Pascual-Perez, G., Pietrzak, K., Walter, M.: Grafting key trees: Efficient key management for overlapping groups. In: Nissim, K., Waters, B. (eds.) TCC\u00a02021, Part\u00a0III. LNCS, vol. 13044, pp. 222\u2013253. Springer, Heidelberg (Nov 2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-2_8","DOI":"10.1007\/978-3-030-90456-2_8"},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"Alwen, J., Coretti, S., Dodis, Y., Tselekounis, Y.: Security analysis and improvements for the IETF MLS standard for group messaging. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO\u00a02020, Part\u00a0I. LNCS, vol. 12170, pp. 248\u2013277. Springer, Heidelberg (Aug 2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_9","DOI":"10.1007\/978-3-030-56784-2_9"},{"key":"12_CR3","doi-asserted-by":"publisher","unstructured":"Alwen, J., Coretti, S., Jost, D., Mularczyk, M.: Continuous group key agreement with active security. In: Pass, R., Pietrzak, K. (eds.) TCC\u00a02020, Part\u00a0II. LNCS, vol. 12551, pp. 261\u2013290. Springer, Heidelberg (Nov 2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_10","DOI":"10.1007\/978-3-030-64378-2_10"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Auerbach, B., Kiltz, E., Poettering, B., Schoenen, S.: Lossy trapdoor permutations with improved lossiness. In: Matsui, M. (ed.) CT-RSA\u00a02019. LNCS, vol. 11405, pp. 230\u2013250. Springer, Heidelberg (Mar 2019). https:\/\/doi.org\/10.1007\/978-3-030-12612-4_12","DOI":"10.1007\/978-3-030-12612-4_12"},{"key":"12_CR5","doi-asserted-by":"publisher","unstructured":"Balli, F., R\u00f6sler, P., Vaudenay, S.: Determining the core primitive for optimally secure ratcheting. In: Moriai, S., Wang, H. (eds.) ASIACRYPT\u00a02020, Part\u00a0III. LNCS, vol. 12493, pp. 621\u2013650. Springer, Heidelberg (Dec 2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_21","DOI":"10.1007\/978-3-030-64840-4_21"},{"key":"12_CR6","doi-asserted-by":"publisher","unstructured":"Barnes, R., Beurdouche, B., Robert, R., Millican, J., Omara, E., Cohn-Gordon, K.: The Messaging Layer Security (MLS) Protocol. RFC 9420 (Jul 2023). https:\/\/doi.org\/10.17487\/RFC9420, https:\/\/www.rfc-editor.org\/info\/rfc9420","DOI":"10.17487\/RFC9420"},{"key":"12_CR7","doi-asserted-by":"publisher","unstructured":"Bienstock, A., Dodis, Y., R\u00f6sler, P.: On the price of concurrency in group ratcheting protocols. In: Pass, R., Pietrzak, K. (eds.) TCC\u00a02020, Part\u00a0II. LNCS, vol. 12551, pp. 198\u2013228. Springer, Heidelberg (Nov 2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_8","DOI":"10.1007\/978-3-030-64378-2_8"},{"key":"12_CR8","unstructured":"Bienstock, A., Dodis, Y., R\u00f6sler, P., Wichs, D.: Interval key-encapsulation mechanism. IACR Cryptol. ePrint Arch. (2024), https:\/\/eprint.iacr.org\/2024\/1454, full version of this article"},{"key":"12_CR9","doi-asserted-by":"publisher","unstructured":"Bienstock, A., Dodis, Y., Tang, Y.: Multicast key agreement, revisited. In: Galbraith, S.D. (ed.) CT-RSA\u00a02022. LNCS, vol. 13161, pp. 1\u201325. Springer, Heidelberg (Mar 2022).https:\/\/doi.org\/10.1007\/978-3-030-95312-6_1","DOI":"10.1007\/978-3-030-95312-6_1"},{"key":"12_CR10","doi-asserted-by":"publisher","unstructured":"Bienstock, A., Dodis, Y., Yeo, K.: Forward secret encrypted RAM: Lower bounds and applications. In: Nissim, K., Waters, B. (eds.) TCC\u00a02021, Part\u00a0III. LNCS, vol. 13044, pp. 62\u201393. Springer, Heidelberg (Nov 2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-2_3","DOI":"10.1007\/978-3-030-90456-2_3"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Bienstock, A., R\u00f6sler, P., Tang, Y.: Asmesh: Anonymous and secure messaging in mesh networks using stronger, anonymous double ratchet. In: CCS \u201923: 2023 ACM SIGSAC Conference on Computer and Communications Security 2023. ACM (2023)","DOI":"10.1145\/3576915.3616615"},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Degwekar, A.: On the complexity of collision resistant hash functions: New and old black-box separations. In: Hofheinz, D., Rosen, A. (eds.) TCC\u00a02019, Part\u00a0I. LNCS, vol. 11891, pp. 422\u2013450. Springer, Heidelberg (Dec 2019).https:\/\/doi.org\/10.1007\/978-3-030-36030-6_17","DOI":"10.1007\/978-3-030-36030-6_17"},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"Blaze, M., Bleumer, G., Strauss, M.: Divertible protocols and atomic proxy cryptography. In: Nyberg, K. (ed.) EUROCRYPT\u201998. LNCS, vol.\u00a01403, pp. 127\u2013144. Springer, Heidelberg (May\u00a0\/\u00a0Jun 1998).https:\/\/doi.org\/10.1007\/BFb0054122","DOI":"10.1007\/BFb0054122"},{"key":"12_CR14","doi-asserted-by":"publisher","unstructured":"Blum, M., Evans, W.S., Gemmell, P., Kannan, S., Naor, M.: Checking the correctness of memories. In: 32nd FOCS. pp. 90\u201399. IEEE Computer Society Press (Oct 1991). https:\/\/doi.org\/10.1109\/SFCS.1991.185352","DOI":"10.1109\/SFCS.1991.185352"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Boneh, D., Lewi, K., Montgomery, H.W., Raghunathan, A.: Key homomorphic PRFs and their applications. In: Canetti, R., Garay, J.A. (eds.) CRYPTO\u00a02013, Part\u00a0I. LNCS, vol.\u00a08042, pp. 410\u2013428. Springer, Heidelberg (Aug 2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_23","DOI":"10.1007\/978-3-642-40041-4_23"},{"key":"12_CR16","unstructured":"Boneh, D., Lipton, R.J.: A revocable backup system. In: USENIX Security Symposium. pp. 91\u201396 (1996)"},{"key":"12_CR17","doi-asserted-by":"publisher","unstructured":"Canetti, R., Halevi, S., Katz, J.: A forward-secure public-key encryption scheme. In: Biham, E. (ed.) EUROCRYPT\u00a02003. LNCS, vol.\u00a02656, pp. 255\u2013271. Springer, Heidelberg (May 2003).https:\/\/doi.org\/10.1007\/3-540-39200-9_16","DOI":"10.1007\/3-540-39200-9_16"},{"key":"12_CR18","doi-asserted-by":"publisher","unstructured":"Canetti, R., Krawczyk, H., Nielsen, J.B.: Relaxing chosen-ciphertext security. In: Boneh, D. (ed.) CRYPTO\u00a02003. LNCS, vol.\u00a02729, pp. 565\u2013582. Springer, Heidelberg (Aug 2003).https:\/\/doi.org\/10.1007\/978-3-540-45146-4_33","DOI":"10.1007\/978-3-540-45146-4_33"},{"key":"12_CR19","doi-asserted-by":"publisher","unstructured":"Choi, G., Durak, F.B., Vaudenay, S.: Post-Compromise Security in Self-Encryption. In: Tessaro, S. (ed.) 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0199, pp. 25:1\u201325:23. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ITC.2021.25, https:\/\/drops.dagstuhl.de\/entities\/document\/10.4230\/LIPIcs.ITC.2021.25","DOI":"10.4230\/LIPIcs.ITC.2021.25"},{"key":"12_CR20","doi-asserted-by":"publisher","unstructured":"Davidson, A., Deo, A., Lee, E., Martin, K.: Strong post-compromise secure proxy re-encryption. In: Jang-Jaccard, J., Guo, F. (eds.) ACISP 19. LNCS, vol. 11547, pp. 58\u201377. Springer, Heidelberg (Jul 2019). https:\/\/doi.org\/10.1007\/978-3-030-21548-4_4","DOI":"10.1007\/978-3-030-21548-4_4"},{"key":"12_CR21","doi-asserted-by":"publisher","unstructured":"Dodis, Y., Karthikeyan, H., Wichs, D.: Updatable public key encryption in the standard model. In: Nissim, K., Waters, B. (eds.) TCC\u00a02021, Part\u00a0III. LNCS, vol. 13044, pp. 254\u2013285. Springer, Heidelberg (Nov 2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-2_9","DOI":"10.1007\/978-3-030-90456-2_9"},{"key":"12_CR22","doi-asserted-by":"publisher","unstructured":"Dwork, C., Naor, M., Rothblum, G.N., Vaikuntanathan, V.: How efficient can memory checking be? In: Reingold, O. (ed.) TCC\u00a02009. LNCS, vol.\u00a05444, pp. 503\u2013520. Springer, Heidelberg (Mar 2009).https:\/\/doi.org\/10.1007\/978-3-642-00457-5_30","DOI":"10.1007\/978-3-642-00457-5_30"},{"key":"12_CR23","doi-asserted-by":"publisher","unstructured":"Fuchsbauer, G., Kamath, C., Klein, K., Pietrzak, K.: Adaptively secure proxy re-encryption. In: Lin, D., Sako, K. (eds.) PKC\u00a02019, Part\u00a0II. LNCS, vol. 11443, pp. 317\u2013346. Springer, Heidelberg (Apr 2019). https:\/\/doi.org\/10.1007\/978-3-030-17259-6_11","DOI":"10.1007\/978-3-030-17259-6_11"},{"key":"12_CR24","doi-asserted-by":"publisher","unstructured":"Gentry, C., Silverberg, A.: Hierarchical ID-based cryptography. In: Zheng, Y. (ed.) ASIACRYPT\u00a02002. LNCS, vol.\u00a02501, pp. 548\u2013566. Springer, Heidelberg (Dec 2002).https:\/\/doi.org\/10.1007\/3-540-36178-2_34","DOI":"10.1007\/3-540-36178-2_34"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Haidar, C.A., Passel\u00e8gue, A., Stehl\u00e9, D.: Efficient updatable public-key encryption from lattices. In: Advances in Cryptology - ASIACRYPT 2023 - 29th International Conference on the Theory and Application of Cryptology and Information Security, Guangzhou, China, December 4-8, 2023, Proceedings, Part V. Lecture Notes in Computer Science, vol. 14442, pp. 342\u2013373. Springer (2023)","DOI":"10.1007\/978-981-99-8733-7_11"},{"key":"12_CR26","doi-asserted-by":"publisher","unstructured":"Jaeger, J., Stepanovs, I.: Optimal channel security against fine-grained state compromise: The safety of messaging. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO\u00a02018, Part\u00a0I. LNCS, vol. 10991, pp. 33\u201362. Springer, Heidelberg (Aug 2018).https:\/\/doi.org\/10.1007\/978-3-319-96884-1_2","DOI":"10.1007\/978-3-319-96884-1_2"},{"key":"12_CR27","doi-asserted-by":"publisher","unstructured":"Jost, D., Maurer, U., Mularczyk, M.: Efficient ratcheting: Almost-optimal guarantees for secure messaging. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT\u00a02019, Part\u00a0I. LNCS, vol. 11476, pp. 159\u2013188. Springer, Heidelberg (May 2019).https:\/\/doi.org\/10.1007\/978-3-030-17653-2_6","DOI":"10.1007\/978-3-030-17653-2_6"},{"key":"12_CR28","doi-asserted-by":"publisher","unstructured":"Miao, P., Patranabis, S., Watson, G.J.: Unidirectional updatable encryption and proxy re-encryption from DDH. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC\u00a02023, Part\u00a0II. LNCS, vol. 13941, pp. 368\u2013398. Springer, Heidelberg (May 2023).https:\/\/doi.org\/10.1007\/978-3-031-31371-4_13","DOI":"10.1007\/978-3-031-31371-4_13"},{"key":"12_CR29","doi-asserted-by":"publisher","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: Ladner, R.E., Dwork, C. (eds.) 40th ACM STOC. pp. 187\u2013196. ACM Press (May 2008).https:\/\/doi.org\/10.1145\/1374376.1374406","DOI":"10.1145\/1374376.1374406"},{"key":"12_CR30","unstructured":"Perrin, T., Marlinspike, M.: The double ratchet algorithm (2016), https:\/\/signal.org\/docs\/specifications\/doubleratchet\/"},{"key":"12_CR31","unstructured":"Poettering, B., R\u00f6sler, P.: Asynchronous ratcheted key exchange. Cryptology ePrint Archive, Report 2018\/296 (2018), https:\/\/eprint.iacr.org\/2018\/296"},{"key":"12_CR32","doi-asserted-by":"publisher","unstructured":"Poettering, B., R\u00f6sler, P.: Towards bidirectional ratcheted key exchange. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO\u00a02018, Part\u00a0I. LNCS, vol. 10991, pp. 3\u201332. Springer, Heidelberg (Aug 2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_1","DOI":"10.1007\/978-3-319-96884-1_1"},{"key":"12_CR33","doi-asserted-by":"crossref","unstructured":"R\u00f6sler, P., Mainka, C., Schwenk, J.: More is less: On the end-to-end security of group chats in signal, whatsapp, and threema. In: 2018 IEEE European Symposium on Security and Privacy, EuroS &P 2018, London, United Kingdom, April 24-26, 2018. pp. 415\u2013429. IEEE (2018)","DOI":"10.1109\/EuroSP.2018.00036"},{"key":"12_CR34","doi-asserted-by":"publisher","unstructured":"R\u00f6sler, P., Slamanig, D., Striecks, C.: Unique-path identity based encryption with applications to strongly secure messaging. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14008, pp. 3\u201334. Springer, Heidelberg (Apr 2023).https:\/\/doi.org\/10.1007\/978-3-031-30589-4_1","DOI":"10.1007\/978-3-031-30589-4_1"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0888-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T09:36:19Z","timestamp":1733823379000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0888-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,11]]},"ISBN":["9789819608874","9789819608881"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0888-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,11]]},"assertion":[{"value":"11 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}