{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T15:06:41Z","timestamp":1773155201447,"version":"3.50.1"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2017,9,20]],"date-time":"2017-09-20T00:00:00Z","timestamp":1505865600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100006754","name":"Army Research Laboratory","doi-asserted-by":"crossref","award":["W911NF-15-C-0226, W911NF-15-C-0233 and W911NF-15-C-0236"],"award-info":[{"award-number":["W911NF-15-C-0226, W911NF-15-C-0233 and W911NF-15-C-0236"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100011039","name":"Intelligence Advanced Research Projects Activity","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100011039","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CNS-1350619 and CNS-1414119"],"award-info":[{"award-number":["CNS-1350619 and CNS-1414119"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Simons Investigator Award Agreement"},{"name":"Alfred P. Sloan Research Fellowship, the Microsoft Faculty Fellowship, the NEC Corporation, and a Steven and Renee Finn Career Development Chair from MIT"},{"DOI":"10.13039\/100011038","name":"Office of the Director of National Intelligence","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100011038","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100009226","name":"National Security Agency","doi-asserted-by":"crossref","award":["H98230-15-1-0274"],"award-info":[{"award-number":["H98230-15-1-0274"]}],"id":[{"id":"10.13039\/100009226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Priv. Secur."],"published-print":{"date-parts":[[2017,11,30]]},"abstract":"<jats:p>We develop two IND-CPA-secure multihop unidirectional Proxy Re-Encryption (PRE) schemes by applying the Ring-LWE (RLWE) key switching approach from the homomorphic encryption literature. Unidirectional PRE is ideal for secure publish-subscribe operations where a publisher encrypts information using a public key without knowing upfront who the subscriber will be and what private key will be used for decryption. The proposed PRE schemes provide a multihop capability, meaning that when PRE-encrypted information is published onto a PRE-enabled server, the server can either delegate access to specific clients or enable other servers the right to delegate access. Our first scheme (which we call NTRU-ABD-PRE) is based on a variant of the NTRU-RLWE homomorphic encryption scheme. Our second and main PRE scheme (which we call BV-PRE) is built on top of the Brakerski-Vaikuntanathan (BV) homomorphic encryption scheme and relies solely on the RLWE assumption.<\/jats:p><jats:p>We present an open-source C++ implementation of both schemes and discuss several algorithmic and software optimizations. We examine parameter selection tradeoffs in the context of security, runtime\/latency, throughput, ciphertext expansion, memory usage, and multihop capabilities. Our experimental analysis demonstrates that BV-PRE outperforms NTRU-ABD-PRE in both single-hop and multihop settings. The BV-PRE scheme has a lower time and space complexity than existing IND-CPA-secure lattice-based PRE schemes and requires small concrete parameters, making the scheme computationally efficient for use on low-resource embedded systems while still providing 100 bits of security. We present practical recommendations for applying the PRE schemes to several use cases of ad hoc information sharing for publish-subscribe operations.<\/jats:p>","DOI":"10.1145\/3128607","type":"journal-article","created":{"date-parts":[[2017,9,20]],"date-time":"2017-09-20T12:35:19Z","timestamp":1505910919000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":64,"title":["Fast Proxy Re-Encryption for Publish\/Subscribe Systems"],"prefix":"10.1145","volume":"20","author":[{"given":"Yuriy","family":"Polyakov","sequence":"first","affiliation":[{"name":"New Jersey Institute of Technology 8 Massachusetts Institute of Technology, Cambridge MA"}]},{"given":"Kurt","family":"Rohloff","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology, Newark, NJ"}]},{"given":"Gyana","family":"Sahu","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology, Newark, NJ"}]},{"given":"Vinod","family":"Vaikuntanathan","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge MA"}]}],"member":"320","published-online":{"date-parts":[[2017,9,20]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53018-4_6"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03515-4_1"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1127345.1127346"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/HST.2013.6581570"},{"key":"e_1_2_1_5_1","volume-title":"Advances in Cryptology (EUROCRYPT\u201998)","author":"Blaze Matt","unstructured":"Matt Blaze , Gerrit Bleumer , and Martin Strauss . 1998. Divertible protocols and atomic proxy cryptography . In Advances in Cryptology (EUROCRYPT\u201998) . Springer , 127--144. Matt Blaze, Gerrit Bleumer, and Martin Strauss. 1998. Divertible protocols and atomic proxy cryptography. In Advances in Cryptology (EUROCRYPT\u201998). Springer, 127--144."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45239-0_4"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2633600"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.12"},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Zvika Brakerski and Vinod Vaikuntanathan. 2011a. Fully homomorphic encryption from ring-LWE and security for key dependent messages. In Advances In Cryptology (CRYPTO\u201911). 505--524. Zvika Brakerski and Vinod Vaikuntanathan. 2011a. Fully homomorphic encryption from ring-LWE and security for key dependent messages. In Advances In Cryptology (CRYPTO\u201911). 505--524.","DOI":"10.1007\/978-3-642-22792-9_29"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2899007.2899011"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315269"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_1"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1112\/S1461157016000371"},{"key":"e_1_2_1_14_1","series-title":"Lecture Notes in Computer Science","volume-title":"Recent results on modular multiplications for smart cards","author":"Dhem Jean-Fran\u00e7ois","unstructured":"Jean-Fran\u00e7ois Dhem and Jean-Jacques Quisquater . 2000. Recent results on modular multiplications for smart cards . In Smart Card Research and Applications, Jean-Jacques Quisquater and Bruce Schneier (Eds.). Lecture Notes in Computer Science , Vol. 1820 . Springer , Berlin , 336--352. Jean-Fran\u00e7ois Dhem and Jean-Jacques Quisquater. 2000. Recent results on modular multiplications for smart cards. In Smart Card Research and Applications, Jean-Jacques Quisquater and Bruce Schneier (Eds.). Lecture Notes in Computer Science, Vol. 1820. Springer, Berlin, 336--352."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"e_1_2_1_19_1","volume-title":"Silverman","author":"Hoffstein Jeffrey","year":"1998","unstructured":"Jeffrey Hoffstein , Jill Pipher , and Joseph H . Silverman . 1998 . NTRU : A ring-based public key cryptosystem. In Algorithmic Number Theory, Joe P. Buhler (Ed.). Lecture Notes in Computer Science, Vol. 1423 . Springer , Berlin, 267--288. Jeffrey Hoffstein, Jill Pipher, and Joseph H. Silverman. 1998. NTRU: A ring-based public key cryptosystem. In Algorithmic Number Theory, Joe P. Buhler (Ed.). Lecture Notes in Computer Science, Vol. 1423. Springer, Berlin, 267--288."},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the Network and Distributed System Security Symposium (NDSS\u201903)","author":"Ivan Anca-Andreea","year":"2003","unstructured":"Anca-Andreea Ivan and Yevgeniy Dodis . 2003 . Proxy cryptography revisited . In Proceedings of the Network and Distributed System Security Symposium (NDSS\u201903) . Anca-Andreea Ivan and Yevgeniy Dodis. 2003. Proxy cryptography revisited. In Proceedings of the Network and Distributed System Security Symposium (NDSS\u201903)."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54631-0_5"},{"key":"e_1_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Richard Lindner and Chris Peikert. 2011. Better key sizes (and attacks) for LWE-based encryption. In CT-RSA. 319--339. Richard Lindner and Chris Peikert. 2011. Better key sizes (and attacks) for LWE-based encryption. In CT-RSA. 319--339.","DOI":"10.1007\/978-3-642-19074-2_21"},{"key":"e_1_2_1_23_1","volume-title":"Johann Gro\u00dfsch\u00e4dl, Howon Kim, and Ingrid Verbauwhede.","author":"Liu Zhe","year":"2015","unstructured":"Zhe Liu , Hwajeong Seo , Sujoy Sinha Roy , Johann Gro\u00dfsch\u00e4dl, Howon Kim, and Ingrid Verbauwhede. 2015 . Efficient Ring-LWE Encryption on 8-Bit AVR Processors. Springer , Berlin,, 663--682. Zhe Liu, Hwajeong Seo, Sujoy Sinha Roy, Johann Gro\u00dfsch\u00e4dl, Howon Kim, and Ingrid Verbauwhede. 2015. Efficient Ring-LWE Encryption on 8-Bit AVR Processors. Springer, Berlin,, 663--682."},{"key":"e_1_2_1_24_1","first-page":"94","article-title":"Multikey fully homomorphic encryption and on-the-fly multiparty computation","volume":"2013","author":"L\u00f3pez-Alt Adriana","year":"2013","unstructured":"Adriana L\u00f3pez-Alt , Eran Tromer , and Vinod Vaikuntanathan . 2013 . Multikey fully homomorphic encryption and on-the-fly multiparty computation . IACR Cryptology ePrint Archive 2013 (2013), 94 . http:\/\/eprint.iacr.org\/2013\/094 Full Version of the STOC 2012 paper with the same title. Adriana L\u00f3pez-Alt, Eran Tromer, and Vinod Vaikuntanathan. 2013. Multikey fully homomorphic encryption and on-the-fly multiparty computation. IACR Cryptology ePrint Archive 2013 (2013), 94. http:\/\/eprint.iacr.org\/2013\/094 Full Version of the STOC 2012 paper with the same title.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"e_1_2_1_26_1","volume-title":"Advances In Cryptology (EUROCRYPT\u201913)","author":"Lyubashevsky Vadim","unstructured":"Vadim Lyubashevsky , Chris Peikert , and Oded Regev . 2013. A toolkit for ring-LWE cryptography . In Advances In Cryptology (EUROCRYPT\u201913) . Springer , Berlin , 35--54. Vadim Lyubashevsky, Chris Peikert, and Oded Regev. 2013. A toolkit for ring-LWE cryptography. In Advances In Cryptology (EUROCRYPT\u201913). Springer, Berlin, 35--54."},{"key":"e_1_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Daniele Micciancio. 2010. Duality in lattice cryptography. In Public Key Cryptography (PKC\u201910). Invited talk. Daniele Micciancio. 2010. Duality in lattice cryptography. In Public Key Cryptography (PKC\u201910). Invited talk.","DOI":"10.1007\/978-1-4419-5906-5_417"},{"key":"e_1_2_1_28_1","volume-title":"Encyclopedia of Cryptography and Security","author":"Micciancio Daniele","unstructured":"Daniele Micciancio . 2011. Lattice-based cryptography . In Encyclopedia of Cryptography and Security . Springer , 713--715. Daniele Micciancio. 2011. Lattice-based cryptography. In Encyclopedia of Cryptography and Security. Springer, 713--715."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447360"},{"key":"e_1_2_1_31_1","volume-title":"Post Quantum Cryptography","author":"Micciancio Daniele","unstructured":"Daniele Micciancio and Oded Regev . 2009. Lattice-based cryptography . In Post Quantum Cryptography . Springer , 147--191. Daniele Micciancio and Oded Regev. 2009. Lattice-based cryptography. In Post Quantum Cryptography. Springer, 147--191."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2714576.2714585"},{"key":"e_1_2_1_33_1","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology (CRYPTO\u201910), Tal Rabin (Ed.)","author":"Peikert Chris","unstructured":"Chris Peikert . 2010. An efficient and parallel gaussian sampler for lattices . In Advances in Cryptology (CRYPTO\u201910), Tal Rabin (Ed.) . Lecture Notes in Computer Science , Vol. 6223 . Springer , Berlin , 80--97. Chris Peikert. 2010. An efficient and parallel gaussian sampler for lattices. In Advances in Cryptology (CRYPTO\u201910), Tal Rabin (Ed.). Lecture Notes in Computer Science, Vol. 6223. Springer, Berlin, 80--97."},{"key":"e_1_2_1_34_1","volume-title":"Manh Ha Nguyen, and Xavier Boyen","author":"Phong Le Trieu","year":"2016","unstructured":"Le Trieu Phong , Lihua Wang , Yoshinori Aono , Manh Ha Nguyen, and Xavier Boyen . 2016 . Proxy re-encryption schemes with key privacy from LWE. Cryptology ePrint Archive, Report 2016\/327. (2016). http:\/\/eprint.iacr.org\/2016\/327. Le Trieu Phong, Lihua Wang, Yoshinori Aono, Manh Ha Nguyen, and Xavier Boyen. 2016. Proxy re-encryption schemes with key privacy from LWE. Cryptology ePrint Archive, Report 2016\/327. (2016). http:\/\/eprint.iacr.org\/2016\/327."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703440678"},{"key":"e_1_2_1_36_1","volume-title":"Advances in Cryptology (EUROCRYPT\u201911), Kenneth G","author":"Stehl\u00e9 Damien","unstructured":"Damien Stehl\u00e9 and Ron Steinfeld . 2011. Making NTRU as secure as worst-case problems over ideal lattices . In Advances in Cryptology (EUROCRYPT\u201911), Kenneth G . Paterson (Ed.). Lecture Notes in Computer Science, Vol. 6632 . Springer , Berlin, 27--47. Damien Stehl\u00e9 and Ron Steinfeld. 2011. Making NTRU as secure as worst-case problems over ideal lattices. In Advances in Cryptology (EUROCRYPT\u201911), Kenneth G. Paterson (Ed.). Lecture Notes in Computer Science, Vol. 6632. Springer, Berlin, 27--47."},{"key":"e_1_2_1_37_1","unstructured":"Joop van de Pol. 2012. Quantifying the security of lattice-based cryptosystems in practice. In Mathematical and Statistical Aspects of Cryptography. Joop van de Pol. 2012. Quantifying the security of lattice-based cryptosystems in practice. In Mathematical and Statistical Aspects of Cryptography."}],"container-title":["ACM Transactions on Privacy and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3128607","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3128607","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3128607","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:14Z","timestamp":1750217414000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3128607"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,20]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,11,30]]}},"alternative-id":["10.1145\/3128607"],"URL":"https:\/\/doi.org\/10.1145\/3128607","relation":{},"ISSN":["2471-2566","2471-2574"],"issn-type":[{"value":"2471-2566","type":"print"},{"value":"2471-2574","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,20]]},"assertion":[{"value":"2015-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-09-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}