Random Selection with an Adversarial Majority

DOI10.1007/11818175_25zbMath1161.68568OpenAlexW1908345781MaRDI QIDQ5756650

Ronen Gradwohl, David Zuckerman, Salil P. Vadhan

Publication date: 4 September 2007

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

Full work available at URL: https://doi.org/10.1007/11818175_25

Mathematics Subject Classification ID

Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60) Randomized algorithms (68W20)

Related Items

High entropy random selection protocols ⋮ Must the communication graph of MPC protocols be an expander? ⋮ From fairness to full security in multiparty computation ⋮ Rationality in the Full-Information Model