CatNap: Leveraging Generic MPC for Actively Secure Privacy-enhancing Proximity Testing with a Napping Party
Paper in proceeding, 2022

Proximity testing is at the core of several Location-Based Services (LBS). Despite a series of reported and confirmed abuses, modern LBSs still demand their clients to disclose their locations in plain in order to preform location proximity testing. This works aims at enhancing proximity testing with privacy. We design CatNap a novel protocol that (1) implements precise Euclidean distance matching; (2) allows matching even if the clients are not online at the same time (the "napping party" feature); (3) is secure against active adversaries (malicious actors that corrupt up to one party); (4) makes black-box use of generic Multi-Party Computation techniques (any future improvement of the underlying building blocks will also boost CatNap); and (5) is efficient: servers run with about 0.03 seconds of CPU time and 5.6MB of communication, while clients perform only a small number of Boolean operations and need just 51 bytes of communication.

Privacy

Active Security

Proximity-Testing

Multi-Party Computation

Author

Ivan Oleinikov

Chalmers, Computer Science and Engineering (Chalmers), Information Security

Elena Pagnin

Lund University

Andrei Sabelfeld

Chalmers, Computer Science and Engineering (Chalmers), Information Security

SECRYPT : PROCEEDINGS OF THE 19TH INTERNATIONAL CONFERENCE ON SECURITY AND CRYPTOGRAPHY

Vol. 1 237-248
978-989-758-590-6 (ISBN)

19th International Conference on Security and Cryptography (SECRYPT)
Lisbon, Portugal,

Subject Categories

Computer Engineering

Computer Science

Computer Systems

DOI

10.5220/0011279500003283

More information

Latest update

7/17/2024