Sciweavers

1656 search results - page 211 / 332
» Secure Computation Without Authentication
Sort
View
ASIACRYPT
2005
Springer
14 years 3 months ago
Privacy-Preserving Graph Algorithms in the Semi-honest Model
Abstract. We consider scenarios in which two parties, each in possession of a graph, wish to compute some algorithm on their joint graph in a privacy-preserving manner, that is, wi...
Justin Brickell, Vitaly Shmatikov
CCS
2004
ACM
14 years 3 months ago
Mitigating bandwidth-exhaustion attacks using congestion puzzles
d Abstract) XiaoFeng Wang∗ Michael K. Reiter† We present congestion puzzles (CP), a new countermeasure to bandwidth-exhaustion attacks. Like other defenses based on client puz...
XiaoFeng Wang, Michael K. Reiter
TGC
2005
Springer
14 years 3 months ago
Types for Security in a Mobile World
Our society is increasingly moving towards richer forms of information exchange where mobility of processes and devices plays a prominent role. This tendency has prompted the acade...
Adriana B. Compagnoni, Elsa L. Gunter
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
14 years 3 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
ISW
2010
Springer
13 years 8 months ago
Efficient Computationally Private Information Retrieval from Anonymity or Trapdoor Groups
A Private Information Retrieval (PIR) protocol allows a database user, or client, to obtain information from a data- base in a manner that prevents the database from knowing which...
Jonathan T. Trostle, Andy Parrish