58 search results - page 3 / 12 » crypto 2008 |
CRYPTO
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We introduce new and general complexity theoretic hardumptions. These assumptions abstract out concrete properties of a random oracle and are significantly stronger than ...
CRYPTO
2008
Springer
13 years 7 months ago
2008
Springer
We present the first general protocol for secure multiparty computation in which the total amount of work required by n players to compute a function f grows only polylogarithmical...
DSD
2008
IEEE
13 years 7 months ago
2008
IEEE
The long-word and very long-word addition required in cryptography applications generally requires custom hardware support provided by ASICs or application-specific instructions i...
CRYPTO
2008
Springer
13 years 7 months ago
2008
Springer
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
CRYPTO
2008
Springer
13 years 7 months ago
2008
Springer
We propose a family of compression functions built from fixed-key blockciphers and investigate their collision and preimage security in the ideal-cipher model. The constructions ha...