Abstract

We solve the millionaires problem in the semi-trusted model with homomorphic encryption without using intermediate decryptions. This leads to the computationally least expensive solution with homomorphic encryption so far, with a low bandwidth and very low storage complexity. The number of modular multiplications needed is less than the number of modular multiplications needed for one Pallier encryption. The output of the protocol can be either publicly known, encrypted, or secret-shared. The private input of the first player is computationally secure towards the second player, and the private input of the second player is even unconditionally secure towards the first player. We also introduce an efficient client-server solution for the millionaires problem with similar security properties.

Highlights

  • IntroductionIn its most general setting, there are multiple parties, each having private inputs, and they want to jointly evaluate a certain function on their inputs, without revealing those inputs

  • Is even less than the number of modular multiplications needed for the Pallier encryption of an (` < N) bit number: 5l + 5 log2 N [4]

  • We described a new protocol for the millionaires problem using additively homomorphic encryption in the honest-but-curious model

Read more

Summary

Introduction

In its most general setting, there are multiple parties, each having private inputs, and they want to jointly evaluate a certain function on their inputs, without revealing those inputs These cryptographic solutions achieve a high level of security, the challenge is often to restrict their computational and communication effort. Other applications are neural network classification for e-health, biometric matching, watermark detection, fingerprinting for DRM, and smartgrids [1] Within all those applications, there is clear need for a secure comparison protocol as a building block [1]. We present a new comparison protocol, which is dedicated to lightweight environments that require little memory and a low computational effort.

Preliminaries
Related Work
Comparison Protocol
Correctness
Security
Complexity
Computational Complexity
Communication Complexity
Storage Complexity
Alternative Solutions
15: B sends t to A
Garbled Circuits
Summary
Client-Server Model
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call