Sciweavers

2492 search results - page 264 / 499
» On the General Signature Trees
Sort
View
CRYPTO
2012
Springer
222views Cryptology» more  CRYPTO 2012»
13 years 8 months ago
Secure Identity-Based Encryption in the Quantum Random Oracle Model
We give the first proof of security for an identity-based encryption scheme in the quantum random oracle model. This is the first proof of security for any scheme in this model ...
Mark Zhandry
CVPR
2012
IEEE
13 years 8 months ago
Intrinsic shape context descriptors for deformable shapes
In this work, we present intrinsic shape context (ISC) descriptors for 3D shapes. We generalize to surfaces the polar sampling of the image domain used in shape contexts: for this...
Iasonas Kokkinos, Michael M. Bronstein, Roee Litma...
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
16 years 6 months ago
Privacy-Preserving Data Mining through Knowledge Model Sharing
Privacy-preserving data mining (PPDM) is an important topic to both industry and academia. In general there are two approaches to tackling PPDM, one is statistics-based and the oth...
Patrick Sharkey, Hongwei Tian, Weining Zhang, Shou...
140
Voted
SSS
2005
Springer
15 years 11 months ago
Synchronous vs. Asynchronous Unison
This paper considers the self-stabilizing unison problem. The contribution of this paper is threefold. First, we establish that when any self-stabilizing asynchronous unison protoc...
Christian Boulinier, Franck Petit, Vincent Villain
SPAA
2004
ACM
15 years 11 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter