{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,24]],"date-time":"2026-10-24T17:20:09Z","timestamp":1792862409253,"version":"4.5.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1109\/globalsip.2018.8645965","type":"proceedings-article","created":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T20:33:06Z","timestamp":1552941186000},"page":"653-657","source":"Crossref","is-referenced-by-count":3,"title":["ON THE CAPACITY OF SECURE DISTRIBUTED FAST FOURIER TRANSFORM"],"prefix":"10.1109","author":[{"given":"Wei-Ting","family":"Chang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ravi","family":"Tandon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437563"},{"key":"ref11","article-title":"On the Optimal Recovery Threshold of Coded Matrix Multiplication","volume":"abs 1801 10292","author":"dutta","year":"2018","journal-title":"CoRR"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262778"},{"key":"ref13","article-title":"Coded FFT and Its Communication Overhead","volume":"abs 1805 9891","author":"jeong","year":"2018","journal-title":"CoRR"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007060"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647313"},{"key":"ref16","article-title":"Lagrange Coded Computing: Optimal Design for Resiliency, Security and Privacy","volume":"abs 1806 939","author":"yu","year":"2018","journal-title":"CoRR"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TAU.1970.1162132"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01178683"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54455-6_4"},{"key":"ref3","article-title":"An Improved E-voting scheme using Secret Sharing based Secure Multi-party Computation","volume":"abs 1502 7469","author":"nair","year":"2015","journal-title":"CoRR"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840301"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1965-0178586-1"},{"key":"ref8","article-title":"AccFFT: A library for distributed-memory FFT on CPU and GPU architectures","volume":"abs 1506 7933","author":"gholami","year":"2015","journal-title":"CoRR"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/120885887"},{"key":"ref2","first-page":"87","article-title":"Multiparty Computations Ensuring Privacy of Each Party’s Input and Correctness of the Result","author":"chaum","year":"1988","journal-title":"Advances in Cryptology"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref9","article-title":"Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication","volume":"abs 1705 10464","author":"yu","year":"2017","journal-title":"CoRR"}],"event":{"name":"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","location":"Anaheim, CA, USA","start":{"date-parts":[[2018,11,26]]},"end":{"date-parts":[[2018,11,29]]}},"container-title":["2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8637665\/8645964\/08645965.pdf?arnumber=8645965","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T03:39:56Z","timestamp":1598240396000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8645965\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/globalsip.2018.8645965","relation":{},"subject":[],"published":{"date-parts":[[2018,11]]}}}