Sciweavers

270 search results - page 44 / 54
» Practical forward secure group signature schemes
Sort
View
80
Voted
EUROCRYPT
2006
Springer
15 years 1 months ago
Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
The Isomorphism of Polynomials (IP) [28], which is the main concern of this paper, originally corresponds to the problem of recovering the secret key of a C scheme [26]. Besides, t...
Jean-Charles Faugère, Ludovic Perret
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
15 years 3 months ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz
SASN
2003
ACM
15 years 2 months ago
Admission control in Peer-to-Peer: design and performance evaluation
Peer-to-Peer (P2P) applications and services are very common in today’s computing. The popularity of the P2P paradigm prompts the need for specialized security services which ma...
Nitesh Saxena, Gene Tsudik, Jeong Hyun Yi
MOBIHOC
2005
ACM
15 years 9 months ago
An efficient scheme for authenticating public keys in sensor networks
With the advance of technology, Public Key Cryptography (PKC) will sooner or later be widely used in wireless sensor networks. Recently, it has been shown that the performance of ...
Wenliang Du, Ronghua Wang, Peng Ning
GLOBECOM
2009
IEEE
14 years 7 months ago
Secure Unified Cellular Ad Hoc Network Routing
Abstract--Previous simulations have shown substantial performance gains can be achieved by using hybrid cellular and wireless LAN (WLAN) approaches [1]. In a hybrid system, a proxy...
Jason J. Haas, Yih-Chun Hu