Sciweavers

2517 search results - page 38 / 504
» Specifying Weak Sets
Sort
View
EUROCRYPT
2003
Springer
15 years 5 months ago
Resettable Zero-Knowledge in the Weak Public-Key Model
A new public-key model for resettable zero-knowledge (rZK) protocols, which is an extension and generalization of the upper-bounded public-key (UPK) model introduced by Micali and ...
Yunlei Zhao, Xiaotie Deng, Chan H. Lee, Hong Zhu
PLDI
2010
ACM
15 years 4 months ago
Mint: Java multi-stage programming using weak separability
Multi-stage programming (MSP) provides a disciplined approach to run-time code generation. In the purely functional setting, it has been shown how MSP can be used to reduce the ov...
Edwin Westbrook, Mathias Ricken, Jun Inoue, Yilong...
SWAT
2010
Springer
302views Algorithms» more  SWAT 2010»
15 years 4 months ago
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
Imran A. Pirwani, Mohammad R. Salavatipour
TCC
2007
Springer
86views Cryptology» more  TCC 2007»
15 years 6 months ago
Weakly-Private Secret Sharing Schemes
Abstract. Secret-sharing schemes are an important tool in cryptography that is used in the construction of many secure protocols. However, the shares’ size in the best known secr...
Amos Beimel, Matthew K. Franklin
CVPR
2010
IEEE
15 years 5 months ago
Weakly-Supervised Hashing in Kernel Space
The explosive growth of the vision data motivates the recent studies on efficient data indexing methods such as locality-sensitive hashing (LSH). Most existing approaches perform...
Yadong Mu, Jialie Shen, Shuicheng Yan