Sciweavers

3328 search results - page 110 / 666
» On Plateaued Functions and Their Constructions
Sort
View
EUROCRYPT
2011
Springer
14 years 10 months ago
Homomorphic Signatures for Polynomial Functions
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an...
Dan Boneh, David Mandell Freeman
CORR
2006
Springer
131views Education» more  CORR 2006»
15 years 6 months ago
Analysis of LDGM and compound codes for lossy compression and binning
Abstract-- Recent work has suggested that low-density generator matrix (LDGM) codes are likely to be effective for lossy source coding problems. We derive rigorous upper bounds on ...
Emin Martinian, Martin J. Wainwright
TCC
2009
Springer
117views Cryptology» more  TCC 2009»
16 years 7 months ago
Towards a Theory of Extractable Functions
Extractable functions are functions where any adversary that outputs a point in the range of the function is guaranteed to "know" a corresponding preimage. Here, knowledg...
Ran Canetti, Ronny Ramzi Dakdouk
ASIACRYPT
2009
Springer
16 years 29 days ago
Foundations of Non-malleable Hash and One-Way Functions
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
Alexandra Boldyreva, David Cash, Marc Fischlin, Bo...
BMCBI
2005
87views more  BMCBI 2005»
15 years 6 months ago
ProfNet, a method to derive profile-profile alignment scoring functions that improves the alignments of distantly related protei
Background: Profile-profile methods have been used for some years now to detect and align homologous proteins. The best such methods use information from the background distributi...
Tomas Ohlson, Arne Elofsson