73 search results - page 1 / 15 » An Improved Construction for Universal Re-encryption |
PET
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Golle et al recently introduced universal re-encryption, defining it as re-encryption by a player who does not know the key used for the original encryption, but which s...
IPL
2006
13 years 4 months ago
2006
Valiant (1979) proved that every polynomial of formula size e is a projection of the (e + 2)
ICCS
2005
Springer
13 years 10 months ago
2005
Springer
In this paper we address two optimization problems arising in the design of genomic assays based on universal tag arrays. First, we address the universal array tag set design probl...
ICISC
2007
13 years 6 months ago
2007
Naor and Reingold had proposed the construction of a strong pseudo-random permutation (SPRP) by using a layer of ECB encryption between two layers of invertible block-wise universa...
FC
2010
Springer
13 years 8 months ago
2010
Springer
This paper presents compact message formats for onion routing circuit construction using the Sphinx methodology developed for mixes. We significantly compress the circuit constru...