46 search results - page 5 / 10 » crypto 2005 |
CRYPTO
2005
Springer
14 years 1 months ago
2005
Springer
In many important applications, a collection of mutually distrustful parties must perform private computation over multisets. Each party’s input to the function is his private i...
CRYPTO
2005
Springer
14 years 1 months ago
2005
Springer
We identify and fill some gaps with regard to consistency (the extent to which false positives are produced) for public-key encryption with keyword search (PEKS), providing new de...
CRYPTO
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Assuming an insecure quantum channel and an authenticated classical channel, we propose an unconditionally secure scheme for encrypting classical messages under a shared ...
CRYPTO
2007
Springer
14 years 1 months ago
2007
Springer
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}...
PKC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We propose multi-bit versions of several single-bit cryptosystems based on lattice problems, the error-free version of the Ajtai-Dwork cryptosystem by Goldreich, Goldwass...