Sciweavers

261 search results - page 50 / 53
» On the Security of Some Password-Based Key Agreement Schemes
Sort
View
ACNS
2004
Springer
133views Cryptology» more  ACNS 2004»
15 years 1 months ago
Limited Verifier Signature from Bilinear Pairings
Motivated by the conflict between authenticity and privacy in the digital signature, the notion of limited verifier signature was introduced [1]. The signature can be verified by a...
Xiaofeng Chen, Fangguo Zhang, Kwangjo Kim
69
Voted
GLOBECOM
2006
IEEE
15 years 3 months ago
On the Feasibility of Very Low Complexity Trust Modules Using PKPS Synergies
Abstract— For many evolving application scenarios like ubiquitous and autonomic computing systems, trustworthy computing solutions are essential. However the fact that the autono...
Mahalingam Ramkumar
FSTTCS
2003
Springer
15 years 2 months ago
Moderately Hard Functions: From Complexity to Spam Fighting
A key idea in cryptography is using hard functions in order to obtain secure schemes. The theory of hard functions (e.g. one-way functions) has been a great success story, and the ...
Moni Naor
ASIACRYPT
2001
Springer
15 years 2 months ago
Fully Distributed Threshold RSA under Standard Assumptions
The aim of this article is to propose a fully distributed environment for the RSA scheme. What we have in mind is highly sensitive applications and even if we are ready to pay a pr...
Pierre-Alain Fouque, Jacques Stern
WMCSA
2008
IEEE
15 years 3 months ago
Distributed authentication for low-cost wireless networks
Cost is one of the key challenges facing the deployment of wireless networks. Though 802.11-based networks have shown that costly, licensed spectrum is not always necessary, the c...
Sridhar Machiraju, Hao Chen, Jean Bolot