{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T17:00:52Z","timestamp":1774630852591,"version":"3.50.1"},"publisher-location":"Cham","reference-count":62,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031158018","type":"print"},{"value":"9783031158025","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-15802-5_26","type":"book-chapter","created":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T16:59:52Z","timestamp":1665507592000},"page":"753-783","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Oblivious Message Retrieval"],"prefix":"10.1007","author":[{"given":"Zeyu","family":"Liu","sequence":"first","affiliation":[]},{"given":"Eran","family":"Tromer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,12]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: ACM Symposium on Theory of Computing, STOC 1996, pp. 99\u2013108. ACM (1996)","DOI":"10.1145\/237814.237838"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Al Badawi, A., Polyakov, Y., Aung, K.M.M., Veeravalli, B., Rohloff, K.: Implementation and performance evaluation of RNS variants of the BFV homomorphic encryption scheme. IEEE Trans. Emerg. Top. Comput. 9, 941\u2013956 (2021)","DOI":"10.1109\/TETC.2019.2902799"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1515\/jmc-2015-0016","volume":"9","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. 9, 169\u2013203 (2015)","journal-title":"J. Math. Cryptol."},{"key":"26_CR4","unstructured":"Ali, A., et al.: Communication-computation trade-offs in PIR. In: USENIX Security 2021, pp. 1811\u20131828. USENIX, August 2021"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Angel, S., Chen, H., Laine, K., Setty, S.T.V.: PIR with compressed queries and amortized query processing. In: 2018 IEEE S &P. IEEE Computer Society Press (2018)","DOI":"10.1109\/SP.2018.00062"},{"key":"26_CR6","unstructured":"Angel, S., Setty, S.: Unobservable communication over fully untrusted infrastructure. In: OSDI 2016, pp. 551\u2013569. USENIX, November 2016"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Beck, G., Len, J., Miers, I., Green, M.: Fuzzy message detection. In: The ACM Conference on Computer and Communications Security, CCS 2021 (2021)","DOI":"10.1145\/3460120.3484545"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Ben Sasson, E., et al.: Zerocash: decentralized anonymous payments from bitcoin. In: 2014 IEEE S &P, pp. 459\u2013474 (2014)","DOI":"10.1109\/SP.2014.36"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Bethencourt, J., Song, D.X., Waters, B.: New techniques for private stream searching. ACM Trans. Inf. Syst. Secur. 12, 16:1\u201316:32 (2009)","DOI":"10.1145\/1455526.1455529"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In: ITCS 2012, pp. 326\u2013349. ACM (2012)","DOI":"10.1145\/2090236.2090263"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Bittau, A., et al.: Prochlo: strong privacy for analytics in the crowd. In: SOSP, pp. 441\u2013459 (2017)","DOI":"10.1145\/3132747.3132769"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Boemer, F., Kim, S., Seifu, G., de Souza, F.D., Gopal, V., et al.: Intel HEXL (release 1.2), September 2021. https:\/\/github.com\/intel\/hexl","DOI":"10.1145\/3474366.3486926"},{"key":"26_CR13","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":"26_CR14","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: ITCS 2012. ACM, 8\u201310 January 2012","DOI":"10.1145\/2090236.2090262"},{"issue":"5","key":"26_CR15","doi-asserted-by":"publisher","first-page":"4677","DOI":"10.1109\/TVT.2018.2790436","volume":"67","author":"S Brown","year":"2018","unstructured":"Brown, S., Johnson, O., Tassi, A.: Reliability of broadcast communications under sparse random linear network coding. IEEE Trans. Veh. Technol. 67(5), 4677\u20134682 (2018)","journal-title":"IEEE Trans. Veh. Technol."},{"issue":"1","key":"26_CR16","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 encryption over the torus. J. Cryptol. 33(1), 34\u201391 (2020)","journal-title":"J. Cryptol."},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Choi, S.G., Dachman-Soled, D., Gordon, S.D., Liu, L., Yerukhimovich, A.: Compressed oblivious encoding for homomorphically encrypted search. In: CCS 2021 (2021)","DOI":"10.1145\/3460120.3484792"},{"key":"26_CR18","unstructured":"Chor, B., Gilboa, N., Naor, M.: Private information retrieval by keywords (1998). Appeared in the Theory of Cryptography Library. http:\/\/ia.cr\/1998\/003"},{"key":"26_CR19","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: 36th FOCS, pp. 41\u201350. IEEE Computer Society Press, 23\u201325 October 1995"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Corrigan-Gibbs, H., Boneh, D., Mazi\u00e8res, D.: Riposte: an anonymous messaging system handling millions of users. In: 2015 IEEE S &P, pp. 321\u2013338 (2015)","DOI":"10.1109\/SP.2015.27"},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-540-77366-5_15","volume-title":"Financial Cryptography and Data Security","author":"G Danezis","year":"2007","unstructured":"Danezis, G., Diaz, C.: Space-efficient private search with applications to Rateless codes. In: Dietrich, S., Dhamija, R. (eds.) FC 2007. LNCS, vol. 4886, pp. 148\u2013162. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77366-5_15"},{"key":"26_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-662-46800-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"L Ducas","year":"2015","unstructured":"Ducas, L., Micciancio, D.: FHEW: bootstrapping homomorphic encryption in less than a second. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015, Part I. LNCS, vol. 9056, pp. 617\u2013640. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_24"},{"key":"26_CR23","unstructured":"Electric Coin Company: Zcash Rust crates. Commit hash: 99d877e22d58610dc43021b831a28286ef353a89. https:\/\/github.com\/zcash\/librustzcash"},{"key":"26_CR24","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Report 2012\/144 (2012). https:\/\/ia.cr\/2012\/144"},{"key":"26_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-642-35999-6_24","volume-title":"Selected Areas in Cryptography","author":"M Finiasz","year":"2013","unstructured":"Finiasz, M., Ramchandran, K.: Private stream search at almost the same communication cost as a regular search. In: Knudsen, L.R., Wu, H. (eds.) SAC 2012. LNCS, vol. 7707, pp. 372\u2013389. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35999-6_24"},{"key":"26_CR26","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: ACM Symposium on Theory of Computing, STOC 2009, pp. 169\u2013178. ACM (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"26_CR27","unstructured":"Grigg, J., Hopwood, D.: Zcash improvement proposal 307: light client protocol for payment detection, September 2018. https:\/\/zips.z.cash\/zip-0307"},{"key":"26_CR28","unstructured":"Halevi, S.: A sufficient condition for key-privacy. Cryptology ePrint Archive, Report 2005\/005 (2005)"},{"key":"26_CR29","doi-asserted-by":"crossref","unstructured":"Jelle van den Hooff, J., Lazar, D., Zaharia, M., Zeldovich, N.: Vuvuzela: scalable private messaging resistant to traffic analysis. In: SOSP, pp. 137\u2013152. ACM (2015)","DOI":"10.1145\/2815400.2815417"},{"key":"26_CR30","unstructured":"Hopwood, D., Bowe, S., Hornby, T., Wilcox, N.: Zcash Protocol Specification Version 2021.2.14. https:\/\/github.com\/zcash\/zips\/blob\/master\/protocol\/protocol.pdf"},{"key":"26_CR31","unstructured":"Hopwood, D., et al.: Zcash improvement proposal 316: unified addresses and unified viewing keys, April 2021. https:\/\/zips.z.cash\/zip-0316"},{"key":"26_CR32","unstructured":"Hornby, T.: Fixing privacy problems in the Zcash light wallet protocol, October 2020. https:\/\/defuse.ca\/downloads\/Fixing%20Privacy%20Problems%20in%20the%20Zcash%20Light%20Wallet%20Protocol.pdf"},{"key":"26_CR33","doi-asserted-by":"crossref","unstructured":"Iliashenko, I., N\u00e8gre, C., Zucca, V.: Integer functions suitable for homomorphic encryption over finite fields. Cryptology ePrint Archive, Report 2021\/1335 (2021). WAHC 2021","DOI":"10.1145\/3474366.3486925"},{"key":"26_CR34","doi-asserted-by":"crossref","unstructured":"Kaufman, T., Sudan, M.: Sparse random linear codes are locally decodable and testable. In: FOCS 2007 (2007)","DOI":"10.1109\/FOCS.2007.4389528"},{"issue":"10","key":"26_CR35","doi-asserted-by":"publisher","first-page":"2035","DOI":"10.1109\/LCOMM.2016.2594768","volume":"20","author":"AS Khan","year":"2016","unstructured":"Khan, A.S., Chatzigeorgiou, I.: Improved bounds on the decoding failure probability of network coding over multi-source multi-relay networks. IEEE Commun. Lett. 20(10), 2035\u20132038 (2016)","journal-title":"IEEE Commun. Lett."},{"key":"26_CR36","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: single database, computationally-private information retrieval. In: FOCS 1997 (1997)"},{"key":"26_CR37","unstructured":"Laine, K.: Simple encrypted arithmetic library 2.3.1. Microsoft Research, Redmond, WA. https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2017\/11\/sealmanual-2-3-1.pdf"},{"key":"26_CR38","unstructured":"Lazar, D., Zeldovich, N.: Alpenhorn: bootstrapping secure communication without leaking metadata. In: OSDI 2016, pp. 571\u2013586. USENIX, November 2016"},{"key":"26_CR39","doi-asserted-by":"crossref","unstructured":"Le, D., Tengana Hurtado, L., Ahmad, A., Minaei, M., Lee, B., Kate, A.: A tale of two trees: one writes, and other reads. In: PETS 2020, pp. 519\u2013536, April 2020","DOI":"10.2478\/popets-2020-0039"},{"key":"26_CR40","unstructured":"Lewis, S.J.: fuzzytags. https:\/\/git.openprivacy.ca\/openprivacy\/fuzzytags.git"},{"key":"26_CR41","unstructured":"Lewis, S.J.: Discreet log #1: anonymity, bandwidth and fuzzytags, February 2021. https:\/\/openprivacy.ca\/discreet-log\/01-anonymity-bandwidth-and-fuzzytags\/"},{"key":"26_CR42","unstructured":"Lund, J.: Technology preview: sealed sender for signal, October 2018. https:\/\/signal.org\/blog\/sealed-sender\/"},{"key":"26_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2535925","volume":"60","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. J. ACM 60, 1\u201335 (2013)","journal-title":"J. ACM"},{"key":"26_CR44","unstructured":"Madathil, V., Scafuro, A., Seres, I.A., Shlomovits, O., Varlakov, D.: Private signaling. Cryptology ePrint Archive, Report 2021\/853 (20210624:145011) (2021)"},{"key":"26_CR45","doi-asserted-by":"crossref","unstructured":"Martiny, I., Kaptchuk, G., Aviv, A., Roche, D., Wustrow, E.: Improving signal\u2019s sealed sender. In: NDSS 2022, January 2021","DOI":"10.14722\/ndss.2021.24180"},{"key":"26_CR46","unstructured":"Matetic, S., W\u00fcst, K., Schneider, M., Kostiainen, K., Karame, G., Capkun, S.: BITE: bitcoin lightweight client privacy using trusted execution. In: USENIX Security 2019, pp. 783\u2013800. USENIX, August 2019"},{"key":"26_CR47","unstructured":"Microsoft SEAL (release 3.6). Microsoft Research, Redmond, WA, November 2020. https:\/\/github.com\/Microsoft\/SEAL"},{"key":"26_CR48","unstructured":"Noether, S.: Ring signature confidential transactions for Monero. IACR Cryptology ePrint Archive 2015\/1098 (2015)"},{"key":"26_CR49","unstructured":"Nuttycombe, K., Hopwood, D.: Zcash improvement proposal 321: payment request URIs, August 2010. https:\/\/zips.z.cash\/zip-0321"},{"key":"26_CR50","unstructured":"Oblivious message retrieval implementation, December 2021. https:\/\/github.com\/ZeyuThomasLiu\/ObliviousMessageRetrieval"},{"key":"26_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/11535218_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"R Ostrovsky","year":"2005","unstructured":"Ostrovsky, R., Skeith, W.E.: Private searching on streaming data. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 223\u2013240. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_14"},{"key":"26_CR52","unstructured":"PALISADE lattice cryptography library (release 11.2), June 2021. https:\/\/palisade-crypto.org\/"},{"key":"26_CR53","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/0202007","volume":"2","author":"M Paterson","year":"1973","unstructured":"Paterson, M., Stockmeyer, L.: On the number of nonscalar multiplications necessary to evaluate polynomials. SIAM J. Comput. 2, 60\u201366 (1973)","journal-title":"SIAM J. Comput."},{"key":"26_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-540-85174-5_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"C Peikert","year":"2008","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 554\u2013571. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_31"},{"key":"26_CR55","unstructured":"Player, R.: Parameter selection in lattice-based cryptography. Ph.D. thesis, Royal Holloway, University of London (2018)"},{"key":"26_CR56","doi-asserted-by":"crossref","unstructured":"Reagen, B., et al.: Cheetah: optimizing and accelerating homomorphic encryption for private inference. In: 2021 IEEE HPCA, pp. 26\u201339 (2021)","DOI":"10.1109\/HPCA51647.2021.00013"},{"key":"26_CR57","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56, 1\u201340 (2009)","journal-title":"J. ACM"},{"key":"26_CR58","unstructured":"Salmond, D., Grant, A.J., Grivell, I., Chan, T.: On the rank of random matrices over finite fields. CoRR (2014). http:\/\/arxiv.org\/abs\/1404.3250"},{"key":"26_CR59","unstructured":"Schneider, N., Corallo, M.: Bitcoin improvement proposal 21: URI scheme, January 2012. https:\/\/github.com\/bitcoin\/bips\/blob\/master\/bip-0021.mediawiki"},{"key":"26_CR60","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1109\/TCOMM.2015.2503398","volume":"64","author":"A Tassi","year":"2016","unstructured":"Tassi, A., Chatzigeorgiou, I., Lucani, D.: Analysis and optimization of sparse random linear network coding for reliable multicast services. IEEE Trans. Commun. 64, 285\u2013299 (2016)","journal-title":"IEEE Trans. Commun."},{"key":"26_CR61","unstructured":"Wolinsky, D.I., Corrigan-Gibbs, H., Ford, B., Johnson, A.: Dissent in numbers: making strong anonymity scale. In: OSDI 2012, pp. 179\u2013182. USENIX, October 2012"},{"key":"26_CR62","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-030-32101-7_12","volume-title":"Financial Cryptography and Data Security","author":"K W\u00fcst","year":"2019","unstructured":"W\u00fcst, K., Matetic, S., Schneider, M., Miers, I., Kostiainen, K., \u010capkun, S.: ZLiTE: lightweight clients for shielded Zcash transactions using trusted execution. In: Goldberg, I., Moore, T. (eds.) FC 2019. LNCS, vol. 11598, pp. 179\u2013198. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32101-7_12"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15802-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:06:37Z","timestamp":1760133997000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15802-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031158018","9783031158025"],"references-count":62,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15802-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"12 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}