Result 1 to 20 of 124 total
Incremental deterministic public-key encryption. (English)
Pointcheval, David (ed.) et al., Advances in cryptology ‒ EUROCRYPT 2012. 31st annual international conference on the theory and applications of cryptographic techniques, Cambridge, UK, April 15‒19, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29010-7/pbk). Lecture Notes in Computer Science 7237, 628-644 (2012).
1
On the power of the randomized iterate. (English)
SIAM J. Comput. 40, No. 6, 1486-1528 (2011).
2
Fairness through awareness. (English)
Comput. Res. Repos. 2011, Article No. 1104.3913 (2011).
3
Balls and bins: smaller hash families and faster evaluation. (English)
Electron. Colloq. Comput. Complex. 18, 68 (2011).
4
S-T connectivity on digraphs with a known stationary distribution (English)
ACM Transactions on Algorithms 7, No. 3, 30 (2011).
5
Only valuable experts can be valued (English)
ACM Conference on Electronic Commerce, 221-222 (2011).
6
Pseudorandom generators for combinatorial shapes (English)
STOC, 253-262 (2011).
7
Universal one-way hash functions via inaccessible entropy. (English)
Gilbert, Henri (ed.), Advances in cryptology ‒ EUROCRYPT 2010. 29th annual international conference on the theory and applications of cryptographic techniques, French Riviera, May 30 ‒ June 3, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13189-9/pbk). Lecture Notes in Computer Science 6110, 616-637 (2010).
8
Universal one-way hash functions via inaccessible entropy (English)
IACR Cryptology ePrint Archive 2010, 120 (2010).
9
Universal one-way hash functions via inaccessible entropy (English)
EUROCRYPT, 616-637 (2010).
10
The limits of two-party differential privacy (English)
FOCS, 81-90 (2010).
11
Efficiency improvements in constructing pseudorandom generators from one-way functions (English)
STOC, 437-446 (2010).
12
Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function. (English)
SIAM J. Comput. 39, No. 3, 1153-1218 (2009).
13
Pseudorandom bit generators that fool modular sums. (English)
Dinur, Irit (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 12th international workshop, APPROX 2009, and 13th international workshop, RANDOM 2009, Berkeley, CA, USA, August 21‒23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03684-2/pbk). Lecture Notes in Computer Science 5687, 615-630 (2009).
14
How well do random walks parallelize? (English)
Dinur, Irit (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 12th international workshop, APPROX 2009, and 13th international workshop, RANDOM 2009, Berkeley, CA, USA, August 21‒23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03684-2/pbk). Lecture Notes in Computer Science 5687, 476-489 (2009).
15
Computational differential privacy. (English)
Halevi, Shai (ed.), Advances in cryptology ‒ CRYPTO 2009. 29th annual international cryptology conference, Santa Barbara, CA, USA, August 16‒20, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03355-1/pbk). Lecture Notes in Computer Science 5677, 126-142 (2009).
16
Derandomized constructions of $k$-wise (almost) independent permutations. (English)
Algorithmica 55, No. 1, 113-133 (2009).
17
Theory of cryptography. 6th theory of cryptography conference, TCC 2009, San Francisco, CA, USA, March 15‒17, 2009. Proceedings. (English)
Lecture Notes in Computer Science 5444. Berlin: Springer (ISBN 978-3-642-00456-8/pbk). xi, 615~p. EUR~78.06 (2009).
18
Players’ effects under limited independence (English)
Math. Oper. Res. 34, No. 4, 971-980 (2009).
19
Computational differential privacy (English)
CRYPTO, 126-142 (2009).
20
Result 1 to 20 of 124 total
Start
Contact
Print
General Help
