169 search results - page 32 / 34 » Which Languages Have 4-Round Zero-Knowledge Proofs |
ASPLOS
2006
ACM
14 years 1 months ago
2006
ACM
The sustained push toward smaller and smaller technology sizes has reached a point where device reliability has moved to the forefront of concerns for next-generation designs. Sil...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
—In 1982, Kannan showed that ΣP 2 does not have nk -sized circuits for any k. Do smaller classes also admit such circuit lower bounds? Despite several improvements of Kannan’s...
FOSSACS
2005
Springer
14 years 1 months ago
2005
Springer
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
ACSC
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper, we examine the composition of firstclass protocols for multi-agent systems. First-class protocols are protocols that exist as executable specifications that agent...