A protocol for generating random elements with their probabilities

DOI10.1007/978-3-319-08783-2_17zbMATH Open1425.68120arXiv1312.2483OpenAlexW1710032846MaRDI QIDQ2920458FDOQ2920458

Authors: Thomas Holenstein, Robin Künzler 

Publication date: 26 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Abstract: We give an AM protocol that allows the verifier to sample elements x from a probability distribution P, which is held by the prover. If the prover is honest, the verifier outputs (x, P(x)) with probability close to P(x). In case the prover is dishonest, one may hope for the following guarantee: if the verifier outputs (x, p), then the probability that the verifier outputs x is close to p. Simple examples show that this cannot be achieved. Instead, we show that the following weaker condition holds (in a well defined sense) on average: If (x, p) is output, then p is an upper bound on the probability that x is output. Our protocol yields a new transformation to turn interactive proofs where the verifier uses private random coins into proofs with public coins. The verifier has better running time compared to the well-known Goldwasser-Sipser transformation (STOC, 1986). For constant-round protocols, we only lose an arbitrarily small constant in soundness and completeness, while our public-coin verifier calls the private-coin verifier only once.

Full work available at URL: https://arxiv.org/abs/1312.2483

Recommendations

• scientific article; zbMATH DE number 1031002
• Randomness in interactive proofs
• scientific article; zbMATH DE number 1775425
• On Prover-Efficient Public-Coin Emulation of Interactive Proofs
• On transformation of interactive proofs that preserve the prover's complexity

zbMATH Keywords

interactive protocolinteractive proof system

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cited In (3)

• Title not available (Why is that?)
• A Random Version of Shepp's Urn Scheme
• On Prover-Efficient Public-Coin Emulation of Interactive Proofs

This page was built for publication: A protocol for generating random elements with their probabilities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2920458)