18 search results - page 4 / 4 » Quasi-Pipelined Hash Circuits |
FOCS
2003
IEEE
13 years 11 months ago
2003
IEEE
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
COCO
2006
Springer
13 years 10 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
19
Voted
CCS
2010
ACM
13 years 6 months ago
2010
ACM
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...