Sciweavers

2253 search results - page 100 / 451
» Computing with Realizational Morphology
Sort
View
144
Voted
WIAS
2010
102views more  WIAS 2010»
15 years 2 months ago
Information security underlying transparent computing: Impacts, visions and challenges
The rapid development of computer network technologies and social informationalization has brought many new opportunities and challenges in information security. With improved info...
Yaoxue Zhang, Laurence Tianruo Yang, Yuezhi Zhou, ...
EUROCRYPT
2011
Springer
14 years 8 months ago
Faster Explicit Formulas for Computing Pairings over Ordinary Curves
Abstract. We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques, previously considere...
Diego F. Aranha, Koray Karabina, Patrick Longa, Ca...
CCS
2009
ACM
15 years 11 months ago
Computational soundness for key exchange protocols with symmetric encryption
Formal analysis of security protocols based on symbolic models has been very successful in finding flaws in published protocols and proving protocols secure, using automated too...
Ralf Küsters, Max Tuengerthal
UIC
2007
Springer
15 years 10 months ago
A Peer-to-Peer Semantic-Based Service Discovery Method for Pervasive Computing Environment
The paper proposes a novel distributed service discovery method for the pervasive computing environment. The method is based on the concept of small world, policy-based advertiseme...
Baopeng Zhang, Yuanchun Shi, Xin Xiao
AICCSA
2006
IEEE
168views Hardware» more  AICCSA 2006»
15 years 10 months ago
Power Efficient Algorithms for Computing Fast Fourier Transform over Wireless Sensor Networks
Collaborative signal processing is one of the most promising applications that are currently being investigated for sensor networks. In this paper, we use FFT computation as a veh...
Turkmen Canli, Ajay K. Gupta, Ashfaq A. Khokhar