1656 search results - page 255 / 332 » Secure Computation Without Authentication |
ACISP
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
SAC
2000
ACM
14 years 1 months ago
2000
ACM
Linda is a high level communication model which allows agents to communicate via a shared tuple spaces without knowing each other’s identities and without having to arrange for ...
TCS
2008
13 years 8 months ago
2008
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...
IACR
2011
12 years 8 months ago
2011
Secure two-party computation protocol allows two players, Alice with secret input x and Bob with secret input y, to jointly execute an arbitrary program π(x, y) such that only th...
CCS
2004
ACM
14 years 2 months ago
2004
ACM
Misuse-based intrusion detection systems rely on models of attacks to identify the manifestation of intrusive behavior. Therefore, the ability of these systems to reliably detect ...