1656 search results - page 223 / 332 » Secure Computation Without Authentication |
111
click to vote
CCS
2006
ACM
15 years 6 months ago
2006
ACM
A high-level security policy states an overall requirement for a sensitive task. One example of a high-level security policy is a separation of duty policy, which requires a sensi...
174
Voted
JOC
2010
15 years 26 days ago
2010
We present a new encryption scheme which is secure against adaptive chosenciphertext attack (or CCA2-secure) in the standard model (i.e. without the use of random oracle). Our sch...
129
Voted
WS
2006
ACM
15 years 8 months ago
2006
ACM
The interoperability of IM (Instant Messaging) and SMS (Short Messaging Service) networks allows users to seamlessly use a variety of computing devices from desktops to cellular p...
139
Voted
CCS
2010
ACM
15 years 2 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...
145
Voted
MOBICOM
2012
ACM
13 years 4 months ago
2012
ACM
As we are surrounded by an ever-larger variety of post-PC devices, the traditional methods for identifying and authenticating users have become cumbersome and time-consuming. In t...