156 search results - page 30 / 32 » On the Round Complexity of Covert Computation |
JOC
2008
14 years 9 months ago
2008
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
92
Voted
IACR
2011
13 years 9 months ago
2011
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
82
Voted
ASIACRYPT
2008
Springer
14 years 11 months ago
2008
Springer
Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether o...
90
Voted
ICIW
2009
IEEE
15 years 4 months ago
2009
IEEE
BitTorrent and Practical Network Coding are efficient methods for sharing files in a peer-to-peer network. Both face the problem to distribute a given file using peers with dif...
108
Voted
C3S2E
2009
ACM
15 years 4 months ago
2009
ACM
This article introduces Nohalo level 1 (“Nohalo”), the simplest member of a family of image resamplers which straighten diagonal interfaces without adding noticeable nonlinear...