Sciweavers

2237 search results - page 47 / 448
» On the Security of Random Sources
Sort
View
PQCRYPTO
2010
250views Cryptology» more  PQCRYPTO 2010»
15 years 1 months ago
Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
Abstract. We propose a variant of the “bonsai tree” signature scheme, a latticebased existentially unforgeable signature scheme in the standard model. Our construction offers ...
Markus Rückert
77
Voted
EMNLP
2008
14 years 11 months ago
Weakly-Supervised Acquisition of Labeled Class Instances using Graph Random Walks
We present a graph-based semi-supervised label propagation algorithm for acquiring opendomain labeled classes and their instances from a combination of unstructured and structured...
Partha Pratim Talukdar, Joseph Reisinger, Marius P...
CSFW
2010
IEEE
15 years 1 months ago
On Protection by Layout Randomization
Abstract—Layout randomization is a powerful, popular technique for software protection. We present it and study it in programming-language terms. More specifically, we consider ...
Martín Abadi, Gordon D. Plotkin
ASIACRYPT
2006
Springer
15 years 1 months ago
HIBE With Short Public Parameters Without Random Oracle
Abstract. At Eurocrypt 2005, Waters presented an identity based encryption (IBE) protocol which is secure in the full model without random oracle. In this paper, we extend Waters&#...
Sanjit Chatterjee, Palash Sarkar
CORR
2008
Springer
71views Education» more  CORR 2008»
14 years 9 months ago
On Successive Refinement for the Kaspi/Heegard-Berger Problem
Consider a source that produces independent copies of a triplet of jointly distributed random variables, {Xi, Yi, Zi}
Alina Maor, Neri Merhav