On the round complexity of covert computation
type: Item
instance of: scholarly article
title: On the round complexity of covert computation
zbMATH Open document ID: 1293.94069
DOI: 10.1145/1806689.1806717
author: Vipul Goyal
author: Abhishek Jain
published in: Proceedings of the forty-second ACM symposium on Theory of computing
publication date: 2014-08-13T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6330058
zbMATH Keywords: covert computation
zbMATH Keywords: cryptography
zbMATH Keywords: round complexity
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1145/1806689.1806717
OpenAlex ID: W2033989039
description: scientific article; zbMATH DE number 6330058