679 search results - page 65 / 136 » Using decision problems in public key cryptography |
114
click to vote
APBC
2003
15 years 2 months ago
2003
In this paper we suggest the requirements for an open platform designed for the description, distribution and analysis of genetic polymorphism data. This platform is discussed in ...
ENTCS
2007
15 years 1 months ago
2007
Protocol Composition Logic (PCL) is a logic for proving security properties of network protocols that use public and symmetric key cryptography. The logic is designed around a pro...
149
click to vote
CCS
2008
ACM
15 years 3 months ago
2008
ACM
Certificateless cryptography achieves the best of the two worlds: it inherits from identity-based techniques a solution to the certificate management problem in public-key encrypti...
119
click to vote
SAC
2005
ACM
15 years 7 months ago
2005
ACM
: This paper presents a system for induction of forest of functional trees from data streams able to detect concept drift. The Ultra Fast Forest of Trees (UFFT) is an incremental a...
127
click to vote
COMPGEOM
1996
ACM
15 years 5 months ago
1996
ACM
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...