|
21 |
Modern cryptography, probabilistic proofs and pseudorandomness Goldreich, Oded. - Berlin : Springer, 1999
|
|
|
22 |
A uniform-complexity treatment of encryption and zero-knowledge Enthalten in Journal of cryptology Bd. 6, Nr. 1, date:03.1993: 21-53
|
|
|
23 |
Randomness in interactive proofs Enthalten in Computational complexity Bd. 3, Nr. 4, date:12.1993: 319-354
|
|
|
24 |
On the complexity of computation in the presence of link failures: the case of a ring Enthalten in Distributed computing Bd. 5, Nr. 3, date:12.1991: 121-131
|
|
|
25 |
A Lower Bound on the Complexity of Testing Grained Distributions Enthalten in Computational complexity Bd. 32, 26.10.2023, Nr. 2, date:12.2023: 1-16
|
|
|
26 |
Good permutation codes based on the shuffle-exchange network Enthalten in Israel journal of mathematics Bd. 256, 10.10.2023, Nr. 1, date:9.2023: 283-296
|
|
|
27 |
Special Issue On Worst-case Versus Average-case Complexity Editors’ Foreword Enthalten in Computational complexity Bd. 16, 5.12.2007, Nr. 4, date:12.2007: 325-330
|
|
|
28 |
Goldreich, Oded 1957- / Informatiker
|
|