Sciweavers

2601 search results - page 133 / 521
» Secure Rewarding Schemes
Sort
View
CTRSA
2005
Springer
221views Cryptology» more  CTRSA 2005»
15 years 8 months ago
Accumulators from Bilinear Pairings and Applications
We propose a dynamic accumulator scheme from bilinear pairings, whose security is based on the Strong Diffie-Hellman assumption. We show applications of this accumulator in constru...
Lan Nguyen
JUCS
2008
156views more  JUCS 2008»
15 years 3 months ago
Efficient k-out-of-n Oblivious Transfer Schemes
Abstract: Oblivious transfer is an important cryptographic protocol in various security applications. For example, in on-line transactions, a k-out-of-n oblivious transfer scheme a...
Cheng-Kang Chu, Wen-Guey Tzeng
OTM
2007
Springer
15 years 9 months ago
Bayesian Analysis of Secure P2P Sharing Protocols
Ad hoc and peer-to-peer (P2P) computing paradigms pose a number of security challenges. The deployment of classic security protocols to provide services such as node authentication...
Esther Palomar, Almudena Alcaide, Juan M. Est&eacu...
COOPIS
2002
IEEE
15 years 8 months ago
Object Security Attributes: Enabling Application-Specific Access Control in Middleware
This paper makes two main contributions towards establishing support for application-specific factors in middleware security mechanisms. First, it develops a simple classification...
Konstantin Beznosov
SASN
2006
ACM
15 years 9 months ago
Location-aware key predistribution scheme for wide area wireless sensor networks
Key predistribution in wireless sensor networks refers to the problem of distributing secret keys among sensors prior to deployment. Solutions appeared in the literature can be cl...
Katerina Simonova, Alan C. H. Ling, Xiaoyang Sean ...