Sciweavers

2601 search results - page 117 / 521
» Secure Rewarding Schemes
Sort
View
ICIP
2010
IEEE
15 years 1 months ago
Security analysis for privacy preserving search of multimedia
With the increasing popularity of digital multimedia such as images and videos and the advent of the cloud computing paradigm, a fast growing amount of private and sensitive multi...
Wenjun Lu, Avinash L. Varna, Min Wu
CCS
2010
ACM
15 years 3 months ago
Secure latency estimation with treeple
A network latency estimation scheme associates a "position" to every peer in a distributed network such that the latency between any two nodes can be accurately estimate...
Eric Chan-Tin, Nicholas Hopper
ITIIS
2008
128views more  ITIIS 2008»
15 years 3 months ago
An Asymmetric Key-Based Security Architecture for Wireless Sensor Networks
In spite of previous common assumptions about the incompatibility of public key cryptography (PKC) schemes with wireless sensor networks (WSNs), recent works have shown that they ...
Md. Mokammel Haque, Al-Sakib Khan Pathan, Choong S...
EUROCRYPT
2011
Springer
14 years 6 months ago
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
Abstract. NTRUEncrypt, proposed in 1996 by Hostein, Pipher and Silverman, is the fastest known lattice-based encryption scheme. Its moderate key-sizes, excellent asymptotic perfor...
Damien Stehlé, Ron Steinfeld
ICALP
2005
Springer
15 years 8 months ago
On Steganographic Chosen Covertext Security
At TCC 2005, Backes and Cachin proposed a new and very strong notion of security for public key steganography: secrecy against adaptive chosen covertext attack (SS-CCA); and posed ...
Nicholas Hopper