Computational complexity and property testing on the interplay between randomness and computation von Goldreich, Oded 1957-

Weitere Verfasser: “… Goldreich, Oded 1957- …”
Volltext öffnen

P, NP, and NP-completeness the basics of computational complexity von Goldreich, Oded 1957-

Inhaltsverzeichnis

A primer on pseudorandom generators von Goldreich, Oded 1957-

Inhaltsverzeichnis

Foundations of cryptography von Goldreich, Oded 1957-

Foundations of cryptography von Goldreich, Oded 1957-

Foundations of cryptography basic tools von Goldreich, Oded 1957-

Foundations of cryptography von Goldreich, Oded 1957-

Three XOR-Lemmi an exposition von Goldreich, Oded 1957-

A uniform-complexity treatment of encryption and zero-knowledge von Goldreich, Oded 1957-

The best of both worlds Guaranteeing termination in fast randomized Byzantine agreement protocols von Goldreich, Oded 1957-, Petrank, Erez

A simple construction of almost k-wise independent random variables von Goldreich, Oded 1957-, Håstad, Torkel Johan 1960-

On the complexity of computation in the presence of link failures the case of a ring von Goldreich, Oded 1957-, Shrira, Liuba

A uniform-complexity treatment of encryption and zero-knowledge von Goldreich, Oded 1957-

Unbiased bits from sources of weak randomness and probabilistic communication complexity von Chor, Benny, Goldreich, Oded 1957-

Two remarks concerning the Goldwasser-Micali-Rivest signature scheme von Goldreich, Oded 1957-

Sending certified mail using oblivious transfer and a theshold scheme von Goldreich, Oded 1957-

RSA Rabin least significant bits are 1 2 + 1 poly log N secure von Chor, Benny, Goldreich, Oded 1957-

On concurrent identification protocols von Goldreich, Oded 1957-

A primer on pseudorandom generators von Goldreich, Oded 1957-

Volltext öffnen

Computational complexity a conceptual perspective von Goldreich, Oded 1957-

Inhaltsverzeichnis