Cryptology ePrint Archive: Report 2021/089

Fuzzy Message Detection

Gabrielle Beck and Julia Len and Ian Miers and Matthew Green

Abstract: Many privacy-preserving protocols employ a primitive that allows a sender to "flag" a message to a recipient's public key, such that only the recipient (who possesses the corresponding secret key) can detect that the message is intended for their use. Examples of such protocols include anonymous messaging, privacy-preserving payments, and anonymous tracing. A limitation of the existing techniques is that recipients cannot easily outsource the detection of messages to a remote server, without revealing to the server the exact set of matching messages. In this work we propose a new class of cryptographic primitives called fuzzy message detection schemes. These schemes allow a recipient to derive a specialized message detection key that can identify correct messages, while also incorrectly identifying non-matching messages with a specific and chosen false positive rate $p$. This allows recipients to outsource detection work to an untrustworthy server, without revealing precisely which messages belong to the receiver. We show how to construct these schemes under a variety of assumptions; describe several applications of the new technique; and show that our schemes are efficient enough to use in real applications.

Category / Keywords: public-key cryptography / privacy, encryption, cryptocurrency

Original Publication (with major differences): ACM CCS
DOI:
10.1145/3460120.3484545

Date: received 23 Jan 2021, last revised 22 Nov 2021

Contact author: matthewdgreen at gmail com, becgabri at cs jhu edu

Available format(s): PDF | BibTeX Citation

Version: 20211122:023628 (All versions of this report)

Short URL: ia.cr/2021/089


[ Cryptology ePrint archive ]