Sciweavers

876 search results - page 84 / 176
» Limits on the Usefulness of Random Oracles
Sort
View
IDA
2009
Springer
14 years 10 months ago
Hierarchical Extraction of Independent Subspaces of Unknown Dimensions
Abstract. Independent Subspace Analysis (ISA) is an extension of Independent Component Analysis (ICA) that aims to linearly transform a random vector such as to render groups of it...
Peter Gruber, Harold W. Gutch, Fabian J. Theis
133
Voted
PKC
2009
Springer
172views Cryptology» more  PKC 2009»
16 years 1 months ago
CCA-Secure Proxy Re-encryption without Pairings
ded abstract of this paper appears in PKC 2009, S. Jarecki, G. Tsudik (Eds.), volume 5443 of LNCS, pp. 357-376, Sringer-Verlag, 2009. CCA-Secure Proxy Re-Encryption without Pairing...
Jun Shao, Zhenfu Cao
SISAP
2009
IEEE
149views Data Mining» more  SISAP 2009»
15 years 7 months ago
Combinatorial Framework for Similarity Search
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
Yury Lifshits
102
Voted
ACSC
2008
IEEE
15 years 7 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
PODC
2005
ACM
15 years 6 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder