Sciweavers

465 search results - page 35 / 93
» Programmable Hash Functions and Their Applications
Sort
View
KIVS
2005
Springer
15 years 3 months ago
Measuring Large Overlay Networks - The Overnet Example
Peer-to-peer overlay networks have grown significantly in size and sophistication over the last years. Meanwhile, distributed hash tables (DHT) provide efficient means to create g...
Kendy Kutzner, Thomas Fuhrmann
PVM
2004
Springer
15 years 3 months ago
An Initial Analysis of the Impact of Overlap and Independent Progress for MPI
Abstract. The ability to offload functionality to a programmable network interface is appealing, both for increasing message passing performance and for reducing the overhead on t...
Ron Brightwell, Keith D. Underwood, Rolf Riesen
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
WEA
2010
Springer
397views Algorithms» more  WEA 2010»
15 years 4 months ago
A New Combinational Logic Minimization Technique with Applications to Cryptology
Abstract. A new technique for combinational logic optimization is described. The technique is a two-step process. In the first step, the nonlinearity of a circuit – as measured ...
Joan Boyar, René Peralta
IACR
2011
107views more  IACR 2011»
13 years 9 months ago
Structure Preserving CCA Secure Encryption and Its Application to Oblivious Third Parties
In this paper we present the first public key encryption scheme that is structure preserving, i.e., our encryption scheme uses only algebraic operations. In particular it does not...
Jan Camenisch, Kristiyan Haralambiev, Markulf Kohl...