860 search results - page 119 / 172 » Completeness in two-party secure computation: a computationa... |
169
click to vote
TCC
2009
Springer
16 years 6 months ago
2009
Springer
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
162
click to vote
IPPS
2007
IEEE
16 years 14 days ago
2007
IEEE
With the rapid growth of computer networks and network infrastructures and increased dependency on the internet to carry out day-to-day activities, it is imperative that the compo...
165
click to vote
SAC
2005
ACM
15 years 11 months ago
2005
ACM
In traditional access control models like MAC, DAC, and RBAC, authorization decisions are determined according to identities of subjects and objects, which are authenticated by a ...
153
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
A well-known concern in the setting of identity based encryption is that the PKG is all powerful and has to be completely trusted. To mitigate this problem, the notion of Accounta...
185
click to vote
COLCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
This paper describes the architecture and implementation of a Java-based appliance for collaborative review of crashes involving injured children in order to determine mechanisms o...