Random selection in few rounds

DOI10.1007/978-3-642-38536-0_31MaRDI QIDQ4928500zbMATH OpenOpenAlexFDO

Authors Timofey Stepanov

Publication date 14 June 2013

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38536-0_31

zbMATH Keywords

cryptographydistributed computingrandom selection protocols

Mathematics Subject Classification ID

Network protocols (68M12) Measures of information, entropy (94A17) Cryptography (94A60)

Recommendations

• High entropy random selection protocols
• The Round Complexity of Two-Party Random Selection
• High Entropy Random Selection Protocols
• Random Selection with an Adversarial Majority
• Randomness versus fault-tolerance

Cited in

(7)

• High entropy random selection protocols
• High Entropy Random Selection Protocols
• The Round Complexity of Two-Party Random Selection
• Random Selection with an Adversarial Majority
• Coalgebraic tools for randomness-conserving protocols
• Coalgebraic tools for randomness-conserving protocols
• Public randomness extraction with ephemeral roles and worst-case corruptions

This page was built for publication: Random selection in few rounds

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