Sciweavers

221 search results - page 24 / 45
» Secure Public Instant Messaging
Sort
View
IJNSEC
2011
108views more  IJNSEC 2011»
13 years 3 months ago
Cryptanalysis and Fixed of Short Signature Scheme without Random Oracle from Bilinear Parings
We first analyze the security of a short signature scheme without random oracles called ZCSM scheme and point out that it cannot support unforgeable under the chosen message and ...
Mingwu Zhang, Bo Yang, Yusheng Zhong, Pengcheng Li...
ICEIS
2009
IEEE
14 years 3 months ago
Minable Data Warehouse
Data warehouses have been widely used in various capacities such as large corporations or public institutions. These systems contain large and rich datasets that are often used by ...
David Morgan, Jai W. Kang, James M. Kang
CSMR
2011
IEEE
13 years 21 days ago
RTFM (Read the Factual Mails) - Augmenting Program Comprehension with Remail
—The advent of globalization has led to the adoption of distributed software development as a common practice. One of its drawbacks -the absence of impromptu meetingsis tackled w...
Alberto Bacchelli, Michele Lanza, Vitezslav Humpa
IJBC
2006
80views more  IJBC 2006»
13 years 9 months ago
Return-Map Cryptanalysis Revisited
As a powerful cryptanalysis tool, the method of return-map attacks can be used to extract secret messages masked by chaos in secure communication schemes. Recently, a simple defen...
Shujun Li, Guanrong Chen, Gonzalo Álvarez
IJNSEC
2010
128views more  IJNSEC 2010»
13 years 3 months ago
New Efficient Searchable Encryption Schemes from Bilinear Pairings
Public key encryption with keyword search (PEKS) enables user Alice to send a secret key TW to a server that will enable the server to locate all encrypted messages containing the...
Chunxiang Gu, Yuefei Zhu