The Round Complexity of Two-Party Random Selection

DOI10.1137/050641715zbMath1172.68022OpenAlexW1984298275MaRDI QIDQ3624376

Saurabh Sanghvi, Salil P. Vadhan

Publication date: 30 April 2009

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: http://nrs.harvard.edu/urn-3:HUL.InstRepos:41467487

zbMATH Keywords

cryptographydistributed computingcoin flipping

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Rationality in the Full-Information Model

This page was built for publication: The Round Complexity of Two-Party Random Selection