Modern cryptography, probabilistic proofs and pseudo-randomness
From MaRDI portal
Publication:1273742
zbMath0907.94002MaRDI QIDQ1273742
Publication date: 6 January 1999
Published in: Algorithms and Combinatorics (Search for Journal in Brave)
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Random number generation in numerical analysis (65C10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)
Related Items
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, Proofs of proximity for context-free languages and read-once branching programs, A consequence of a proof of the one-way function existence for the problem of macroscopic superpositions, Exploring confusion in product ciphers through regression analysis, Quantum algorithms for the Goldreich-Levin learning problem, A simple remote user authentication scheme, Zero-knowledge identification scheme based on Weil pairing, Pseudo-deterministic Proofs, Appraising two decades of distributed computing theory research, A note on Yao's theorem about pseudo-random generators, Rapidly computing sparse Legendre expansions via sparse Fourier transforms, A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols, Practical construction and analysis of pseudo-randomness primitives, Distinguishing Distributions Using Chernoff Information, Pseudorandom generators without the XOR lemma, Computational sample complexity and attribute-efficient learning, Tweakable Enciphering Schemes from Hash-Sum-Expansion, Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs, Unnamed Item, Reducing complexity assumptions for statistically-hiding commitment, An overview of distinguishing attacks on stream ciphers, Unnamed Item, Interactive and probabilistic proof-checking, Quantum lower bounds for the Goldreich-Levin problem, A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence
