Sciweavers

7796 search results - page 1374 / 1560
» On Generalized Schur Numbers
Sort
View
CRYPTO
2005
Springer
125views Cryptology» more  CRYPTO 2005»
15 years 3 months ago
Secure Computation Without Authentication
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...
Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pa...
CRYPTO
2005
Springer
144views Cryptology» more  CRYPTO 2005»
15 years 3 months ago
Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
We investigate several previously suggested scenarios of instantiating random oracles (ROs) with “realizable” primitives in cryptographic schemes. As candidates for such “in...
Alexandra Boldyreva, Marc Fischlin
CRYPTO
2005
Springer
163views Cryptology» more  CRYPTO 2005»
15 years 3 months ago
On the Generic Insecurity of the Full Domain Hash
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...
Yevgeniy Dodis, Roberto Oliveira, Krzysztof Pietrz...
DRM
2005
Springer
15 years 3 months ago
Hybrid static-dynamic attacks against software protection mechanisms
Advances in reverse engineering and program analyses have made software extremely vulnerable to malicious host attacks. These attacks typically take the form of intellectual prope...
Matias Madou, Bertrand Anckaert, Bjorn De Sutter, ...
EMSOFT
2005
Springer
15 years 3 months ago
Deeply embedded XML communication: towards an interoperable and seamless world
Current consumer electronics devices do not interoperate and are hard to use. Devices use proprietary, device-specific and inflexible protocols. Resources across device classes, s...
Johannes Helander
« Prev « First page 1374 / 1560 Last » Next »