Cryptology ePrint Archive: Report 2015/417

Order-Revealing Encryption and the Hardness of Private Learning

Mark Bun and Mark Zhandry

Abstract: An order-revealing encryption scheme gives a public procedure by which two ciphertexts can be compared to reveal the ordering of their underlying plaintexts. We show how to use order-revealing encryption to separate computationally efficient PAC learning from efficient $(\epsilon, \delta)$-differentially private PAC learning. That is, we construct a concept class that is efficiently PAC learnable, but for which every efficient learner fails to be differentially private. This answers a question of Kasiviswanathan et al. (FOCS '08, SIAM J. Comput. '11).

To prove our result, we give a generic transformation from an order-revealing encryption scheme into one with strongly correct comparison, which enables the consistent comparison of ciphertexts that are not obtained as the valid encryption of any message. We believe this construction may be of independent interest.

Category / Keywords: foundations / differential privacy, order-revealing encryption

Date: received 2 May 2015

Contact author: mbun at seas harvard edu

Available format(s): PDF | BibTeX Citation

Version: 20150505:191858 (All versions of this report)

Short URL: ia.cr/2015/417

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]