Sciweavers

88 search results - page 9 / 18
» Security Analysis of Two Signcryption Schemes
Sort
View
SIGMOD
2012
ACM
250views Database» more  SIGMOD 2012»
12 years 2 days ago
Authenticating location-based services without compromising location privacy
The popularity of mobile social networking services (mSNSs) is propelling more and more businesses, especially those in retailing and marketing, into mobile and location-based for...
Haibo Hu, Jianliang Xu, Qian Chen, Ziwei Yang
ICALP
2005
Springer
14 years 3 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
COMCOM
2007
149views more  COMCOM 2007»
13 years 9 months ago
Adaptive security design with malicious node detection in cluster-based sensor networks
Distributed wireless sensor networks have problems on detecting and preventing malicious nodes, which always bring destructive threats and compromise multiple sensor nodes. Theref...
Meng-Yen Hsieh, Yueh-Min Huang, Han-Chieh Chao
VLSID
2003
IEEE
208views VLSI» more  VLSID 2003»
14 years 2 months ago
Cryptosystem Designed for Embedded System Security
— This paper reports a cryptosystem designed for security of embedded systems. It is based on the theory of Cellular Automata(CA). The Cellular Automata based Cryptosystem(CAC) e...
Subhayan Sen, Sk. Iqbal Hossain, Kabirul Islam, Di...
ASIACRYPT
2010
Springer
13 years 7 months ago
Faster Fully Homomorphic Encryption
Abstract. We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardn...
Damien Stehlé, Ron Steinfeld