Modern cryptography, probabilistic proofs and pseudo-randomness

zbMath0907.94002MaRDI QIDQ1273742

Oded Goldreich

Publication date: 6 January 1999

Published in: Algorithms and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

cryptography; pseudorandomness; zero-knowledge; probabilistic proof systems

Mathematics Subject Classification ID

68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science

94A60: Cryptography

68P25: Data encryption (aspects in computer science)

65C10: Random number generation in numerical analysis

94-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory

Related Items

Tweakable Enciphering Schemes from Hash-Sum-Expansion, Pseudorandom generators without the XOR lemma, Computational sample complexity and attribute-efficient learning, Exploring confusion in product ciphers through regression analysis, Reducing complexity assumptions for statistically-hiding commitment, An overview of distinguishing attacks on stream ciphers, A simple remote user authentication scheme, Interactive and probabilistic proof-checking, In search of an easy witness: Exponential time vs. probabilistic polynomial time., More efficient PAC-learning of DNF with membership queries under the uniform distribution, A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols, Practical construction and analysis of pseudo-randomness primitives