849 search results - page 115 / 170 » Completely Non-malleable Schemes |
NDSS
2007
IEEE
14 years 3 months ago
2007
IEEE
With Hidden Credentials Alice can send policyencrypted data to Bob in such a way that he can decrypt the data only with the right combination of credentials. Alice gains no knowle...
SIGMETRICS
2006
ACM
14 years 3 months ago
2006
ACM
Despite the existence of several secure BGP routing protocols, there has been little progress to date on actual adoption. Although feasibility for widespread adoption remains the ...
ICALP
2004
Springer
14 years 2 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
KR
1992
Springer
14 years 1 months ago
1992
Springer
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows i.e. earliest latest possible start...
TPDS
2008
13 years 9 months ago
2008
Most trust models in Peer-to-Peer (P2P) systems are identity based, which means that in order for one peer to trust another, it needs to know the other peer's identity. Hence,...