73 search results - page 9 / 15 » An Improved Construction for Universal Re-encryption |
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
EUROCRYPT
2005
Springer
14 years 1 months ago
2005
Springer
We present a general framework for constructing two-message oblivious transfer protocols using a modification of Cramer and Shoup’s notion of smooth projective hashing (2002). ...
ICWL
2005
Springer
14 years 1 months ago
2005
Springer
: Discovering the relationship between behavior and personality of learner in the web-based learning environment is a key to guide learners in the learning process. This paper prop...
ICPP
2003
IEEE
14 years 28 days ago
2003
IEEE
New demands brought by the continuing growth of the Internet will be met in part by more effective and comprehensive use of caching. This paper proposes to exploit client browser ...
IACR
2011
12 years 7 months ago
2011
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...