Sciweavers

2601 search results - page 491 / 521
» Secure Rewarding Schemes
Sort
View
FOAL
2007
ACM
15 years 3 months ago
Requirement enforcement by transformation automata
The goal of this work is to treat safety and security policies as requirements to be composed in an aspectual style with a developing application. Policies can be expressed either...
Douglas R. Smith
WCNC
2010
IEEE
15 years 3 months ago
MUTON: Detecting Malicious Nodes in Disruption-Tolerant Networks
—The Disruption Tolerant Networks (DTNs) are vulnerable to insider attacks, in which the legitimate nodes are compromised and the adversary modifies the delivery metrics of the ...
Yanzhi Ren, Mooi Choo Chuah, Jie Yang, Yingying Ch...
ACSC
2004
IEEE
15 years 3 months ago
Establishing Trust In Pure Ad-hoc Networks
An ad-hoc network of wireless nodes is a temporarily formed network, created, operated and managed by the nodes themselves. It is also often termed an infrastructure-less, self-or...
Asad Amir Pirzada, Chris McDonald
CISC
2006
Springer
131views Cryptology» more  CISC 2006»
15 years 3 months ago
Efficient Intrusion-Resilient Signatures Without Random Oracles
Intrusion-resilient signatures are key-evolving protocols that extend the concepts of forward-secure and key-insulated signatures. As in the latter schemes, time is divided into di...
Benoît Libert, Jean-Jacques Quisquater, Moti...
EUROCRYPT
2006
Springer
15 years 3 months ago
The Function Field Sieve in the Medium Prime Case
In this paper, we study the application of the function field sieve algorithm for computing discrete logarithms over finite fields of the form Fqn when q is a medium-sized prime po...
Antoine Joux, Reynald Lercier