{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:20:22Z","timestamp":1743135622966,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031326356"},{"type":"electronic","value":"9783031326363"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-32636-3_3","type":"book-chapter","created":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T14:02:40Z","timestamp":1683813760000},"page":"37-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bridges Connecting Encryption Schemes"],"prefix":"10.1007","author":[{"given":"Mugurel","family":"Barcau","sequence":"first","affiliation":[]},{"given":"Cristian","family":"Lupa\u015fcu","sequence":"additional","affiliation":[]},{"given":"Vicen\u0163iu","family":"Pa\u015fol","sequence":"additional","affiliation":[]},{"given":"George C.","family":"\u0162urca\u015f","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,12]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-662-44371-2_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"J Alperin-Sheriff","year":"2014","unstructured":"Alperin-Sheriff, J., Peikert, C.: Faster bootstrapping with polynomial error. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 297\u2013314. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_17"},{"key":"3_CR2","volume-title":"Category Theory","author":"S Awodey","year":"2010","unstructured":"Awodey, S.: Category Theory, 2nd edn. Oxford University Press, Oxford (2010)","edition":"2"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/978-3-030-12942-2_37","volume-title":"Innovative Security Solutions for Information Technology and Communications","author":"M Barcau","year":"2019","unstructured":"Barcau, M., Pa\u015fol, V., Ple\u015fca, C.: Monoidal encryption over $$(\\mathbb{F}_2,\\cdot )$$. In: Lanet, J.-L., Toma, C. (eds.) SECITC 2018. LNCS, vol. 11359, pp. 504\u2013517. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12942-2_37"},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1515\/jmc-2019-0026","volume":"14","author":"C Boura","year":"2020","unstructured":"Boura, C., Gama, N., Georgieva, M., Jetchev, D.: CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes. J. Math. Cryptol. 14(1), 316\u2013338 (2020)","journal-title":"J. Math. Cryptol."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory 6(13(3)), 1\u201336 (2014)","DOI":"10.1145\/2633600"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/978-3-642-32009-5_50","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"Z Brakerski","year":"2012","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 868\u2013886. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-319-63688-7_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"G Castagnos","year":"2017","unstructured":"Castagnos, G., Imbert, L., Laguillaumie, F.: Encryption switching protocols revisited: switching modulo p. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 255\u2013287. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_9"},{"key":"3_CR8","unstructured":"certSIGN RD: CSGN GitHub repository. https:\/\/github.com\/certFHE\/CSGN. Accessed 20 May 2021"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","volume":"33","author":"I Chillotti","year":"2020","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: TFHE: fast fully homomorphic encryptionover the torus. J. Cryptol. 33, 34\u201391 (2020)","journal-title":"J. Cryptol."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Cohen, A.: What about bob? The inadequacy of CPA security for proxy reencryption. PKC (2), 287\u2013316 (2019)","DOI":"10.1007\/978-3-030-17259-6_10"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-662-53018-4_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"G Couteau","year":"2016","unstructured":"Couteau, G., Peters, T., Pointcheval, D.: Encryption switching protocols. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 308\u2013338. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_12"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/978-3-319-96884-1_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"C Dobraunig","year":"2018","unstructured":"Dobraunig, C., et al.: Rasta: a cipher with low ANDdepth and few ANDs per bit. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 662\u2013692. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_22"},{"key":"3_CR13","unstructured":"Dobraunig, C., Grassi, L., Helminger, L., Rechberger, C., Schofnegger, M., Walch, R.: Pasta: a case for hybrid homomorphic encryption. In: Cryptology ePrint Archive (2021)"},{"key":"3_CR14","unstructured":"Dodis, Y., Ivan, A.: Proxy cryptography revisited. In: Proceedings of the Tenth Network and Distributed System Security Symposium, February 2003"},{"key":"3_CR15","unstructured":"Dottling, N., Nishimaki, R.: Universal Proxy Re-Encryption, Cryptology ePrint Archive, Report 2018\/840, to appear in PKC \u201921"},{"key":"3_CR16","unstructured":"Fan, J., Vercauteren, F.: Somewhat Practical Fully Homomorphic Encryption, IACR Cryptol. ePrint Arch., vol. 2012, p. 144 (2012)"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Gentry, C: A fully homomorphic encryption scheme. PhD thesis, Stanford University (2009)","DOI":"10.1145\/1536414.1536440"},{"issue":"3","key":"3_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/1666420.1666444","volume":"53","author":"C Gentry","year":"2010","unstructured":"Gentry, C.: Computing arbitrary functions of encrypted data. Commun. ACM 53(3), 97\u2013105 (2010)","journal-title":"Commun. ACM"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1007\/978-3-642-32009-5_49","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"C Gentry","year":"2012","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Homomorphic evaluation of the AES circuit. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 850\u2013867. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_49"},{"issue":"6","key":"3_CR20","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0020-0190(90)90010-U","volume":"34","author":"O Goldreich","year":"1990","unstructured":"Goldreich, O.: A note on computational indistinguishability. Inf. Process. Lett. 34(6), 277\u2013281 (1990)","journal-title":"Inf. Process. Lett."},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption and how to play mental poker keeping secret all partial information, In: STOC 1982: Proceedings of the fourteenth annual ACM symposium on Theory of computing, pp. 365\u2013377. Association for Computing Machinery, New York, NY (1982)","DOI":"10.1145\/800070.802212"},{"issue":"2","key":"3_CR22","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR23","unstructured":"HElib library homepage: An Implementation of homomorphic encryption by Halevi and Shoup. https:\/\/github.com\/shaih\/HElib\/"},{"key":"3_CR24","unstructured":"Redmond, W.A.: Microsoft Research, Microsoft SEAL (release 3.6), November 2020. https:\/\/github.com\/Microsoft\/SEAL"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Sander, T., Young, A., Yung, M.: non-interactive crypto computing for $$NC^1$$. In: FOCS 1999: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pp. 554\u2013566. IEEE Computer Society, NW Washington, DC, United States (1999)","DOI":"10.1109\/SFFCS.1999.814630"},{"key":"3_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21936-3","volume-title":"Cryptography Made Simple","author":"N Smart","year":"2016","unstructured":"Smart, N.: Cryptography Made Simple. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-21936-3"}],"container-title":["Lecture Notes in Computer Science","Innovative Security Solutions for Information Technology and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32636-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T06:46:36Z","timestamp":1729406796000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32636-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031326356","9783031326363"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32636-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"12 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SecITC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Technology and Communications Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"itc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.secitc.eu","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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53","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":"19","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":"36% - 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.68","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.5","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)"}}]}}