Sciweavers

876 search results - page 40 / 176
» Limits on the Usefulness of Random Oracles
Sort
View
CRYPTO
2000
Springer
139views Cryptology» more  CRYPTO 2000»
14 years 3 months ago
On the Exact Security of Full Domain Hash
Abstract. The Full Domain Hash (FDH) scheme is a RSA-based signature scheme in which the message is hashed onto the full domain of the RSA function. The FDH scheme is provably secu...
Jean-Sébastien Coron
ACISP
2008
Springer
14 years 18 days ago
Efficient One-Round Key Exchange in the Standard Model
We consider one-round key exchange protocols secure in the standard model. The security analysis uses the powerful security model of Canetti and Krawczyk and a natural extension of...
Colin Boyd, Yvonne Cliff, Juan Manuel Gonzá...
WSC
1998
14 years 3 days ago
The Use of Simulation for Construction Elements Manufacturing
The manufacture of pre-cast concrete building elements consists of a few manufacturing steps. The process itself is simple, but the characteristics of the business are quite rando...
Katy Vern, Ali K. Gunal
DM
2008
104views more  DM 2008»
13 years 10 months ago
On edge-weighted recursive trees and inversions in random permutations
We introduce random recursive trees, where deterministically weights are attached to the edges according to the labeling of the trees. We will give a bijection between recursive t...
Markus Kuba, Alois Panholzer
CORR
2007
Springer
136views Education» more  CORR 2007»
13 years 10 months ago
The analytic computability of the Shannon transform for a large class of random matrix channels
We define a class of “algebraic” random matrix channels for which one can generically compute the limiting Shannon transform using numerical techniques and often enumerate th...
N. Raj Rao