Reusable low-error compressive sampling schemes through privacy

2012 IEEE Statistical Signal Processing Workshop, SSP 2012

Volumn , Issue , 2012, Pages 536-539

  Gilbert, Anna C ^a,b   Hemenway, Brett ^a,b   Strauss, Martin J ^a,b   Woodruff, David P ^a,b   Wootters, Mary ^a,b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

compressive sampling; Forall Foreach; Privacy preserving

Indexed keywords

COMPRESSIVE SAMPLING; FORALL/FOREACH; MATHEMATICAL THEORY; MATRIX-VECTOR PRODUCTS; MULTIPLE INPUTS; PRIVACY PRESERVING; RADAR SIGNALS; RECOVERED SIGNALS; SPARSE VECTORS;

SIGNAL PROCESSING;

SAMPLING;

EID: 84868251871     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SSP.2012.6319752     Document Type: Conference Paper

References (8)

1. D Donoho, "Compressed sensing," Information Theory, vol. 52, no. 4, pp. 1289-1306, Jan 2006.
2. Candes, Romberg, and Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Transactions on Information Theory, vol. 52, no. 2, 2006.
3. A.C. Gilbert, M.J. Strauss, J.A. Tropp, and R. Vershynin, "One sketch for all: fast algorithms for compressed sensing," in Proceedings of the thirty-ninth annual ACM symposium on Theory of computing. ACM, 2007, pp. 237-246. (Pubitemid 47630740)
4. Haitham Hassanieh, Piotr Indyk, Dina Katabi, and Eric Price, "Nearly optimal sparse Fourier transform," in Proceedings of 44'th ACM Symposium on Theory of Computing, 2012, To appear.
5. Yishay Mansour, "Randomized interpolation and approximation of sparse polynomials," in ICALP, 1992, pp. 261-272.
6. A Cohen, W Dahmen, and R DeVore, "Compressed sensing and best k-term approximation," American Mathematical Society, vol. 22, no. 1, pp. 211-231, 2009.
7. Joe Kilian, André Madeira, Martin J. Strauss, and Xuan Zheng, "Fast private norm estimation and heavy hitters," in TCC, 2008, pp. 176-193.
8. Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J. Strauss, and Rebecca N. Wright, "Secure multiparty computation of approximations," ACM Transactions on Algorithms, vol. 2, no. 3, pp. 435-472, 2006. (Pubitemid 44452181)