Sciweavers

7924 search results - page 217 / 1585
» Non-Malleable Functions and Their Applications
Sort
View
ECCC
2011
207views ECommerce» more  ECCC 2011»
15 years 2 months ago
Balls and Bins: Smaller Hash Families and Faster Evaluation
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wied...
SIAMSC
2011
177views more  SIAMSC 2011»
15 years 2 months ago
Computing f(A)b via Least Squares Polynomial Approximations
Given a certain function f, various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly comp...
Jie Chen, Mihai Anitescu, Yousef Saad
TCC
2012
Springer
226views Cryptology» more  TCC 2012»
14 years 2 months ago
On the Instantiability of Hash-and-Sign RSA Signatures
The hash-and-sign RSA signature is one of the most elegant and well known signatures schemes, extensively used in a wide variety of cryptographic applications. Unfortunately, the o...
Yevgeniy Dodis, Iftach Haitner, Aris Tentes
LOBJET
2000
134views more  LOBJET 2000»
15 years 7 months ago
Transparent Dynamic Database Evolution from Java
: With the increasing provision by the ODMG standard and commercial OODBMS products for transparent access to the traditional database functionality of an OODBMS from Java, there i...
Awais Rashid, Peter Sawyer
INFSOF
2002
95views more  INFSOF 2002»
15 years 6 months ago
Semantic and behavioral library transformations
While software methodology encourages the use of libraries and advocates architectures of layered libraries, in practice the composition of libraries is not always seamless and th...
Sibylle Schupp, Douglas Gregor, David R. Musser, S...