{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:14:28Z","timestamp":1743045268668,"version":"3.40.3"},"publisher-location":"Cham","reference-count":65,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030983468"},{"type":"electronic","value":"9783030983475"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-98347-5_13","type":"book-chapter","created":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T14:04:15Z","timestamp":1661177055000},"page":"313-331","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Approximate Computing for Cryptography"],"prefix":"10.1007","author":[{"given":"Dur-e-Shahwar","family":"Kundi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ayesha","family":"Khalid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Song","family":"Bian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiqiang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,18]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Chippa VK, Chakradhar ST, Roy K, Raghunathan A. Analysis and characterization of inherent application resilience for approximate computing. In: Proceedings of the 50th annual design automation conference, ser. DAC\u201913. New York: Association for Computing Machinery; 2013. https:\/\/doi.org\/10.1145\/2463209.2488873.","DOI":"10.1145\/2463209.2488873"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1109\/JPROC.2020.2975695","volume":"108","author":"W Liu","year":"2020","unstructured":"Liu W, Lombardi F, Shulte M. A retrospective and prospective view of approximate computing. Proc IEEE. 2020;108:394\u20139.","journal-title":"Proc IEEE."},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/TCAD.2012.2217962","volume":"32","author":"V Gupta","year":"2013","unstructured":"Gupta V, Mohapatra D, Raghunathan A, Roy K. Low-power digital signal processing using approximate adders. IEEE Trans Comput Aided Des Integr Circuits Syst. 2013;32(1):124\u201337.","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"1435","DOI":"10.1109\/TC.2017.2672976","volume":"66","author":"W Liu","year":"2017","unstructured":"Liu W, Qian L, Wang C, Jiang H, Han J, Lombardi F. Design of approximate radix-4 booth multipliers for error-tolerant computing. IEEE Trans Comput. 2017;66:1435\u201341.","journal-title":"IEEE Trans Comput."},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Waris H, Wang C, Liu W. Hybrid low radix encoding based approximate booth multipliers. IEEE Trans Circuits Syst II Express Briefs. 2020. https:\/\/doi.org\/10.1109\/tcsii.2020.2975094.","DOI":"10.1109\/tcsii.2020.2975094"},{"issue":"12","key":"13_CR6","doi-asserted-by":"publisher","first-page":"2214","DOI":"10.1109\/JPROC.2020.3030121","volume":"108","author":"W Liu","year":"2020","unstructured":"Liu W, Gu C, O\u2019Neill M, Qu G, Montuschi P, Lombardi F. Security in approximate computing and approximate computing for security: challenges and opportunities. Proc. IEEE. 2020;108(12):2214\u201331.","journal-title":"Proc. IEEE."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Dutt S, Paul B, Chauhan A, Nandi S, Trivedi G. Approxhash: delay, power and area optimized approximate hash functions for cryptography applications. In: Proceedings of the 10th international conference on security of information and networks, ser. SIN \u201917. New York, NY: Association for Computing Machinery; 2017. p. 291\u20134.","DOI":"10.1145\/3136825.3136858"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Vilim M, Duwe H, Kumar R. Approximate bitcoin mining. In: 2016 53nd ACM\/EDAC\/IEEE design automation conference (DAC); 2016. p. 1\u20136.","DOI":"10.1145\/2897937.2897988"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Bian S, Hiromoto M, Sato T. DWE: decrypting learning with errors with errors. In: Proc. 55th ACM\/ESDA\/IEEE design automation conference (DAC); June 2018. p. 1\u20136.","DOI":"10.1145\/3195970.3196032"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Kundi D-S, Bian S, Khalid A, Wang C, O\u2019Neill M, Liu W. AxMM: area and power efficient approximate modular multiplier for R-LWE cryptosystem. In: Proc. IEEE international symposium on circuits and systems (ISCAS); 2020. p. 1\u20135.","DOI":"10.1109\/ISCAS45731.2020.9180839"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Bian S, Kundi D-S, Hirozawa K, Liu W, Sato T. APAS: application-specific accelerators for RLWE-based homomorphic linear transformations. IEEE Trans Inf Forensics Secur. 2021;1. https:\/\/doi.org\/10.1109\/TIFS.2021.3114032.","DOI":"10.1109\/TIFS.2021.3114032"},{"key":"13_CR12","unstructured":"FIPS PUB 180-3, Secure Hash Standard (SHS), National Institute of Standards and Technology (NIST), Std.; Oct 2008. http:\/\/csrc.nist.gov\/publications\/fips\/fips180-3\/fips180-3_final.pdf."},{"key":"13_CR13","unstructured":"Bertoni G, Daemen J, Peeters M, Assche GV. Cryptographic sponge functions, version 1. Tech. Rep.; Jan 2011. http:\/\/sponge.noekeon.org\/CSF-0.1.pdf."},{"key":"13_CR14","unstructured":"FIPS PUB 202, SHA-3 standard: permutation-based hash and extendable-output functions. National Institute of Standards and Technology (NIST), Std.; August 2015. http:\/\/csrc.nist.gov\/publications\/drafts\/fips-202\/fips_202_draft.pdf."},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Paar C, Pelzl J. Hash functions. In: Understanding cryptography. Berlin: Springer; 2010.","DOI":"10.1007\/978-3-642-04101-3"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Bassham L, Rukhin A, Soto J, Nechvatal J, Smid M, Leigh S, Levenson M, Vangel M, Heckert N, Banks D. A statistical test suite for random and pseudorandom number generators for cryptographic applications. Tech. Rep.; 2010.","DOI":"10.6028\/NIST.SP.800-22r1a"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/0-387-34799-2_31","volume-title":"Advances in cryptology \u2013 CRYPTO\u2019 88","author":"R Forri\u00e9","year":"1990","unstructured":"Forri\u00e9 R. The strict avalanche criterion: spectral properties of Boolean functions and an extended definition. In: Goldwasser S, editor. Advances in cryptology \u2013 CRYPTO\u2019 88. New York: Springer; 1990. p. 450\u201368."},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF00193563","volume":"5","author":"UM Maurer","year":"1992","unstructured":"Maurer UM. A universal statistical test for random bit generators. J Cryptol. 1992;5:89\u2013105.","journal-title":"J Cryptol."},{"issue":"60","key":"13_CR19","first-page":"1","volume":"13","author":"H Jiang","year":"2017","unstructured":"Jiang H, Liu C, Liu L, Lombardi F, Han J. A review, classification, and comparative evaluation of approximate arithmetic circuits. ACM J Emerg Technol Comput Syst. 2017;13:60:1\u20133.","journal-title":"ACM J Emerg Technol Comput Syst"},{"key":"13_CR20","first-page":"21260","volume-title":"Bitcoin: a peer-to-peer electronic cash system","author":"S Nakamoto","year":"2008","unstructured":"Nakamoto S. Bitcoin: a peer-to-peer electronic cash system. In: Decentralized business review; 2008. p. 21260."},{"issue":"9","key":"13_CR21","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/MC.2017.3571056","volume":"50","author":"M Taylor","year":"2017","unstructured":"Taylor MB. The evolution of bitcoin hardware. Computer. 2017;50(9):58\u201366.","journal-title":"Computer"},{"key":"13_CR22","first-page":"1","volume-title":"2016 53nd ACM\/EDAC\/IEEE design automation conference (DAC)","author":"M Vilim","year":"2016","unstructured":"Vilim M, Duwe H, Kumar R. Approximate bitcoin mining. In: 2016 53nd ACM\/EDAC\/IEEE design automation conference (DAC). Piscataway: IEEE; 2016. p. 1\u20136."},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Verma AK, Brisk P, Ienne P. Variable latency speculative addition: a new paradigm for arithmetic circuit design. In: Proceedings of the conference on design, automation and test in Europe; 2008. p. 1250\u20135.","DOI":"10.1109\/DATE.2008.4484850"},{"key":"13_CR24","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/ICCAD.2013.6691096","volume-title":"2013 IEEE\/ACM international conference on computer-aided design (ICCAD)","author":"R Ye","year":"2013","unstructured":"Ye R, Wang T, Yuan F, Kumar R, Xu Q. On reconfiguration-oriented approximate adder design and its application. In: 2013 IEEE\/ACM international conference on computer-aided design (ICCAD). Piscataway: IEEE; 2013. p. 48\u201354."},{"issue":"5","key":"13_CR25","doi-asserted-by":"publisher","first-page":"1353","DOI":"10.1109\/TCSI.2015.2403036","volume":"62","author":"D Esposito","year":"2015","unstructured":"Esposito D, De Caro D, Napoli E, Petra N, Strollo AGM. Variable latency speculative Han-Carlson adder. IEEE Trans Circuits Syst I Regul Pap. 2015;62(5):1353\u201361.","journal-title":"IEEE Trans Circuits Syst I Regul Pap"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Regev O. On lattices, learning with errors, random linear codes, and cryptography. In: Proc. 37th Annual ACM symposium on theory of computing (STOC); May 2005. p. 84\u201393.","DOI":"10.1145\/1060590.1060603"},{"issue":"6","key":"13_CR27","doi-asserted-by":"publisher","first-page":"34","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. 2009;56(6):34.","journal-title":"J. ACM."},{"key":"13_CR28","first-page":"319","volume-title":"Cryptographers\u2019 track at the RSA conference","author":"R Lindner","year":"2011","unstructured":"Lindner R, Peikert C. Better key sizes (and attacks) for LWE-based encryption. In: Cryptographers\u2019 track at the RSA conference. Berlin: Springer; 2011. p. 319\u201339."},{"key":"13_CR29","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1145\/2976749.2978425","volume-title":"Proceedings of the 2016 ACM SIGSAC conference on computer and communications security","author":"J Bos","year":"2016","unstructured":"Bos J, Costello C, Ducas L, Mironov I, Naehrig M, Nikolaenko V, Raghunathan A, Stebila D. Frodo: take off the ring! practical, quantum-secure key exchange from LWE. In: Proceedings of the 2016 ACM SIGSAC conference on computer and communications security. New York: ACM; 2016. p. 1006\u201318."},{"key":"13_CR30","first-page":"1126","volume":"2016","author":"J Cheon","year":"2016","unstructured":"Cheon JH, Kim D, Lee J, Song YS. Lizard: cut off the tail! Practical post-quantum public-key encryption from LWE and LWR. IACR Cryptol ePrint Arch. 2016;2016:1126.","journal-title":"Practical post-quantum public-key encryption from LWE and LWR. IACR Cryptol ePrint Arch."},{"key":"13_CR31","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1145\/1374376.1374407","volume-title":"Proceedings of the fortieth annual ACM symposium on theory of computing","author":"C Gentry","year":"2008","unstructured":"Gentry C, Peikert C, Vaikuntanathan V. Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the fortieth annual ACM symposium on theory of computing. New York: ACM; 2008. p. 197\u2013206."},{"key":"13_CR32","first-page":"738","volume-title":"Annual international conference on the theory and applications of cryptographic techniques","author":"V Lyubashevsky","year":"2012","unstructured":"Lyubashevsky V. Lattice signatures without trapdoors. In: Annual international conference on the theory and applications of cryptographic techniques. Berlin: Springer; 2012. p. 738\u201355."},{"issue":"2","key":"13_CR33","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1137\/120868669","volume":"43","author":"Z Brakerski","year":"2014","unstructured":"Brakerski Z, Vaikuntanathan V. Efficient fully homomorphic encryption from (standard) LWE. SIAM J Comput. 2014;43(2):831\u201371.","journal-title":"SIAM J Comput"},{"key":"13_CR34","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Gentry C, Vaikuntanathan V. (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans Comput Theory. 2014;6(3):13.","DOI":"10.1145\/2633600"},{"key":"13_CR35","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-40041-4_5","volume-title":"Advances in cryptology\u2013CRYPTO 2013","author":"C Gentry","year":"2013","unstructured":"Gentry C, Sahai A, Waters B. Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In: Advances in cryptology\u2013CRYPTO 2013. Berlin: Springer; 2013. p. 75\u201392."},{"issue":"9","key":"13_CR36","doi-asserted-by":"publisher","first-page":"2848","DOI":"10.1109\/TC.2015.2500576","volume":"65","author":"A Khedr","year":"2016","unstructured":"Khedr A, Gulak G, Vaikuntanathan V. SHIELD: scalable homomorphic implementation of encrypted data-classifiers. IEEE Trans Comput. 2016;65(9):2848\u201358.","journal-title":"IEEE Trans Comput"},{"key":"13_CR37","unstructured":"Cisco. Internet of things (IoT). The Washington Post, July 2015. http:\/\/www.cisco.com\/web\/solutions\/trends\/iot\/portfolio.html."},{"key":"13_CR38","doi-asserted-by":"crossref","unstructured":"Krishna RR, Priyadarshini A, Jha AV, Appasani B, Srinivasulu A, Bizon N. State-of-the-art review on IoT threats and attacks: taxonomy, challenges and solutions. Sustainability. 2021;13(16). https:\/\/www.mdpi.com\/2071-1050\/13\/16\/9463.","DOI":"10.3390\/su13169463"},{"key":"13_CR39","doi-asserted-by":"publisher","unstructured":"McKay KA, Bassham L, Turan MS, Mouha N. Report on lightweight cryptography. National Institute of Standards and Technology (NIST), Tech. Rep. NISTIR 8114, March 2017. https:\/\/doi.org\/10.6028\/NIST.IR.8114.","DOI":"10.6028\/NIST.IR.8114"},{"key":"13_CR40","first-page":"1","volume-title":"Advances in cryptology \u2013 EUROCRYPT","author":"V Lyubashevsky","year":"2010","unstructured":"Lyubashevsky V, Peikert C, Regev O. On ideal lattices and learning with errors over rings. In: Gilbert H, editor. Advances in cryptology \u2013 EUROCRYPT. Berlin: Springer; 2010. p. 1\u201323."},{"key":"13_CR41","first-page":"139","volume-title":"Towards efficient arithmetic for lattice-based cryptography on reconfigurable hardware","author":"T P\u00f6ppelmann","year":"2012","unstructured":"P\u00f6ppelmann T, G\u00fcneysu T. Towards efficient arithmetic for lattice-based cryptography on reconfigurable hardware. In: Proc. international conference on cryptology and information security in Latin America; 2012. p. 139\u201358."},{"key":"13_CR42","first-page":"68","volume-title":"Towards practical lattice-based public-key encryption on reconfigurable hardware","author":"T P\u00f6ppelmann","year":"2013","unstructured":"P\u00f6ppelmann T, G\u00fcneysu T. Towards practical lattice-based public-key encryption on reconfigurable hardware. In: Proc. international conference on selected areas in cryptography; 2013. p. 68\u201385."},{"key":"13_CR43","doi-asserted-by":"publisher","first-page":"2796","DOI":"10.1109\/ISCAS.2014.6865754","volume-title":"2014 IEEE international symposium on circuits and systems (ISCAS)","author":"T Poppelmann","year":"2014","unstructured":"Poppelmann T, Guneysu T. Area optimization of lightweight lattice-based encryption on reconfigurable hardware. In: 2014 IEEE international symposium on circuits and systems (ISCAS). Piscataway: IEEE; 2014. p. 2796\u20139."},{"key":"13_CR44","doi-asserted-by":"crossref","unstructured":"Fan S, Liu W, Howe J, Khalid A, O\u2019Neill M. Lightweight hardware implementation of R-LWE lattice-based cryptography. In: Proc. IEEE Asia Pacific conference on circuits and systems (APCCAS); 2018. p. 403\u20136.","DOI":"10.1109\/APCCAS.2018.8605630"},{"key":"13_CR45","doi-asserted-by":"publisher","unstructured":"Liu W, Fan S, Khalid A, Rafferty C, O\u2019Neill M. Optimized schoolbook polynomial multiplication for compact lattice-based cryptography on FPGA. IEEE Trans Very Large Scale Integr Syst. 2019. https:\/\/doi.org\/10.1109\/TVLSI.2019.2922999.","DOI":"10.1109\/TVLSI.2019.2922999"},{"key":"13_CR46","doi-asserted-by":"crossref","unstructured":"Song S, Tang W, Chen T, Zhang Z. LEIA: a 2.05mm2 140mw lattice encryption instruction accelerator in 40nm CMOS. In: Proc. IEEE custom integrated circuits conference (CICC); 2018. p. 1\u20134.","DOI":"10.1109\/CICC.2018.8357070"},{"key":"13_CR47","doi-asserted-by":"publisher","first-page":"17","DOI":"10.46586\/tches.v2019.i4.17-61","volume":"4","author":"U Banerjee","year":"2019","unstructured":"Banerjee U, Ukyab TS, Chandrakasan AP. Sapphire: a configurable crypto-processor for post-quantum lattice-based protocols. IACR Trans Cryptogr Hardw Embed Syst. 2019;4:17\u201361.","journal-title":"IACR Trans Cryptogr Hardw Embed Syst."},{"issue":"9","key":"13_CR48","doi-asserted-by":"publisher","first-page":"2869","DOI":"10.1109\/TCSI.2018.2801118","volume":"65","author":"R Salarifard","year":"2018","unstructured":"Salarifard R, Bayat-Sarmadi S, Mosanaei-Boorani H. A low-latency and low-complexity point-multiplication in ECC. IEEE Trans Circuits Syst I Regul Pap. 2018;65(9):2869\u201377.","journal-title":"IEEE Trans Circuits Syst I Regul Pap"},{"key":"13_CR49","first-page":"319","volume-title":"Topics in cryptology \u2013 CT-RSA","author":"R Lindner","year":"2011","unstructured":"Lindner R, Peikert C. Better key sizes (and attacks) for LWE-based encryption. In: Kiayias A, editor. Topics in cryptology \u2013 CT-RSA. Berlin: Springer; 2011. p. 319\u201339."},{"key":"13_CR50","doi-asserted-by":"crossref","unstructured":"Hashemi S, Bahar RI, Reda S. DRUM: a dynamic range unbiased multiplier for approximate applications. In: Proc. IEEE\/ACM international conference on computer-aided design (ICCAD); Nov 2015. p. 418\u201325.","DOI":"10.1109\/ICCAD.2015.7372600"},{"issue":"5","key":"13_CR51","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1109\/TVLSI.2018.2890712","volume":"27","author":"S Vahdat","year":"2019","unstructured":"Vahdat S, Kamal M, Afzali-Kusha A, Pedram M. TOSAM: an energy-efficient truncation- and rounding-based scalable approximate multiplier. IEEE Trans Very Large Scale Integr Syst. 2019;27(5):1161\u201373.","journal-title":"IEEE Trans Very Large Scale Integr Syst"},{"key":"13_CR52","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.compeleceng.2017.08.019","volume":"63","author":"S Vahdat","year":"2017","unstructured":"Vahdat S, Kamal M, Afzali-Kusha A, Pedram M. LETAM: a low energy truncation-based approximate multiplier. Comput Electrical Eng. 2017;63:1\u201317. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0045790616306310.","journal-title":"Comput Electrical Eng."},{"key":"13_CR53","first-page":"512","volume-title":"Cryptographic hardware and embedded systems (CHES)","author":"N G\u00f8ttert","year":"2012","unstructured":"G\u00f8ttert N, Feller T, Schneider M, Buchmann J, Huss S. On the design of hardware building blocks for modern lattice-based encryption schemes. In: Cryptographic hardware and embedded systems (CHES). Berlin: Springer; 2012. p. 512\u201329."},{"key":"13_CR54","unstructured":"Juvekar C, Vaikuntanathan V, Chandrakasan A. Gazelle: a low latency framework for secure neural network inference. arXiv:1801.05507 [Preprint]. 2018."},{"key":"13_CR55","doi-asserted-by":"crossref","unstructured":"Keller M, Orsini E, Scholl P. MASCOT: faster malicious arithmetic secure computation with oblivious transfer. In: Proc. 2016 conference on computer and communications security. New York: ACM; 2016. p. 830\u201342.","DOI":"10.1145\/2976749.2978357"},{"key":"13_CR56","doi-asserted-by":"crossref","unstructured":"Keller M. MP-SPDZ: a versatile framework for multi-party computation. In: Proceedings of the 2020 ACM SIGSAC conference on computer and communications security; 2020. p. 1575\u201390.","DOI":"10.1145\/3372297.3417872"},{"key":"13_CR57","doi-asserted-by":"crossref","unstructured":"Yao AC. Protocols for secure computations. In: 23rd Annual symposium on foundations of computer science, 1982. SFCS\u201908. Piscataway: IEEE; 1982. p. 160\u20134.","DOI":"10.1109\/SFCS.1982.38"},{"key":"13_CR58","first-page":"171","volume":"2019","author":"M Riazi","year":"2019","unstructured":"Riazi MS, Samragh M, Chen H, Laine K, Lauter KE, Koushanfar F. XONN: XNOR-based oblivious deep neural network inference. IACR Cryptol ePrint Arch. 2019;2019:171.","journal-title":"IACR Cryptol ePrint Arch."},{"key":"13_CR59","doi-asserted-by":"crossref","unstructured":"Mishra P, Lehmkuhl R, Srinivasan A, Zheng W, Popa RA. Delphi: a cryptographic inference service for neural networks. In: 29th USENIX security symposium (USENIX Security 20); 2020. p. 2505\u201322.","DOI":"10.1145\/3411501.3419418"},{"key":"13_CR60","doi-asserted-by":"crossref","unstructured":"Bian S, Wang T, Hiromoto M, Shi Y, Sato T. ENSEI: efficient secure inference via frequency-domain homomorphic convolution for privacy-preserving visual recognition; 2020.","DOI":"10.1109\/CVPR42600.2020.00942"},{"key":"13_CR61","doi-asserted-by":"crossref","unstructured":"Hackenjos T, Hahn F, Kerschbaum F. SAGMA: secure aggregation grouped by multiple attributes. In: Proceedings of the 2020 ACM SIGMOD international conference on management of data; 2020. p. 587\u2013601.","DOI":"10.1145\/3318464.3380569"},{"key":"13_CR62","unstructured":"Matsuoka K, Banno R, Matsumoto N, Sato T, Bian S. Virtual secure platform: a five-stage pipeline processor over {TFHE}. In: 30th USENIX security symposium (USENIX Security 21); 2021."},{"key":"13_CR63","doi-asserted-by":"crossref","unstructured":"Kuo T-T, Jiang X, Tang H, Wang X, Bath T, Bu D, Wang L, Harmanci A, Zhang S, Zhi D, et al. iDASH secure genome analysis competition 2018: blockchain genomic data access logging, homomorphic encryption on GWAS, and DNA segment searching; 2020.","DOI":"10.1186\/s12920-020-0715-0"},{"issue":"9","key":"13_CR64","doi-asserted-by":"publisher","first-page":"1562","DOI":"10.1109\/TC.2017.2686385","volume":"66","author":"S Roy","year":"2017","unstructured":"Roy SS, et al. Hardware assisted fully homomorphic function evaluation and encrypted search. IEEE Trans Comput. 2017;66(9):1562\u201372.","journal-title":"IEEE Trans Comput"},{"issue":"5","key":"13_CR65","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1109\/TCSII.2020.2980387","volume":"67","author":"Y Zhang","year":"2020","unstructured":"Zhang Y, Wang C, Kundi D-S, Khalid A, O\u2019Neill M, Liu W. An efficient and parallel R-LWE cryptoprocessor. IEEE Trans Circuits Syst II Express Briefs. 2020;67(5):886\u201390.","journal-title":"IEEE Trans Circuits Syst II Express Briefs"}],"container-title":["Approximate Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-98347-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T14:13:59Z","timestamp":1661177639000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-98347-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030983468","9783030983475"],"references-count":65,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-98347-5_13","relation":{},"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"18 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}