Random Selection with an Adversarial Majority

DOI10.1007/11818175_25MaRDI QIDQ5756650zbMATH OpenOpenAlexFDO

Authors Ronen Gradwohl, David Zuckerman, Salil 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

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

Recommendations

• Random selection in few rounds
• The Round Complexity of Two-Party Random Selection
• High Entropy Random Selection Protocols
• Randomness versus fault-tolerance
• A lower bound for adaptively-secure collective coin-flipping protocols

Cited in

(8)

• High entropy random selection protocols
• Rationality in the Full-Information Model
• High Entropy Random Selection Protocols
• The Round Complexity of Two-Party Random Selection
• Random selection in few rounds
• Must the communication graph of MPC protocols be an expander?
• Anonymous random allocation and its applications
• On the (im)possibility of game-theoretically fair leader election protocols

This page was built for publication: Random Selection with an Adversarial Majority

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