Sciweavers

231 search results - page 20 / 47
» Algorithms for Quantum Computation: Discrete Logarithms and ...
Sort
View
ACSC
2008
IEEE
14 years 2 months ago
Privacy preserving set intersection based on bilinear groups
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
Yingpeng Sang, Hong Shen
JEI
2008
129views more  JEI 2008»
13 years 6 months ago
Removable visible image watermarking algorithm in the discrete cosine transform domain
Abstract. A removable visible watermarking scheme, which operates in the discrete cosine transform (DCT) domain, is proposed for combating copyright piracy. First, the original wat...
Ying Yang, Xingming Sun, Hengfu Yang, Chang-Tsun L...
ICALP
2009
Springer
14 years 7 months ago
Towards Optimal Range Medians
We consider the following problem: given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the inter...
Beat Gfeller, Peter Sanders
JOC
2000
181views more  JOC 2000»
13 years 7 months ago
Security Arguments for Digital Signatures and Blind Signatures
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...
David Pointcheval, Jacques Stern
MOC
2011
13 years 2 months ago
Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points
Using the concept of Geometric Weakly Admissible Meshes (see §2 below) together with an algorithm based on the classical QR factorization of matrices, we compute efficient points...
Len Bos, Jean-Paul Calvi, Norman Levenberg, Alvise...