Sciweavers

989 search results - page 117 / 198
» Pebbling and Proofs of Work
Sort
View
ECOOP
2010
Springer
14 years 26 days ago
The Essence of JavaScript
We reduce JavaScript to a core calculus structured as a small-step operational semantics. We present several peculiarities of the language and show that our calculus models them. W...
Arjun Guha, Claudiu Saftoiu, Shriram Krishnamurthi
EUROCRYPT
2004
Springer
14 years 1 months ago
Positive Results and Techniques for Obfuscation
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
Ben Lynn, Manoj Prabhakaran, Amit Sahai
STOC
2012
ACM
209views Algorithms» more  STOC 2012»
11 years 10 months ago
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
Anindya De, Ilias Diakonikolas, Vitaly Feldman, Ro...
PKC
2009
Springer
126views Cryptology» more  PKC 2009»
14 years 8 months ago
Verifiable Rotation of Homomorphic Encryptions
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...
Sebastiaan de Hoogh, Berry Schoenmakers, Boris Sko...
KDD
2006
ACM
130views Data Mining» more  KDD 2006»
14 years 8 months ago
Efficient anonymity-preserving data collection
The output of a data mining algorithm is only as good as its inputs, and individuals are often unwilling to provide accurate data about sensitive topics such as medical history an...
Justin Brickell, Vitaly Shmatikov