Private Sampling with Identifiable Cheaters - Archive ouverte HAL Access content directly
Journal Articles Proceedings on Privacy Enhancing Technologies Year : 2023

Private Sampling with Identifiable Cheaters

César Sabater
Andreas Peter
  • Function : Author
  • PersonId : 1207940
Jan Ramon

Abstract

In this paper we study verifiable sampling from probability distributions in the context of multi-party computation. This has various applications in randomized algorithms performed collaboratively by parties not trusting each other. One example is differentially private machine learning where noise should be drawn, typically from a Laplace or Gaussian distribution, and it is desirable that no party can bias this process. In particular, we propose algorithms to draw random numbers from uniform, Laplace, Gaussian and arbitrary probability distributions, and to verify honest execution of the protocols through zero-knowledge proofs. We propose protocols that result in one party knowing the drawn number and protocols that deliver the drawn random number as a shared secret.
Fichier principal
Vignette du fichier
main.pdf (2 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03904200 , version 1 (16-12-2022)

Identifiers

  • HAL Id : hal-03904200 , version 1

Cite

César Sabater, Florian Hahn, Andreas Peter, Jan Ramon. Private Sampling with Identifiable Cheaters. Proceedings on Privacy Enhancing Technologies, In press, 2023 (2). ⟨hal-03904200⟩
104 View
62 Download

Share

Gmail Facebook X LinkedIn More