Sciweavers

570 search results - page 49 / 114
» Black-box constructions for secure computation
Sort
View
ASIACRYPT
2005
Springer
14 years 1 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
WWW
2005
ACM
14 years 8 months ago
A convenient method for securely managing passwords
Computer users are asked to generate, keep secret, and recall an increasing number of passwords for uses including host accounts, email servers, e-commerce sites, and online finan...
J. Alex Halderman, Brent Waters, Edward W. Felten
ISW
2010
Springer
13 years 6 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
CHI
2008
ACM
14 years 8 months ago
Access control by testing for shared knowledge
Controlling the privacy of online content is difficult and often confusing. We present a social access control where users devise simple questions of shared knowledge instead of c...
Michael Toomim, Xianhang Zhang, James Fogarty, Jam...
EUC
2008
Springer
13 years 9 months ago
Efficient Client-to-Client Password Authenticated Key Exchange
With the rapid proliferation of client-to-client applications, PAKE (password authenticated key exchange) protocols in the client-to-client setting become increasingly important. ...
Yanjiang Yang, Feng Bao, Robert H. Deng