1048 search results - page 104 / 210 » Best Probabilistic Transformers |
202
click to vote
ASIACRYPT
2011
Springer
14 years 6 months ago
2011
Springer
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
190
click to vote
IACR
2011
14 years 5 months ago
2011
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
141
click to vote
WWW
2003
ACM
16 years 6 months ago
2003
ACM
A modern approach for generating individualized web-sites is to compose a page out of individual elements, for instance XML-fragments, which is eventually transformed to . If the ...
160
click to vote
PPDP
2007
Springer
16 years 9 days ago
2007
Springer
Program transformation is an appealing technique which allows to improve run-time efficiency, space-consumption and more generally to optimize a given program. Essentially it con...
168
click to vote
PKC
2009
Springer
16 years 6 months ago
2009
Springer
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...