The Round Complexity of Two-Party Random Selection
From MaRDI portal
Publication:3624376
DOI10.1137/050641715zbMath1172.68022MaRDI 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
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
94A60: Cryptography
68P25: Data encryption (aspects in computer science)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items