180 search results - page 25 / 36 » Discrete Logarithm Based Protocols |
130
click to vote
EUROCRYPT
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
WWW
2004
ACM
15 years 10 months ago
2004
ACM
Centralized Resource Description Framework (RDF) repositories have limitations both in their failure tolerance and in their scalability. Existing Peer-to-Peer (P2P) RDF repositori...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
PEWASUN
2006
ACM
15 years 3 months ago
2006
ACM
In wireless network planning, much effort is spent on the improvement of the network and transport layer – especially for Mobile Ad Hoc Networks. Although in principle realworl...
ASIACRYPT
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...