Sciweavers

14 search results - page 3 / 3
» A Composition Theorem for Universal One-Way Hash Functions
Sort
View
ACNS
2009
Springer
168views Cryptology» more  ACNS 2009»
13 years 12 months ago
How to Extract and Expand Randomness: A Summary and Explanation of Existing Results
Abstract. We examine the use of randomness extraction and expansion in key agreement (KA) protocols to generate uniformly random keys in the standard model. Although existing works...
Yvonne Cliff, Colin Boyd, Juan Manuel Gonzá...
CSL
2010
Springer
13 years 6 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
CRYPTO
2009
Springer
166views Cryptology» more  CRYPTO 2009»
13 years 12 months ago
Public-Key Cryptosystems Resilient to Key Leakage
Most of the work in the analysis of cryptographic schemes is concentrated in abstract adversarial models that do not capture side-channel attacks. Such attacks exploit various for...
Moni Naor, Gil Segev
BMCBI
2007
107views more  BMCBI 2007»
13 years 5 months ago
Reuse of structural domain-domain interactions in protein networks
Background: Protein interactions are thought to be largely mediated by interactions between structural domains. Databases such as iPfam relate interactions in protein structures t...
Benjamin Schuster-Böckler, Alex Bateman