23413 search results - page 4436 / 4683 » or 2005 |
197
click to vote
CRYPTO
2005
Springer
16 years 25 days ago
2005
Springer
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs. Such a computation must preserve certain security propertie...
209
click to vote
CRYPTO
2005
Springer
16 years 25 days ago
2005
Springer
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
193
click to vote
CRYPTO
2005
Springer
16 years 25 days ago
2005
Springer
We investigate several previously suggested scenarios of instantiating random oracles (ROs) with “realizable” primitives in cryptographic schemes. As candidates for such “in...
243
click to vote
CRYPTO
2005
Springer
16 years 25 days ago
2005
Springer
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
176
click to vote
CRYPTO
2005
Springer
16 years 25 days ago
2005
Springer
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...